oj.uz

답안 #282863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282863 2020-08-25T05:29:13 Z 임성재(#5752) Lock Puzzle (innopolis2018_final_A) C++17
100 / 100
 17 ms 512 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define pre(a) cout << fixed; cout.precision(a);

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n, m;
string s, t;
vector<int> ans;
vector<char> v;

void shift(int x) {
	ans.eb(x);

	reverse(s.begin(), s.begin() + n - x);
	reverse(s.begin(), s.end());
}

void f(int x, int y) {
	shift(n - x - 1);
	shift(n);

	shift(n - y - 1);
	shift(n);
}

int main() {
	fast;

	cin >> n >> m;
	cin >> s >> t;

	for(int i=0; i<n; i++) {
		reverse(all(t));
		
		v.eb(t.back());
		t.pop_back();
	}

	reverse(all(v));

	for(int i=0; i<n; i++) {
		bool flag = false;

		if(n - i & 1) { // 마지막
			for(int j = n-1; j>=i; j--) {
				if(v[i] == s[j]) {
					shift(n - j);
					shift(j - i);
					flag = true;

					break;
				}
			}
		}
		else {
			for(int j=0; j < n - i; j++) {
			 	if(v[i] == s[j]) {
			 		shift(n - j - 1);
			 		shift(n - i);
			 		shift(i);
			 		flag = true;

			 		break;
			 	}
			}
		}

		if(!flag) {
			cout << -1;
			return 0;
		}
	}

	cout << ans.size() << "\n";
	for(auto i : ans) {
		cout << i << " ";
	}
}

Compilation message

A.cpp: In function 'int main()':
A.cpp:58:8: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   58 |   if(n - i & 1) { // 마지막
      |      ~~^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
18 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
19 Correct 4 ms 384 KB [n = 999, m = 10000], OK, 2497 operations
20 Correct 4 ms 384 KB [n = 998, m = 10000], OK, 2495 operations
21 Correct 4 ms 384 KB [n = 997, m = 10000], OK, 2492 operations
22 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
24 Correct 4 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
18 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
19 Correct 4 ms 384 KB [n = 999, m = 10000], OK, 2497 operations
20 Correct 4 ms 384 KB [n = 998, m = 10000], OK, 2495 operations
21 Correct 4 ms 384 KB [n = 997, m = 10000], OK, 2492 operations
22 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
24 Correct 4 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
27 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
28 Correct 15 ms 384 KB [n = 1999, m = 10000], OK, 4997 operations
29 Correct 15 ms 384 KB [n = 1998, m = 10000], OK, 4995 operations
30 Correct 15 ms 384 KB [n = 1997, m = 10000], OK, 4992 operations
31 Correct 16 ms 512 KB [n = 2000, m = 10000], OK, 5000 operations
32 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
33 Correct 14 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
35 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
18 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
19 Correct 4 ms 384 KB [n = 999, m = 10000], OK, 2497 operations
20 Correct 4 ms 384 KB [n = 998, m = 10000], OK, 2495 operations
21 Correct 4 ms 384 KB [n = 997, m = 10000], OK, 2492 operations
22 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
24 Correct 4 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
27 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
28 Correct 15 ms 384 KB [n = 1999, m = 10000], OK, 4997 operations
29 Correct 15 ms 384 KB [n = 1998, m = 10000], OK, 4995 operations
30 Correct 15 ms 384 KB [n = 1997, m = 10000], OK, 4992 operations
31 Correct 16 ms 512 KB [n = 2000, m = 10000], OK, 5000 operations
32 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
33 Correct 14 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
35 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
36 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
37 Correct 15 ms 384 KB [n = 1999, m = 8100], OK, 4997 operations
38 Correct 16 ms 512 KB [n = 1998, m = 8100], OK, 4995 operations
39 Correct 15 ms 384 KB [n = 1997, m = 8100], OK, 4992 operations
40 Correct 15 ms 512 KB [n = 1996, m = 8100], OK, 4990 operations
41 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
42 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
43 Correct 14 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
45 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
18 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
19 Correct 4 ms 384 KB [n = 999, m = 10000], OK, 2497 operations
20 Correct 4 ms 384 KB [n = 998, m = 10000], OK, 2495 operations
21 Correct 4 ms 384 KB [n = 997, m = 10000], OK, 2492 operations
22 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
24 Correct 4 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
27 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
28 Correct 15 ms 384 KB [n = 1999, m = 10000], OK, 4997 operations
29 Correct 15 ms 384 KB [n = 1998, m = 10000], OK, 4995 operations
30 Correct 15 ms 384 KB [n = 1997, m = 10000], OK, 4992 operations
31 Correct 16 ms 512 KB [n = 2000, m = 10000], OK, 5000 operations
32 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
33 Correct 14 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
35 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
36 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
37 Correct 15 ms 384 KB [n = 1999, m = 8100], OK, 4997 operations
38 Correct 16 ms 512 KB [n = 1998, m = 8100], OK, 4995 operations
39 Correct 15 ms 384 KB [n = 1997, m = 8100], OK, 4992 operations
40 Correct 15 ms 512 KB [n = 1996, m = 8100], OK, 4990 operations
41 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
42 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
43 Correct 14 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
45 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
46 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
47 Correct 15 ms 384 KB [n = 1999, m = 6100], OK, 4997 operations
48 Correct 15 ms 384 KB [n = 1998, m = 6100], OK, 4995 operations
49 Correct 15 ms 384 KB [n = 1997, m = 6100], OK, 4992 operations
50 Correct 15 ms 384 KB [n = 1996, m = 6100], OK, 4990 operations
51 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
52 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
53 Correct 14 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 15 ms 512 KB [n = 2000, m = 6100], OK, 5000 operations
55 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 384 KB [n = 2, m = 10000], OK, 5 operations
3 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
5 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
6 Correct 0 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 20 operations
8 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 20 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 122 operations
10 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 250 operations
12 Correct 0 ms 384 KB [n = 99, m = 10000], OK, 247 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
14 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 125 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
17 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 125 operations
18 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
19 Correct 4 ms 384 KB [n = 999, m = 10000], OK, 2497 operations
20 Correct 4 ms 384 KB [n = 998, m = 10000], OK, 2495 operations
21 Correct 4 ms 384 KB [n = 997, m = 10000], OK, 2492 operations
22 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
24 Correct 4 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2500 operations
27 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
28 Correct 15 ms 384 KB [n = 1999, m = 10000], OK, 4997 operations
29 Correct 15 ms 384 KB [n = 1998, m = 10000], OK, 4995 operations
30 Correct 15 ms 384 KB [n = 1997, m = 10000], OK, 4992 operations
31 Correct 16 ms 512 KB [n = 2000, m = 10000], OK, 5000 operations
32 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
33 Correct 14 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
35 Correct 15 ms 384 KB [n = 2000, m = 10000], OK, 5000 operations
36 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
37 Correct 15 ms 384 KB [n = 1999, m = 8100], OK, 4997 operations
38 Correct 16 ms 512 KB [n = 1998, m = 8100], OK, 4995 operations
39 Correct 15 ms 384 KB [n = 1997, m = 8100], OK, 4992 operations
40 Correct 15 ms 512 KB [n = 1996, m = 8100], OK, 4990 operations
41 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
42 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
43 Correct 14 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
45 Correct 15 ms 384 KB [n = 2000, m = 8100], OK, 5000 operations
46 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
47 Correct 15 ms 384 KB [n = 1999, m = 6100], OK, 4997 operations
48 Correct 15 ms 384 KB [n = 1998, m = 6100], OK, 4995 operations
49 Correct 15 ms 384 KB [n = 1997, m = 6100], OK, 4992 operations
50 Correct 15 ms 384 KB [n = 1996, m = 6100], OK, 4990 operations
51 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
52 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
53 Correct 14 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 15 ms 512 KB [n = 2000, m = 6100], OK, 5000 operations
55 Correct 15 ms 384 KB [n = 2000, m = 6100], OK, 5000 operations
56 Correct 15 ms 384 KB [n = 2000, m = 5100], OK, 5000 operations
57 Correct 15 ms 384 KB [n = 1999, m = 5100], OK, 4997 operations
58 Correct 17 ms 512 KB [n = 1998, m = 5100], OK, 4995 operations
59 Correct 15 ms 432 KB [n = 1997, m = 5100], OK, 4992 operations
60 Correct 15 ms 384 KB [n = 1996, m = 5100], OK, 4990 operations
61 Correct 15 ms 384 KB [n = 1995, m = 5100], OK, 4987 operations
62 Correct 15 ms 384 KB [n = 1994, m = 5100], OK, 4985 operations
63 Correct 15 ms 384 KB [n = 2000, m = 5100], OK, 5000 operations
64 Correct 15 ms 384 KB [n = 2000, m = 5100], OK, 5000 operations
65 Correct 15 ms 384 KB [n = 2000, m = 5100], OK, 5000 operations
66 Correct 14 ms 384 KB [n = 2000, m = 5100], OK: No solution
67 Correct 15 ms 384 KB [n = 2000, m = 5100], OK, 5000 operations