oj.uz

답안 #115305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115305 2019-06-06T17:02:19 Z gs14004 Lock Puzzle (innopolis2018_final_A) C++17
100 / 100
 17 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 2005;

int n, p[MAXN];
vector<int> ans;

void Haja(int x){
	x = n - x;
	rotate(p, p + n - x, p + n);
	reverse(p, p + x);
	ans.push_back(x);
}

void printseq(){
	for(int i=0; i<n; i++) printf("%d ", p[i]);
	puts("");
}

void solve(){
	int csorted = (n / 2) * 2;
	bool rev = 0;
	while(csorted >= 2){
		int x, y;
		if(csorted == n){
			x = 0, y = 1;
		}
		else{
			x = p[csorted];
			y = p[n - 1];
			if(!rev) x--, y++;
			else x++, y--;
		}
		x = (x + n) % n;
		y = (y + n) % n;
		int px = find(p, p + n, x) - p;
		Haja(px + 1);
		Haja(0);
		Haja(csorted);
		int py = find(p, p + n, y) - p;
		Haja(py);
		int pxx = find(p, p + n, x) - p;
		Haja(pxx + 1);
		rev ^= 1;
		csorted -= 2;
	}
	if(n > 1){
		int pos = find(p, p + n, 0) - p;
		if(p[(pos + 1) % n] == n - 1){
			Haja(0);
		}
		pos = find(p, p + n, 0) - p;
		Haja(pos);
		Haja(n - pos);
		Haja(0);
	}
}

int main(){
	string s, t;
	int m;
	cin >> n >> m >> s >> t;
	vector<int> r1(n), r2(n);
	iota(r1.begin(), r1.end(), 0);
	iota(r2.begin(), r2.end(), 0);
	sort(r1.begin(), r1.end(), [&](int x, int y){
		return s[x] < s[y];
	});
	sort(r2.begin(), r2.end(), [&](int x, int y){
		return t[x] < t[y];
	});
	for(int i=0; i<n; i++){
		if(s[r1[i]] != t[r2[i]]){
			puts("-1");
			return 0;
		}
		p[r1[i]] = r2[i];
	}
	solve();
	cout << ans.size() << endl;
	for(auto &i : ans) printf("%d ", i);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [n = 1, m = 10000], OK, 0 operations
2 Correct 2 ms 384 KB [n = 2, m = 10000], OK, 9 operations
3 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
4 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
5 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
6 Correct 2 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
8 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
9 Correct 2 ms 256 KB [n = 49, m = 10000], OK, 123 operations
10 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
11 Correct 2 ms 256 KB [n = 100, m = 10000], OK, 253 operations
12 Correct 2 ms 384 KB [n = 99, m = 10000], OK, 249 operations
13 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
14 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
15 Correct 2 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
17 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
18 Correct 5 ms 356 KB [n = 1000, m = 10000], OK, 2503 operations
19 Correct 5 ms 384 KB [n = 999, m = 10000], OK, 2499 operations
20 Correct 5 ms 384 KB [n = 998, m = 10000], OK, 2499 operations
21 Correct 5 ms 384 KB [n = 997, m = 10000], OK, 2493 operations
22 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
24 Correct 2 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [n = 1, m = 10000], OK, 0 operations
2 Correct 2 ms 384 KB [n = 2, m = 10000], OK, 9 operations
3 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
4 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
5 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
6 Correct 2 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
8 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
9 Correct 2 ms 256 KB [n = 49, m = 10000], OK, 123 operations
10 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
11 Correct 2 ms 256 KB [n = 100, m = 10000], OK, 253 operations
12 Correct 2 ms 384 KB [n = 99, m = 10000], OK, 249 operations
13 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
14 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
15 Correct 2 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
17 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
18 Correct 5 ms 356 KB [n = 1000, m = 10000], OK, 2503 operations
19 Correct 5 ms 384 KB [n = 999, m = 10000], OK, 2499 operations
20 Correct 5 ms 384 KB [n = 998, m = 10000], OK, 2499 operations
21 Correct 5 ms 384 KB [n = 997, m = 10000], OK, 2493 operations
22 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
24 Correct 2 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
27 Correct 12 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
28 Correct 13 ms 384 KB [n = 1999, m = 10000], OK, 4999 operations
29 Correct 13 ms 384 KB [n = 1998, m = 10000], OK, 4999 operations
30 Correct 13 ms 384 KB [n = 1997, m = 10000], OK, 4993 operations
31 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
32 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
33 Correct 2 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
35 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [n = 1, m = 10000], OK, 0 operations
2 Correct 2 ms 384 KB [n = 2, m = 10000], OK, 9 operations
3 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
4 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
5 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
6 Correct 2 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
8 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
9 Correct 2 ms 256 KB [n = 49, m = 10000], OK, 123 operations
10 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
11 Correct 2 ms 256 KB [n = 100, m = 10000], OK, 253 operations
12 Correct 2 ms 384 KB [n = 99, m = 10000], OK, 249 operations
13 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
14 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
15 Correct 2 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
17 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
18 Correct 5 ms 356 KB [n = 1000, m = 10000], OK, 2503 operations
19 Correct 5 ms 384 KB [n = 999, m = 10000], OK, 2499 operations
20 Correct 5 ms 384 KB [n = 998, m = 10000], OK, 2499 operations
21 Correct 5 ms 384 KB [n = 997, m = 10000], OK, 2493 operations
22 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
24 Correct 2 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
27 Correct 12 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
28 Correct 13 ms 384 KB [n = 1999, m = 10000], OK, 4999 operations
29 Correct 13 ms 384 KB [n = 1998, m = 10000], OK, 4999 operations
30 Correct 13 ms 384 KB [n = 1997, m = 10000], OK, 4993 operations
31 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
32 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
33 Correct 2 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
35 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
36 Correct 12 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
37 Correct 12 ms 484 KB [n = 1999, m = 8100], OK, 4999 operations
38 Correct 13 ms 384 KB [n = 1998, m = 8100], OK, 4999 operations
39 Correct 12 ms 512 KB [n = 1997, m = 8100], OK, 4993 operations
40 Correct 14 ms 384 KB [n = 1996, m = 8100], OK, 4993 operations
41 Correct 13 ms 512 KB [n = 2000, m = 8100], OK, 5003 operations
42 Correct 17 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
43 Correct 2 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 13 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
45 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [n = 1, m = 10000], OK, 0 operations
2 Correct 2 ms 384 KB [n = 2, m = 10000], OK, 9 operations
3 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
4 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
5 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
6 Correct 2 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
8 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
9 Correct 2 ms 256 KB [n = 49, m = 10000], OK, 123 operations
10 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
11 Correct 2 ms 256 KB [n = 100, m = 10000], OK, 253 operations
12 Correct 2 ms 384 KB [n = 99, m = 10000], OK, 249 operations
13 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
14 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
15 Correct 2 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
17 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
18 Correct 5 ms 356 KB [n = 1000, m = 10000], OK, 2503 operations
19 Correct 5 ms 384 KB [n = 999, m = 10000], OK, 2499 operations
20 Correct 5 ms 384 KB [n = 998, m = 10000], OK, 2499 operations
21 Correct 5 ms 384 KB [n = 997, m = 10000], OK, 2493 operations
22 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
24 Correct 2 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
27 Correct 12 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
28 Correct 13 ms 384 KB [n = 1999, m = 10000], OK, 4999 operations
29 Correct 13 ms 384 KB [n = 1998, m = 10000], OK, 4999 operations
30 Correct 13 ms 384 KB [n = 1997, m = 10000], OK, 4993 operations
31 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
32 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
33 Correct 2 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
35 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
36 Correct 12 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
37 Correct 12 ms 484 KB [n = 1999, m = 8100], OK, 4999 operations
38 Correct 13 ms 384 KB [n = 1998, m = 8100], OK, 4999 operations
39 Correct 12 ms 512 KB [n = 1997, m = 8100], OK, 4993 operations
40 Correct 14 ms 384 KB [n = 1996, m = 8100], OK, 4993 operations
41 Correct 13 ms 512 KB [n = 2000, m = 8100], OK, 5003 operations
42 Correct 17 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
43 Correct 2 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 13 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
45 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
46 Correct 13 ms 512 KB [n = 2000, m = 6100], OK, 5003 operations
47 Correct 13 ms 384 KB [n = 1999, m = 6100], OK, 4999 operations
48 Correct 13 ms 428 KB [n = 1998, m = 6100], OK, 4999 operations
49 Correct 13 ms 384 KB [n = 1997, m = 6100], OK, 4993 operations
50 Correct 13 ms 512 KB [n = 1996, m = 6100], OK, 4993 operations
51 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
52 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
53 Correct 2 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
55 Correct 9 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB [n = 1, m = 10000], OK, 0 operations
2 Correct 2 ms 384 KB [n = 2, m = 10000], OK, 9 operations
3 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
4 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
5 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
6 Correct 2 ms 384 KB [n = 8, m = 10000], OK: No solution
7 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
8 Correct 2 ms 384 KB [n = 8, m = 10000], OK, 23 operations
9 Correct 2 ms 256 KB [n = 49, m = 10000], OK, 123 operations
10 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
11 Correct 2 ms 256 KB [n = 100, m = 10000], OK, 253 operations
12 Correct 2 ms 384 KB [n = 99, m = 10000], OK, 249 operations
13 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
14 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
15 Correct 2 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 2 ms 256 KB [n = 50, m = 10000], OK, 129 operations
17 Correct 2 ms 384 KB [n = 50, m = 10000], OK, 129 operations
18 Correct 5 ms 356 KB [n = 1000, m = 10000], OK, 2503 operations
19 Correct 5 ms 384 KB [n = 999, m = 10000], OK, 2499 operations
20 Correct 5 ms 384 KB [n = 998, m = 10000], OK, 2499 operations
21 Correct 5 ms 384 KB [n = 997, m = 10000], OK, 2493 operations
22 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
23 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
24 Correct 2 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 5 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
26 Correct 4 ms 384 KB [n = 1000, m = 10000], OK, 2503 operations
27 Correct 12 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
28 Correct 13 ms 384 KB [n = 1999, m = 10000], OK, 4999 operations
29 Correct 13 ms 384 KB [n = 1998, m = 10000], OK, 4999 operations
30 Correct 13 ms 384 KB [n = 1997, m = 10000], OK, 4993 operations
31 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
32 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
33 Correct 2 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 13 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
35 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 5003 operations
36 Correct 12 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
37 Correct 12 ms 484 KB [n = 1999, m = 8100], OK, 4999 operations
38 Correct 13 ms 384 KB [n = 1998, m = 8100], OK, 4999 operations
39 Correct 12 ms 512 KB [n = 1997, m = 8100], OK, 4993 operations
40 Correct 14 ms 384 KB [n = 1996, m = 8100], OK, 4993 operations
41 Correct 13 ms 512 KB [n = 2000, m = 8100], OK, 5003 operations
42 Correct 17 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
43 Correct 2 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 13 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
45 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 5003 operations
46 Correct 13 ms 512 KB [n = 2000, m = 6100], OK, 5003 operations
47 Correct 13 ms 384 KB [n = 1999, m = 6100], OK, 4999 operations
48 Correct 13 ms 428 KB [n = 1998, m = 6100], OK, 4999 operations
49 Correct 13 ms 384 KB [n = 1997, m = 6100], OK, 4993 operations
50 Correct 13 ms 512 KB [n = 1996, m = 6100], OK, 4993 operations
51 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
52 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
53 Correct 2 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 12 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
55 Correct 9 ms 384 KB [n = 2000, m = 6100], OK, 5003 operations
56 Correct 13 ms 384 KB [n = 2000, m = 5100], OK, 5003 operations
57 Correct 13 ms 384 KB [n = 1999, m = 5100], OK, 4999 operations
58 Correct 13 ms 384 KB [n = 1998, m = 5100], OK, 4999 operations
59 Correct 13 ms 384 KB [n = 1997, m = 5100], OK, 4993 operations
60 Correct 14 ms 512 KB [n = 1996, m = 5100], OK, 4993 operations
61 Correct 13 ms 384 KB [n = 1995, m = 5100], OK, 4989 operations
62 Correct 13 ms 512 KB [n = 1994, m = 5100], OK, 4989 operations
63 Correct 10 ms 384 KB [n = 2000, m = 5100], OK, 5003 operations
64 Correct 13 ms 384 KB [n = 2000, m = 5100], OK, 5003 operations
65 Correct 13 ms 384 KB [n = 2000, m = 5100], OK, 5003 operations
66 Correct 2 ms 384 KB [n = 2000, m = 5100], OK: No solution
67 Correct 13 ms 512 KB [n = 2000, m = 5100], OK, 5003 operations