oj.uz

답안 #282962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282962 2020-08-25T07:53:23 Z 송준혁(#5748) Lock Puzzle (innopolis2018_final_A) C++17
100 / 100
 13 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

int N;
char S[2020], T[2020], B[2020];
vector<int> V;

void sft(int x){
	V.push_back(x);
	for (int i=1; i<=x; i++) B[N-x+i] = S[i];
	for (int i=1; i<=N-x; i++) B[i] = S[N-i+1];
	for (int i=1; i<=N; i++) S[i] = B[i];
}

int main(){
	scanf("%d %*d", &N);
	scanf("%s", S+1);
	scanf("%s", T+1);
	int s=(N+1)/2, e=s;
	for (int i=1; i<=N; i++){
		if (T[s] == S[i]){
			sft(i), sft(0);
			break;
		}
	}
	for (int i=1; i<N; i++){
		int t;
		if (i%4 == 1 || i%4 == 0) t=s-1, s--;
		else t=e+1, e++;
		if (i&1){
			for (int j=i+1; j<=N; j++) if (T[t] == S[j]){ 
				sft(j-1), sft(N+i-j+1);
				break;
			}
		}
		else{
			for (int j=1; j<=N-i; j++) if (T[t] == S[j]){
				sft(j), sft(N-1);
				break;
			}
		}
	}
	if (N%4 == 3 || N%4 == 0) sft(0);
	for (int i=1; i<=N; i++) if (S[i] != T[i]){
		puts("-1");
		return 0;
	}
	printf("%d\n", (int)V.size());
	for (int x : V) printf("%d ", N-x);
	printf("\n");
	return 0;
}

Compilation message

A.cpp: In function 'int main()':
A.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |  scanf("%d %*d", &N);
      |  ~~~~~^~~~~~~~~~~~~~
A.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |  scanf("%s", S+1);
      |  ~~~~~^~~~~~~~~~~
A.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |  scanf("%s", T+1);
      |  ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
24.0 / 24.0

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

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB [n = 1, m = 10000], OK, 2 operations
2 Correct 0 ms 256 KB [n = 2, m = 10000], OK, 2 operations
3 Correct 0 ms 256 KB [n = 8, m = 10000], OK, 17 operations
4 Correct 0 ms 256 KB [n = 8, m = 10000], OK, 17 operations
5 Correct 1 ms 256 KB [n = 8, m = 10000], OK, 17 operations
6 Correct 1 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 17 operations
8 Correct 0 ms 256 KB [n = 8, m = 10000], OK, 17 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 98 operations
10 Correct 1 ms 288 KB [n = 50, m = 10000], OK, 98 operations
11 Correct 0 ms 256 KB [n = 100, m = 10000], OK, 201 operations
12 Correct 1 ms 256 KB [n = 99, m = 10000], OK, 199 operations
13 Correct 0 ms 256 KB [n = 50, m = 10000], OK, 98 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 98 operations
15 Correct 0 ms 256 KB [n = 50, m = 10000], OK: No solution
16 Correct 0 ms 256 KB [n = 50, m = 10000], OK, 98 operations
17 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 98 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 2001 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1999 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1994 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1994 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 2001 operations
23 Correct 3 ms 512 KB [n = 1000, m = 10000], OK, 2001 operations
24 Correct 3 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 2001 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 2001 operations
27 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 4001 operations
28 Correct 10 ms 384 KB [n = 1999, m = 10000], OK, 3999 operations
29 Correct 9 ms 384 KB [n = 1998, m = 10000], OK, 3994 operations
30 Correct 10 ms 384 KB [n = 1997, m = 10000], OK, 3994 operations
31 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 4001 operations
32 Correct 12 ms 384 KB [n = 2000, m = 10000], OK, 4001 operations
33 Correct 9 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 4001 operations
35 Correct 9 ms 384 KB [n = 2000, m = 10000], OK, 4001 operations

Subtask #5
12.0 / 12.0

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

Subtask #6
11.0 / 11.0

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

Subtask #7
11.0 / 11.0

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