oj.uz

답안 #889113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889113 2023-12-18T22:58:47 Z rainboy World of Tank (innopolis2018_final_E) C
100 / 100
 296 ms 175532 KB 
/* https://codeforces.com/blog/entry/58056 */
#include <stdio.h>
#include <string.h>

#define N	2000001

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

int xx1[N], xx2[N], xx[N], bb[N], n, t;

int dp[N * 2], pp[N * 2];

void update(int u, int v, int x) {
	if (dp[v] < x)
		dp[v] = x, pp[v] = u;
}

int xx_[N], m;
int yy1[N], k;

int trace(int u) {
	int i, x, y;

	if (u == (0 << 1 | 0))
		return t;
	i = u >> 1, y = u & 1;
	x = trace(pp[u]);
	if (pp[u] == (u ^ 1)) {
		xx_[m++] = xx[i];
		x = max(x, xx[i]);
	} else if ((bb[i] & 1 << y) != 0)
		xx1[k] = x, yy1[k] = y + 1, k++, x += t;
	return x;
}

int main() {
	int n1, n2, x_, h, i, i1, i2, u;

	scanf("%d%d%d%d", &x_, &n1, &n2, &t);
	for (i = 0; i < n1; i++)
		scanf("%d", &xx1[i]);
	xx1[n1] = x_ + 1;
	for (i = 0; i < n2; i++)
		scanf("%d", &xx2[i]);
	xx2[n2] = x_ + 1;
	i1 = 0, i2 = 0, n = 0;
	xx[n] = 0, bb[n] = 0, n++;
	while (i1 < n1 || i2 < n2)
		if (xx1[i1] < xx2[i2]) {
			if (xx[n - 1] + 1 < xx1[i1])
				xx[n] = xx[n - 1] + 1, bb[n] = 0, n++;
			xx[n] = xx1[i1], bb[n] = 1, n++;
			i1++;
		} else if (xx1[i1] > xx2[i2]) {
			if (xx[n - 1] + 1 < xx2[i2])
				xx[n] = xx[n - 1] + 1, bb[n] = 0, n++;
			xx[n] = xx2[i2], bb[n] = 2, n++;
			i2++;
		} else {
			if (xx[n - 1] + 1 < xx1[i1])
				xx[n] = xx[n - 1] + 1, bb[n] = 0, n++;
			xx[n] = xx1[i1], bb[n] = 3, n++;
			i1++, i2++;
		}
	memset(dp, -1, n * 2 * sizeof *dp), memset(pp, -1, n * 2 * sizeof *pp), dp[0 << 1 | 0] = 0;
	for (i = 0; i < n; i++) {
		if (dp[i << 1 | 0] != -1 && (bb[i] & 2) == 0)
			update(i << 1 | 0, i << 1 | 1, min(dp[i << 1 | 0], t));
		if (dp[i << 1 | 1] != -1 && (bb[i] & 1) == 0)
			update(i << 1 | 1, i << 1 | 0, min(dp[i << 1 | 1], t));
		if (i + 1 < n) {
			if (dp[i << 1 | 0] != -1) {
				if ((bb[i + 1] & 1) == 0)
					update(i << 1 | 0, i + 1 << 1 | 0, dp[i << 1 | 0] + xx[i + 1] - xx[i]);
				else if (dp[i << 1 | 0] + xx[i + 1] - xx[i] - 1 >= t)
					update(i << 1 | 0, i + 1 << 1 | 0, dp[i << 1 | 0] + xx[i + 1] - xx[i] - t);
			}
			if (dp[i << 1 | 1] != -1) {
				if ((bb[i + 1] & 2) == 0)
					update(i << 1 | 1, i + 1 << 1 | 1, dp[i << 1 | 1] + xx[i + 1] - xx[i]);
				else if (dp[i << 1 | 1] + xx[i + 1] - xx[i] - 1 >= t)
					update(i << 1 | 1, i + 1 << 1 | 1, dp[i << 1 | 1] + xx[i + 1] - xx[i] - t);
			}
		}
	}
	if (dp[n - 1 << 1 | 0] == -1 && dp[n - 1 << 1 | 1] == -1) {
		printf("No\n");
		return 0;
	}
	u = dp[n - 1 << 1 | 0] != -1 ? n - 1 << 1 | 0 : n - 1 << 1 | 1;
	if (pp[u] == (u ^ 1))
		u ^= 1;
	trace(u);
	printf("Yes\n");
	printf("%d\n", m);
	for (h = 0; h < m; h++)
		printf("%d ", xx_[h]);
	printf("\n");
	printf("%d\n", k);
	for (h = 0; h < k; h++)
		printf("%d %d\n", xx1[h], yy1[h]);
	return 0;
}

Compilation message

E.c: In function 'main':
E.c:75:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   75 |      update(i << 1 | 0, i + 1 << 1 | 0, dp[i << 1 | 0] + xx[i + 1] - xx[i]);
      |                         ~~^~~
E.c:77:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   77 |      update(i << 1 | 0, i + 1 << 1 | 0, dp[i << 1 | 0] + xx[i + 1] - xx[i] - t);
      |                         ~~^~~
E.c:81:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   81 |      update(i << 1 | 1, i + 1 << 1 | 1, dp[i << 1 | 1] + xx[i + 1] - xx[i]);
      |                         ~~^~~
E.c:83:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   83 |      update(i << 1 | 1, i + 1 << 1 | 1, dp[i << 1 | 1] + xx[i + 1] - xx[i] - t);
      |                         ~~^~~
E.c:87:11: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   87 |  if (dp[n - 1 << 1 | 0] == -1 && dp[n - 1 << 1 | 1] == -1) {
      |         ~~^~~
E.c:87:39: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   87 |  if (dp[n - 1 << 1 | 0] == -1 && dp[n - 1 << 1 | 1] == -1) {
      |                                     ~~^~~
E.c:91:11: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   91 |  u = dp[n - 1 << 1 | 0] != -1 ? n - 1 << 1 | 0 : n - 1 << 1 | 1;
      |         ~~^~~
E.c:91:35: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   91 |  u = dp[n - 1 << 1 | 0] != -1 ? n - 1 << 1 | 0 : n - 1 << 1 | 1;
      |                                 ~~^~~
E.c:91:52: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   91 |  u = dp[n - 1 << 1 | 0] != -1 ? n - 1 << 1 | 0 : n - 1 << 1 | 1;
      |                                                  ~~^~~
E.c:40:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%d%d%d%d", &x_, &n1, &n2, &t);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
E.c:42:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |   scanf("%d", &xx1[i]);
      |   ^~~~~~~~~~~~~~~~~~~~
E.c:45:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d", &xx2[i]);
      |   ^~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 12720 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
2 Correct 1 ms 12636 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
3 Correct 1 ms 12636 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
4 Correct 1 ms 12720 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
5 Correct 1 ms 12636 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
6 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
7 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
8 Correct 1 ms 12632 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
9 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
10 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
11 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
12 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
13 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
14 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
15 Correct 1 ms 12636 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
16 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
17 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
18 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
19 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
20 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
21 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
22 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
23 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 12720 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 1 ms 12632 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
25 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
26 Correct 2 ms 12636 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
27 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
28 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
29 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
30 Correct 51 ms 45520 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
31 Correct 43 ms 45396 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
32 Correct 40 ms 43356 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
33 Correct 44 ms 30932 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
34 Correct 103 ms 65540 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
35 Correct 85 ms 63672 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
36 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
37 Correct 86 ms 53700 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
38 Correct 36 ms 34996 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
39 Correct 50 ms 35608 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
40 Correct 7 ms 15964 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
41 Correct 8 ms 16476 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
42 Correct 15 ms 23388 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
43 Correct 32 ms 34128 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
44 Correct 25 ms 26192 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
45 Correct 14 ms 23644 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
46 Correct 26 ms 26968 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
47 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
48 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
49 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
50 Correct 1 ms 12636 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB [OK, Yes] n = 20, m1 = 20, m2 = 0, t = 20
2 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 509, m2 = 491, t = 5000
3 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 764, m2 = 736, t = 5000
4 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 698, m2 = 802, t = 5000
5 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 720, m2 = 780, t = 5000
6 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 734, m2 = 766, t = 5000
7 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 997, m2 = 1003, t = 5000
8 Correct 2 ms 12636 KB [OK, Yes] n = 5000, m1 = 1021, m2 = 979, t = 5000
9 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1006, m2 = 995, t = 5000
10 Correct 1 ms 12636 KB [OK, No] n = 5000, m1 = 1017, m2 = 984, t = 5000
11 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1495, m2 = 1506, t = 5000
12 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 974, m2 = 1026, t = 2501
13 Correct 2 ms 12720 KB [OK, Yes] n = 5000, m1 = 1022, m2 = 978, t = 2501
14 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1019, m2 = 981, t = 2501
15 Correct 2 ms 12888 KB [OK, Yes] n = 5000, m1 = 1298, m2 = 1367, t = 2501
16 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1301, m2 = 1360, t = 2501
17 Correct 2 ms 12892 KB [OK, Yes] n = 5000, m1 = 1320, m2 = 1315, t = 2501
18 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1195, m2 = 1135, t = 2501
19 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1148, m2 = 1202, t = 2501
20 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1147, m2 = 1179, t = 2501
21 Correct 2 ms 12632 KB [OK, No] n = 5000, m1 = 1163, m2 = 1146, t = 2501
22 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1145, m2 = 1184, t = 2501
23 Correct 2 ms 12636 KB [OK, No] n = 5000, m1 = 1172, m2 = 1150, t = 2501
24 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 12, m2 = 9, t = 3
25 Correct 1 ms 12636 KB [OK, Yes] n = 10, m1 = 4, m2 = 2, t = 2
26 Correct 1 ms 12636 KB [OK, Yes] n = 10, m1 = 6, m2 = 0, t = 2
27 Correct 1 ms 12720 KB [OK, Yes] n = 10, m1 = 2, m2 = 4, t = 1
28 Correct 1 ms 12636 KB [OK, No] n = 20, m1 = 4, m2 = 11, t = 2
29 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 1
30 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 8, t = 2
31 Correct 1 ms 12632 KB [OK, Yes] n = 20, m1 = 0, m2 = 10, t = 2
32 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 4, m2 = 6, t = 2
33 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 1, t = 2
34 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 10, m2 = 9, t = 2
35 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 2
36 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 0, m2 = 0, t = 3
37 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 5, m2 = 4, t = 3
38 Correct 1 ms 12636 KB [OK, Yes] n = 9, m1 = 4, m2 = 3, t = 3
39 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 8, m2 = 8, t = 3
40 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 7, t = 3
41 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 10, t = 7
42 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 7, m2 = 10, t = 8
43 Correct 1 ms 12636 KB [OK, Yes] n = 20, m1 = 13, m2 = 10, t = 4
44 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 9, m2 = 9, t = 8
45 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 10, m2 = 11, t = 3
46 Correct 2 ms 12636 KB [OK, Yes] n = 20, m1 = 11, m2 = 11, t = 3
47 Correct 1 ms 12632 KB [OK, Yes] n = 500, m1 = 197, m2 = 53, t = 2
48 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 189, m2 = 61, t = 3
49 Correct 2 ms 12636 KB [OK, No] n = 500, m1 = 66, m2 = 184, t = 4
50 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
51 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 248, m2 = 252, t = 1
52 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 205, m2 = 295, t = 1
53 Correct 51 ms 45520 KB [OK, Yes] n = 1000000, m1 = 183472, m2 = 66528, t = 7
54 Correct 43 ms 45396 KB [OK, Yes] n = 1000000, m1 = 206211, m2 = 43789, t = 6
55 Correct 40 ms 43356 KB [OK, Yes] n = 1000000, m1 = 229445, m2 = 20555, t = 7
56 Correct 44 ms 30932 KB [OK, No] n = 1000000, m1 = 261335, m2 = 238665, t = 2
57 Correct 103 ms 65540 KB [OK, Yes] n = 1000000, m1 = 374819, m2 = 125181, t = 3
58 Correct 85 ms 63672 KB [OK, Yes] n = 1000000, m1 = 88376, m2 = 411624, t = 3
59 Correct 1 ms 12636 KB [OK, Yes] n = 500, m1 = 125, m2 = 125, t = 2
60 Correct 86 ms 53700 KB [OK, Yes] n = 1000000, m1 = 250000, m2 = 250000, t = 2
61 Correct 36 ms 34996 KB [OK, Yes] n = 1000000, m1 = 94957, m2 = 94938, t = 12
62 Correct 50 ms 35608 KB [OK, Yes] n = 1000000, m1 = 94972, m2 = 95007, t = 10
63 Correct 7 ms 15964 KB [OK, Yes] n = 1000000, m1 = 14064, m2 = 13936, t = 200
64 Correct 8 ms 16476 KB [OK, Yes] n = 1000000, m1 = 15990, m2 = 16010, t = 139
65 Correct 15 ms 23388 KB [OK, Yes] n = 1000000, m1 = 32291, m2 = 32404, t = 34
66 Correct 32 ms 34128 KB [OK, Yes] n = 1000000, m1 = 88230, m2 = 88238, t = 13
67 Correct 25 ms 26192 KB [OK, Yes] n = 1000000, m1 = 44550, m2 = 44400, t = 34
68 Correct 14 ms 23644 KB [OK, Yes] n = 1000000, m1 = 31778, m2 = 31772, t = 44
69 Correct 26 ms 26968 KB [OK, No] n = 1000000, m1 = 147142, m2 = 147242, t = 10
70 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 416, m2 = 417, t = 77
71 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 412, m2 = 414, t = 111
72 Correct 2 ms 12636 KB [OK, Yes] n = 1000, m1 = 422, m2 = 423, t = 62
73 Correct 1 ms 12636 KB [OK, Yes] n = 800, m1 = 279, m2 = 270, t = 33
74 Correct 2 ms 12888 KB [OK, Yes] n = 1000000000, m1 = 489, m2 = 511, t = 3000000
75 Correct 2 ms 12636 KB [OK, Yes] n = 100000000, m1 = 496, m2 = 504, t = 300000
76 Correct 2 ms 12636 KB [OK, Yes] n = 100000000, m1 = 506, m2 = 494, t = 400000
77 Correct 2 ms 12632 KB [OK, Yes] n = 100000000, m1 = 520, m2 = 480, t = 230000
78 Correct 2 ms 12892 KB [OK, Yes] n = 1000000000, m1 = 995, m2 = 1005, t = 1100000
79 Correct 2 ms 12892 KB [OK, Yes] n = 1000000000, m1 = 1016, m2 = 984, t = 1100003
80 Correct 227 ms 157464 KB [OK, Yes] n = 10000000, m1 = 423780, m2 = 576220, t = 1
81 Correct 183 ms 151216 KB [OK, Yes] n = 10000000, m1 = 102640, m2 = 897360, t = 16
82 Correct 296 ms 166480 KB [OK, Yes] n = 10000000, m1 = 922340, m2 = 77660, t = 6
83 Correct 176 ms 150824 KB [OK, Yes] n = 10000000, m1 = 66539, m2 = 933461, t = 5
84 Correct 187 ms 153724 KB [OK, Yes] n = 10000000, m1 = 156107, m2 = 843893, t = 17
85 Correct 276 ms 175532 KB [OK, Yes] n = 1000000000, m1 = 950948, m2 = 49052, t = 297
86 Correct 229 ms 163624 KB [OK, Yes] n = 1000000000, m1 = 288017, m2 = 711983, t = 1174
87 Correct 213 ms 158748 KB [OK, Yes] n = 1000000000, m1 = 103443, m2 = 896557, t = 1547
88 Correct 183 ms 158036 KB [OK, Yes] n = 1000000000, m1 = 51412, m2 = 948588, t = 1440
89 Correct 197 ms 162208 KB [OK, Yes] n = 1000000000, m1 = 192898, m2 = 807102, t = 581
90 Correct 172 ms 100756 KB [OK, Yes] n = 1000000000, m1 = 500000, m2 = 500000, t = 2
91 Correct 200 ms 148820 KB [OK, Yes] n = 1000000000, m1 = 499558, m2 = 500434, t = 2500
92 Correct 195 ms 145056 KB [OK, Yes] n = 1000000000, m1 = 496969, m2 = 497436, t = 3000
93 Correct 188 ms 137760 KB [OK, Yes] n = 1000000000, m1 = 444326, m2 = 444763, t = 4000
94 Correct 106 ms 63384 KB [OK, No] n = 1000000000, m1 = 499655, m2 = 500345, t = 2000
95 Correct 187 ms 137232 KB [OK, Yes] n = 1000000000, m1 = 423266, m2 = 423367, t = 4500
96 Correct 98 ms 63272 KB [OK, No] n = 1000000000, m1 = 499763, m2 = 500237, t = 3500
97 Correct 183 ms 134564 KB [OK, Yes] n = 1000000000, m1 = 404552, m2 = 404965, t = 5000