QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#307022	#1904. Permutation Transformation	5ab	AC ✓	7ms	4200kb	C++20	3.4kb	2024-01-17 19:59:20	2024-01-17 19:59:21

Judging History

This is the latest submission verdict.

[2024-01-17 19:59:21]
Judged

Verdict: AC
Time: 7ms
Memory: 4200kb

Show

[2024-01-17 19:59:20]
Submitted

answer

/* name: abc
 * author: 5ab
 * created at: 2024-01-17
 */
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
const int N = 100;

int a[N], b[N];

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int cas, n, k;
	
	cin >> cas;
	while (cas--)
	{
		cin >> n >> k;
		for (int i = 0; i < n; i++)
			cin >> a[i], a[i]--;
		for (int i = 0, x; i < n; i++)
		{
			cin >> x;
			b[x - 1] = i;
		}
		for (int i = 0; i < n; i++)
			a[i] = b[a[i]];
		
		// for (int i = 0; i < n; i++)
		// 	cerr << a[i] << " \n"[i == n - 1];
		vector<pair<int, int>> ops;
		bool hans = 1;
		if (k == 1)
		{
			for (int i = 0; i < n; i++)
			{
				for (int j = i; j < n; j++)
					if (a[j] == i)
					{
						ops.emplace_back(j, i);
						rotate(a + i, a + j, a + j + 1);
						break;
					}
			}
		}
		else if (k == n)
		{
			for (int i = 0; i < n; i++)
				if (a[i] != i)
					hans = 0;
		}
		else if (k == n - 1)
		{
			int sp = a[0];
			for (int i = 1; i < n; i++)
				if ((a[i] - i + n) % n != sp)
					hans = 0;
			if (hans)
			{
				for (int i = 0; i < sp; i++)
					ops.emplace_back(0, 1);
			}
		}
		else
		{
			int ivs = 0;
			for (int i = 0; i < n; i++)
				for (int j = i + 1; j < n; j++)
					if (a[i] > a[j])
						ivs ^= 1;
			if (ivs && k % 2 == 0)
				hans = 0;
			else
			{
				// cerr << ivs << endl;
				// for (int i = 0; i < n; i++)
				// 	cerr << a[i] << " \n"[i == n - 1];
				if (ivs)
				{
					ops.emplace_back(1, 0);
					rotate(a, a + 1, a + k + 1);
				}
				vector<pair<int, int>> cb;
				while (!is_sorted(a, a + n))
				{
					// for (int i = 0; i < n; i++)
					// 	cerr << a[i] << " \n"[i == n - 1];
					int sp = 0, cx = -1;
					for (int i = 0; i < n; i++, sp++)
						if (a[i] != i)
							break;
					for (int j = sp + 1; j < n; j++)
						if (sp == a[j])
						{
							cx = j;
							break;
						}
					// cerr << sp << " " << cx << endl;
					if (k == 2)
					{
						if (sp + 1 != cx)
						{
							ops.emplace_back(cx - 2, cx - 1);
							rotate(a + cx - 2, a + cx, a + cx + 1);
						}
						else
						{
							ops.emplace_back(cx, cx - 1);
							rotate(a + cx - 1, a + cx, a + cx + 2);
						}
					}
					else
					{
						int lim = max(sp, cx - 2);
						for (int j = 0; j < lim; )
						{
							int d = min(n - k, lim - j);
							ops.emplace_back(d, 0);
							cb.emplace_back(0, d);
							j += d;
						}
						if (sp + 1 != cx)
						{
							ops.emplace_back(2, 0);
							ops.emplace_back(1, 2);
							ops.emplace_back(1, 2);
							rotate(a + cx - 2, a + cx, a + cx + 1);
						}
						else
						{
							ops.emplace_back(2, 1);
							ops.emplace_back(2, 1);
							ops.emplace_back(0, 2);
							rotate(a + cx - 1, a + cx, a + cx + 2);
						}
						while (!cb.empty())
						{
							ops.push_back(cb.back());
							cb.pop_back();
						}
					}
				}
			}
		}
		if (!hans)
			cout << "NO\n";
		else
		{
			cout << "YES\n";
			cout << ssz(ops) << "\n";
			for (auto [x, y] : ops)
				cout << x + 1 << " " << y + 1 << "\n";
		}
	}
	
	return 0;
}
// started coding at: 01-17 09:39:40

源文件, 语言: C++20

这程序好像有点Bug，我给组数据试试？

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

input:

output:

YES
2
1 1
2 2
NO
YES
2
1 2
1 2

result:

ok 3 test cases (3 test cases)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

output:

YES
0
NO
NO
YES
0

result:

ok 4 test cases (4 test cases)

Test #3:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

output:

YES
2
2 1
2 2
NO
YES
0
YES
2
1 1
2 2
YES
2
2 1
2 2
YES
2
1 1
2 2
YES
2
1 1
2 2
YES
2
2 1
2 2
YES
2
2 1
2 2
YES
0
YES
2
1 1
2 2
YES
2
2 1
2 2
YES
2
2 1
2 2
YES
2
2 1
2 2
YES
2
1 1
2 2
YES
2
1 1
2 2
YES
0
YES
2
1 1
2 2
YES
2
2 1
2 2
YES
2
1 1
2 2
YES
2
1 1
2 2
YES
2
1 1
2 2
YES
0
YES
0
YES
2
2 1
2 2
N...

result:

ok 50 test cases (50 test cases)

Test #4:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

12
8 7
6 2 1 8 5 7 3 4
5 7 3 4 6 2 1 8
8 7
7 6 1 2 5 4 8 3
8 3 7 6 1 2 5 4
8 7
3 5 4 6 7 8 2 1
7 8 2 1 3 5 4 6
8 7
6 5 8 4 7 3 2 1
2 1 6 5 8 4 7 3
8 7
3 2 8 6 1 5 4 7
7 3 2 8 6 1 5 4
8 7
7 1 3 2 4 5 6 8
5 6 8 7 1 3 2 4
8 7
7 2 4 5 1 6 8 3
1 6 8 3 7 2 4 5
8 7
5 6 4 3 1 8 2 7
1 8 2 7 5 6 4 3
8 7
3 5 6...

output:

result:

ok 12 test cases (12 test cases)

Test #5:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

16
6 4
5 3 6 2 1 4
6 4 3 5 1 2
6 4
6 2 5 1 3 4
5 2 1 3 6 4
6 4
6 5 3 2 4 1
1 4 3 5 2 6
6 4
6 3 5 4 1 2
2 6 5 1 3 4
6 4
2 6 4 5 3 1
6 1 3 2 5 4
6 4
6 4 3 2 1 5
6 3 4 5 1 2
6 4
1 4 5 6 2 3
4 1 5 3 6 2
6 4
6 4 1 3 5 2
3 5 6 4 2 1
6 4
2 4 6 3 5 1
1 2 4 5 6 3
6 4
1 5 2 4 6 3
4 2 6 1 3 5
6 4
6 3 5 1 2 4
4...

output:

result:

ok 16 test cases (16 test cases)

Test #6:

score: 0

Accepted

time: 0ms

memory: 3476kb

input:

16
6 2
5 2 3 4 6 1
1 4 3 6 5 2
6 2
4 6 3 2 1 5
3 5 1 6 2 4
6 2
1 5 2 6 3 4
4 3 6 2 1 5
6 2
3 1 2 6 5 4
6 1 4 5 2 3
6 2
3 4 6 2 5 1
5 2 1 6 4 3
6 2
2 4 5 6 1 3
5 4 6 1 3 2
6 2
6 4 5 1 2 3
2 4 5 3 1 6
6 2
4 5 2 6 1 3
5 4 1 3 2 6
6 2
4 6 5 3 2 1
5 4 1 6 2 3
6 2
5 3 1 6 4 2
4 6 1 2 3 5
6 2
3 6 2 5 1 4
3...

output:

result:

ok 16 test cases (16 test cases)

Test #7:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

NO
NO
YES
4
2 1
3 2
3 3
4 4
YES
4
2 1
3 2
4 3
4 4
YES
2
2 3
2 1
NO
YES
4
2 1
2 2
3 3
4 4
YES
2
2 1
3 2
NO
NO
YES
4
3 1
3 2
3 3
4 4
YES
4
1 1
4 2
4 3
4 4
YES
3
1 2
1 2
1 2
NO
YES
4
4 1
4 2
4 3
4 4
YES
1
3 2
NO
NO
NO
YES
4
3 1
3 2
4 3
4 4
YES
4
1 1
2 2
4 3
4 4
YES
1
3 2
NO
YES
1
2 3
NO

result:

ok 25 test cases (25 test cases)

Test #8:

score: 0

Accepted

time: 0ms

memory: 3812kb

input:

output:

YES
1
1 2
NO
NO
NO
NO
YES
3
1 1
2 2
3 3
NO
YES
2
1 2
1 2
NO
NO
NO
NO
NO
YES
0
NO
YES
3
2 1
2 2
3 3
YES
2
1 2
1 2
NO
NO
YES
0
YES
0
YES
1
1 2
YES
3
3 1
2 2
3 3
YES
3
3 1
3 2
3 3
NO
YES
3
1 1
2 2
3 3
NO
YES
3
2 1
2 2
3 3
YES
3
2 1
3 2
3 3
YES
1
1 2
NO
YES
0
YES
3
3 1
2 2
3 3

result:

ok 33 test cases (33 test cases)

Test #9:

score: 0

Accepted

time: 0ms

memory: 3748kb

input:

16
6 5
3 1 2 4 6 5
1 6 3 5 2 4
6 4
1 3 6 2 4 5
4 1 3 5 6 2
6 2
1 6 5 3 2 4
2 5 6 4 3 1
6 4
3 6 2 1 5 4
5 1 3 4 6 2
6 1
5 3 1 6 2 4
1 6 5 4 3 2
6 2
4 6 2 1 5 3
4 1 5 3 2 6
6 4
3 6 2 1 4 5
2 6 3 4 5 1
6 3
6 5 4 2 1 3
3 5 4 2 6 1
6 5
6 4 2 1 3 5
6 5 2 1 3 4
6 6
5 4 1 6 3 2
2 5 4 1 3 6
6 5
5 3 6 1 2 4
3...

output:

result:

ok 16 test cases (16 test cases)

Test #10:

score: 0

Accepted

time: 0ms

memory: 3600kb

input:

16
6 1
4 5 2 6 3 1
1 5 2 4 6 3
6 1
3 5 6 4 2 1
2 5 1 4 6 3
6 1
4 2 1 6 3 5
1 3 6 4 2 5
6 1
3 6 1 2 4 5
6 2 1 3 4 5
6 1
2 3 4 1 6 5
6 3 4 5 2 1
6 1
4 6 1 3 5 2
2 5 6 4 3 1
6 1
3 2 5 4 1 6
1 6 2 3 5 4
6 1
4 6 3 5 1 2
6 3 5 2 4 1
6 1
3 6 1 2 4 5
3 4 1 6 5 2
6 1
6 5 2 1 4 3
6 2 3 1 5 4
6 1
4 1 5 2 6 3
2...

output:

result:

ok 16 test cases (16 test cases)

Test #11:

score: 0

Accepted

time: 0ms

memory: 3532kb

input:

output:

YES
3
2 3
2 1
2 3
NO
NO
NO
YES
3
2 3
2 1
3 2
YES
1
2 1
YES
0
NO
NO
YES
2
2 3
2 1
YES
3
2 3
2 1
3 2
YES
2
2 1
2 3
YES
2
2 1
3 2
NO
YES
0
YES
1
3 2
YES
2
2 1
2 3
NO
NO
NO
NO
YES
2
1 2
3 2
NO
YES
0
YES
1
2 3

result:

ok 25 test cases (25 test cases)

Test #12:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

output:

result:

ok 20 test cases (20 test cases)

Test #13:

score: 0

Accepted

time: 0ms

memory: 3540kb

input:

output:

result:

ok 20 test cases (20 test cases)

Test #14:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

output:

YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
YES
1
1 1
...

result:

ok 100 test cases (100 test cases)

Test #15:

score: 0

Accepted

time: 0ms

memory: 3540kb

input:

output:

NO
NO
NO
NO
NO
YES
3
1 2
1 2
1 2
NO
NO
YES
2
1 2
1 2
NO
NO
NO
NO
NO
YES
0
YES
0
NO
NO
NO
NO
NO
NO
YES
3
1 2
1 2
1 2
NO
NO

result:

ok 25 test cases (25 test cases)

Test #16:

score: 0

Accepted

time: 0ms

memory: 3492kb

input:

16
6 3
3 6 1 4 2 5
5 1 6 4 2 3
6 3
6 2 5 1 4 3
4 6 1 2 3 5
6 3
6 3 4 2 5 1
4 1 3 5 2 6
6 3
5 4 1 3 6 2
3 6 5 4 1 2
6 3
4 3 6 5 1 2
2 3 5 1 4 6
6 3
2 4 3 1 5 6
1 6 3 4 5 2
6 3
5 3 6 4 1 2
4 2 1 3 5 6
6 3
4 5 1 3 6 2
5 3 6 1 4 2
6 3
1 2 6 5 3 4
3 1 4 5 6 2
6 3
6 2 5 3 1 4
5 2 1 3 4 6
6 3
2 5 3 6 1 4
3...

output:

result:

ok 16 test cases (16 test cases)

Test #17:

score: 0

Accepted

time: 0ms

memory: 3828kb

input:

1
56 55
5 34 29 19 2 8 7 20 46 13 38 43 30 14 18 41 37 12 25 1 27 17 31 52 49 54 39 22 56 9 16 36 11 15 6 26 51 48 55 3 24 47 28 45 40 32 21 10 53 44 33 35 4 50 23 42
39 22 56 9 16 36 11 15 6 26 51 48 55 3 24 47 28 45 40 32 21 10 53 44 33 35 4 50 23 42 5 34 29 19 2 8 7 20 46 13 38 43 30 14 18 41 37 ...

output:

result:

ok 1 test cases (1 test case)

Test #18:

score: 0

Accepted

time: 5ms

memory: 3760kb

input:

1
100 97
97 23 19 13 87 95 35 46 98 6 1 100 66 39 48 86 51 89 67 49 76 22 21 62 61 84 29 9 41 69 16 68 30 65 7 36 4 52 25 24 47 55 80 64 5 58 28 82 53 20 57 26 88 94 43 44 99 45 85 42 2 72 70 15 60 50 27 59 56 32 17 91 92 33 18 77 74 54 14 93 63 73 78 40 90 3 71 81 8 10 79 75 83 11 38 96 12 31 34 37...

output:

result:

ok 1 test cases (1 test case)

Test #19:

score: 0

Accepted

time: 1ms

memory: 3952kb

input:

1
100 15
69 86 59 9 67 89 24 97 14 18 16 11 19 46 23 40 4 55 53 61 30 95 78 29 15 74 32 41 51 13 77 47 66 100 57 45 42 21 62 43 26 1 99 75 71 54 73 36 39 48 88 98 80 64 58 10 60 76 17 70 25 37 38 6 72 91 7 20 68 2 35 44 90 79 50 93 81 94 27 33 5 52 28 82 56 87 31 22 83 34 96 85 49 12 3 65 63 8 84 92...

output:

result:

ok 1 test cases (1 test case)

Test #20:

score: 0

Accepted

time: 0ms

memory: 3764kb

input:

2
50 2
45 9 21 13 3 19 11 23 16 24 29 48 17 14 20 50 27 49 22 28 34 25 5 40 36 10 46 39 44 35 47 7 4 12 30 2 41 33 15 38 26 8 6 37 42 32 1 18 43 31
26 14 24 40 45 22 49 4 3 36 15 41 17 2 12 19 25 42 20 23 33 43 46 8 16 32 29 34 47 39 28 7 5 6 21 38 37 31 35 27 9 44 50 30 48 11 1 13 10 18
50 2
16 18 ...

output:

result:

ok 2 test cases (2 test cases)

Test #21:

score: 0

Accepted

time: 0ms

memory: 3748kb

input:

1
99 1
57 6 64 75 89 37 92 80 81 50 45 91 98 41 62 77 60 52 99 44 23 95 28 11 21 86 29 56 55 34 73 47 3 8 68 17 58 16 46 9 35 85 82 87 7 83 10 94 39 61 27 66 59 38 15 72 26 76 42 40 1 12 24 20 13 48 49 19 33 54 63 93 67 25 97 96 69 18 30 32 65 78 84 74 43 70 71 22 4 14 51 31 5 53 79 36 90 2 88
16 65...

output:

result:

ok 1 test cases (1 test case)

Test #22:

score: 0

Accepted

time: 2ms

memory: 3748kb

input:

1
88 81
31 85 58 57 60 73 22 32 3 2 49 56 46 76 16 69 52 78 87 15 20 12 81 24 79 43 35 86 44 11 9 84 53 66 26 75 63 14 13 17 7 64 88 47 48 27 55 50 8 62 45 71 23 33 65 70 72 19 39 5 54 29 77 37 51 18 74 61 40 42 59 83 67 80 25 28 1 21 68 4 41 38 82 10 34 36 30 6
47 71 6 25 46 68 2 10 8 87 7 28 60 64...

output:

result:

ok 1 test cases (1 test case)

Test #23:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

2
40 34
10 22 38 4 15 2 28 6 21 30 34 5 14 35 32 33 37 25 1 7 17 27 9 36 8 13 40 16 31 12 29 18 39 26 20 24 3 11 19 23
7 29 11 4 27 21 36 19 3 6 33 32 16 13 37 9 34 10 40 30 17 2 14 35 31 28 23 39 8 20 5 26 25 15 12 22 1 38 18 24
7 1
4 7 1 2 6 5 3
7 4 1 5 3 6 2

output:

result:

ok 2 test cases (2 test cases)

Test #24:

score: 0

Accepted

time: 0ms

memory: 3536kb

input:

1
98 54
27 60 65 33 61 41 92 44 66 40 6 70 91 32 5 78 47 46 30 86 11 85 3 96 38 79 34 28 83 48 90 71 93 18 9 53 49 55 4 51 29 75 15 13 80 72 36 52 37 62 84 63 19 10 31 7 17 73 81 58 87 95 23 54 64 88 68 43 21 39 20 25 14 8 50 89 26 82 24 42 12 16 77 74 98 57 76 69 1 97 35 22 45 67 94 56 2 59
59 65 6...

output:

NO

result:

ok 1 test cases (1 test case)

Test #25:

score: 0

Accepted

time: 1ms

memory: 3660kb

input:

6
58 26
47 15 19 2 50 17 43 35 22 8 1 49 11 36 26 32 5 6 7 37 38 10 18 58 27 39 20 14 33 53 29 4 25 42 34 48 44 46 30 40 55 21 41 56 9 45 13 23 28 51 52 57 24 12 31 54 16 3
12 2 24 41 15 14 35 54 17 46 26 31 19 16 38 48 8 49 58 56 23 39 13 27 51 10 37 50 55 25 20 43 57 6 30 9 5 22 3 40 21 36 1 18 52...

output:

result:

ok 6 test cases (6 test cases)

Test #26:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

1
39 38
3 37 35 34 31 13 5 24 7 36 10 14 16 20 8 38 11 26 33 23 15 2 39 27 1 6 17 22 30 9 18 29 25 4 21 12 28 32 19
32 10 3 15 36 22 12 18 5 14 34 21 2 28 33 8 26 38 17 29 20 13 35 16 6 24 23 27 19 31 7 1 11 37 25 4 39 9 30

output:

NO

result:

ok 1 test cases (1 test case)

Test #27:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

1
100 99
98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 93 17 29 64 95 79 21 55 75 19 85 54 51 89 78 15 87 43 59 36 1 90 35 65 56 62 28 86 5 82 49 3 99 33 9 92 32 74 69 27 22 77 16 44 94 34 6 57 70 23 12 61 25 8 11 67 47 83 88 10 14 30 7 97 60 42 37 24 38 53 50 4 80 72 39...

output:

result:

ok 1 test cases (1 test case)

Test #28:

score: 0

Accepted

time: 0ms

memory: 3836kb

input:

5
16 10
9 7 6 12 10 11 13 4 1 15 5 3 14 8 2 16
14 7 3 11 2 16 9 10 4 6 13 15 5 1 12 8
15 3
5 15 12 11 7 13 8 4 10 2 14 6 3 1 9
11 1 6 8 7 15 5 9 4 2 10 12 13 3 14
3 1
3 1 2
3 1 2
1 1
1
1
4 2
3 4 2 1
4 1 3 2

output:

result:

ok 5 test cases (5 test cases)

Test #29:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

2
50 1
4 42 15 50 26 41 35 16 10 49 28 14 23 48 43 45 29 31 36 17 32 5 30 25 2 24 21 20 12 39 11 13 1 27 47 7 46 33 3 44 19 38 34 18 37 6 8 9 40 22
18 16 25 2 21 46 37 28 47 1 49 12 5 11 24 40 34 43 14 3 31 39 42 50 4 38 22 8 35 7 45 44 9 29 48 32 30 20 26 15 27 41 6 17 13 33 36 19 10 23
50 1
7 5 12...

output:

result:

ok 2 test cases (2 test cases)

Test #30:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

1
100 1
78 52 95 76 96 49 53 59 77 100 64 11 9 48 15 17 44 46 21 54 39 68 43 4 32 28 73 6 16 62 72 84 65 86 98 75 33 45 25 3 91 82 2 92 63 88 7 50 97 93 14 22 20 42 60 55 80 85 29 34 56 71 83 38 26 47 90 70 51 41 40 31 37 12 35 99 67 94 1 87 57 8 61 19 23 79 36 18 66 74 5 27 81 69 24 58 13 10 89 30
...

output:

result:

ok 1 test cases (1 test case)

Test #31:

score: 0

Accepted

time: 0ms

memory: 3780kb

input:

1
100 2
62 70 29 14 12 87 94 78 39 92 84 91 61 49 60 33 69 37 19 82 42 8 45 97 81 43 54 67 1 22 77 58 65 17 18 28 25 57 16 90 40 13 4 21 68 35 15 76 73 93 56 95 79 47 74 75 30 71 66 99 41 24 88 83 5 6 31 96 38 80 27 46 51 53 2 86 32 9 20 100 26 36 63 7 52 55 23 3 50 59 48 89 85 44 34 64 10 72 11 98
...

output:

result:

ok 1 test cases (1 test case)

Test #32:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

4
13 1
3 12 9 13 1 10 5 4 11 8 2 6 7
11 7 13 8 12 1 2 10 6 5 4 3 9
49 35
16 12 48 23 20 17 9 28 5 22 35 27 46 2 43 42 25 3 34 47 30 44 37 11 45 31 33 19 29 49 15 39 6 26 36 14 32 10 21 4 24 13 7 18 41 38 8 1 40
30 29 13 4 27 26 42 16 18 21 47 34 15 35 14 20 31 32 2 23 43 33 28 40 36 37 25 3 11 1 39 ...

output:

result:

ok 4 test cases (4 test cases)

Test #33:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

1
99 96
26 1 83 49 63 90 67 66 14 9 82 50 61 19 21 39 98 18 85 69 58 28 13 80 52 20 99 44 91 30 34 6 42 22 23 92 31 41 55 62 48 5 93 46 95 51 59 64 60 3 7 16 2 47 37 40 35 25 78 75 38 27 72 45 24 57 73 68 17 70 53 36 12 81 97 15 65 43 77 96 88 94 86 56 76 33 54 29 74 4 32 71 79 11 8 87 89 10 84
72 6...

output:

NO

result:

ok 1 test cases (1 test case)

Test #34:

score: 0

Accepted

time: 0ms

memory: 3732kb

input:

2
50 47
46 4 23 12 37 41 8 3 20 2 17 19 42 26 47 50 18 30 22 14 7 33 24 27 10 48 43 25 28 32 9 31 1 45 39 35 11 5 13 38 44 16 34 15 40 49 29 36 21 6
6 44 41 48 38 9 15 23 45 8 14 25 32 46 10 31 49 18 20 26 37 16 30 19 3 34 35 40 2 11 29 24 27 28 36 22 47 4 21 13 17 42 12 43 1 5 33 50 7 39
50 47
23 3...

output:

result:

ok 2 test cases (2 test cases)

Test #35:

score: 0

Accepted

time: 7ms

memory: 4200kb

input:

1
99 97
49 85 97 27 67 24 33 51 77 84 22 3 59 75 28 10 82 90 52 16 89 32 56 6 62 4 60 1 95 68 50 21 81 91 43 92 64 46 99 35 57 79 18 7 93 80 14 20 69 55 63 11 17 45 30 74 76 94 72 19 5 44 36 8 29 31 40 73 23 2 98 48 42 66 25 39 83 78 13 65 38 12 88 37 26 96 70 9 58 61 47 71 53 54 15 87 86 34 41
49 9...

output:

result:

ok 1 test cases (1 test case)

Test #36:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

4
22 11
8 17 19 13 18 10 4 15 2 16 11 12 3 7 21 9 22 6 5 20 14 1
21 4 14 12 5 18 9 15 8 22 20 17 10 3 1 7 2 6 19 13 16 11
22 1
9 3 15 19 10 4 8 1 6 21 18 20 13 22 14 5 12 16 2 11 17 7
12 6 14 10 3 21 18 16 9 1 22 2 5 7 15 4 11 17 8 13 20 19
22 21
8 9 11 4 15 3 14 16 20 7 10 19 6 12 5 18 21 22 13 17 ...

output:

result:

ok 4 test cases (4 test cases)

Test #37:

score: 0

Accepted

time: 0ms

memory: 3500kb

input:

1
77 76
40 20 73 12 26 10 27 1 14 31 7 70 5 74 19 71 15 6 62 16 44 64 25 42 38 33 8 54 53 21 59 37 36 46 11 45 3 49 43 77 28 9 41 23 50 30 55 35 61 66 67 63 69 51 24 4 13 22 34 75 68 60 57 17 29 47 65 76 58 52 72 2 48 32 39 18 56
10 27 1 14 31 7 70 5 74 19 71 15 6 62 16 44 64 25 42 38 33 8 54 53 21 ...

output:

result:

ok 1 test cases (1 test case)

Test #38:

score: 0

Accepted

time: 1ms

memory: 3848kb

input:

1
99 2
3 43 99 28 33 10 41 20 51 76 19 65 58 32 13 48 24 70 97 91 29 59 75 14 2 35 12 89 46 44 1 69 74 85 15 60 88 64 30 71 77 79 96 63 9 57 83 62 38 56 26 27 22 80 40 5 39 98 68 53 16 84 11 87 92 45 55 86 73 61 95 94 93 54 72 8 66 78 37 25 36 42 7 23 31 90 52 21 47 50 17 81 67 4 49 18 82 6 34
31 78...

output:

result:

ok 1 test cases (1 test case)

Test #39:

score: 0

Accepted

time: 2ms

memory: 3692kb

input:

2
50 48
38 35 1 32 3 5 10 40 6 29 49 42 17 25 7 36 9 37 45 16 24 43 13 48 22 31 20 50 21 44 27 2 34 15 30 4 46 18 41 28 26 19 39 11 14 8 33 23 47 12
25 27 33 30 35 43 31 2 47 34 39 3 49 48 40 38 24 14 50 1 12 13 4 26 15 21 45 9 37 32 23 44 41 5 7 42 46 11 19 17 20 36 10 18 29 28 8 16 22 6
50 48
14 4...

output:

result:

ok 2 test cases (2 test cases)

Test #40:

score: 0

Accepted

time: 0ms

memory: 3548kb

input:

3
16 13
7 1 9 15 6 5 12 4 13 10 3 2 14 16 8 11
10 11 2 12 16 7 4 5 1 15 9 14 6 3 13 8
1 1
1
1
2 1
1 2
1 2

output:

result:

ok 3 test cases (3 test cases)

Test #41:

score: 0

Accepted

time: 0ms

memory: 3600kb

input:

2
34 33
10 26 23 16 21 4 17 34 31 22 29 28 11 15 14 20 25 27 3 33 12 30 8 1 13 5 18 19 2 32 6 24 9 7
10 26 23 16 21 4 17 34 31 22 29 28 11 15 14 20 25 27 3 33 12 30 8 1 13 5 18 19 2 32 6 24 9 7
34 33
24 12 25 30 3 16 19 1 23 15 14 21 26 34 13 6 17 27 8 2 10 9 28 31 20 22 4 18 32 7 29 33 5 11
28 31 2...

output:

result:

ok 2 test cases (2 test cases)

Test #42:

score: 0

Accepted

time: 0ms

memory: 3556kb

input:

5
20 19
1 6 15 9 18 17 7 8 3 19 2 13 11 12 14 4 5 20 16 10
16 10 1 6 15 9 18 17 7 8 3 19 2 13 11 12 14 4 5 20
20 19
13 19 18 2 10 7 3 8 15 20 12 17 9 14 16 11 1 6 5 4
4 13 19 18 2 10 7 3 8 15 20 12 17 9 14 16 11 1 6 5
20 19
8 5 3 9 2 18 19 1 15 16 10 17 12 7 11 13 20 14 4 6
18 19 1 15 16 10 17 12 7 ...

output:

result:

ok 5 test cases (5 test cases)

Test #43:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

1
100 98
78 66 37 31 84 90 17 80 40 14 1 38 79 64 26 34 87 75 3 41 67 77 58 6 50 82 8 81 27 9 13 22 16 52 42 65 53 46 92 44 99 18 11 33 55 45 23 21 76 85 48 56 98 61 95 70 62 86 39 43 57 15 47 96 32 60 10 24 5 73 88 30 97 4 35 12 29 94 83 91 93 100 51 2 54 19 20 71 28 69 74 7 72 59 68 25 49 63 89 36...

output:

NO

result:

ok 1 test cases (1 test case)