oj.uz

Submission #504016

# Submission time Handle Problem Language Result Execution time Memory
504016 2022-01-09T13:49:17 Z rainboy Wells (CEOI21_wells) C
50 / 100
 379 ms 1484 KB 
/* https://hsin.hr/ceoi/competition/ceoi2021_day2_editorial.pdf */
#include <stdio.h>
#include <stdlib.h>

#define N	10000
#define MD	1000000007
#define INF	0x3f3f3f3f

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

int pp2[N + 1];

void init() {
	int i;

	pp2[0] = 1;
	for (i = 1; i <= N; i++)
		pp2[i] = pp2[i - 1] * 2 % MD;
}

int mem[(N - 1) * 2], *ptr = mem;
int *ej[N], eo[N], pp[N], n, k; char type[N];

int i_, l;
int ii[N]; char path[N];

void dfs1(int p, int i, int d) {
	int o;

	pp[i] = p;
	d++;
	if (l < d)
		l = d, i_ = i;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs1(i, j, d);
	}
}

int gg[N], dd[N], hh[N];

void dfs2(int p, int i, int g, int d) {
	int o;

	gg[i] = g, dd[i] = d, hh[i] = 0;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p && !path[j]) {
			dfs2(i, j, g, d + 1);
			hh[i] = max(hh[i], hh[j] + 1);
		}
	}
}

int dfs3(int p, int i, int d) {
	int o, x;

	if (d == 0 || type[i] == -1)
		return 1;
	x = 1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			x = (long long) x * dfs3(i, j, d - 1) % MD;
	}
	return (x + 1) % MD;
}

int cc[N], dp[N], dq[N], dr[N];

int dfs4(int p, int i) {
	int o, p1, p2;

	dp[i] = -INF, dq[i] = 0, dr[i] = -1, p1 = p2 = -INF;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p && !path[j] && type[j] == 1) {
			if (!dfs4(i, j))
				return 0;
			dp[i] = max(dp[i], dp[j]);
			if (p1 < dp[j])
				p2 = p1, p1 = dp[j];
			else if (p2 < dp[j])
				p2 = dp[j];
			if (cc[i] == 0 && dq[i] + dq[j] + 1 >= k - 1)
				return 0;
			dq[i] = max(dq[i], dq[j] + 1);
			if (dr[j] != -1)
				dr[i] = dr[j] + 1;
		}
	}
	if (cc[i] == 1)
		dp[i] = hh[i], dq[i] = -1, dr[i] = 0;
	else if (p2 != -INF && dr[i] * 2 <= k - 1 && dr[i] * 2 + p1 + p2 >= k - 1)
		return 0;
	return 1;
}

int yes, ans;

void try(int r) {
	int g, gl, gr, i, d, x;

	gl = r, gr = (l - 1 - r) / k * k + r;
	for (g = 0; g < gl; g++) {
		i = ii[g];
		if (g * 2 + k - r > k - 1 && type[i] == 1)
			return;
	}
	for (g = gr + 1; g < l; g++) {
		i = ii[g];
		if (l - 1 - g * 2 + k + (l - 1 - r) / k * k + r > k - 1 && type[i] == 1)
			return;
	}
	for (i = 0; i < n; i++) {
		g = gg[i], d = dd[i];
		if (path[i])
			cc[i] = g % k == r ? 1 : 0;
		else if (type[i] == 1) {
			int cl = g >= gl ? ((g + d) % k == r ? 1 : 0) : -1;
			int cr = g <= gr ? ((g - d % k + k) % k == r ? 1 : 0) : -1;

			if (cl != -1 && cr != -1) {
				if (cl != cr)
					return;
				cc[i] = cl;
			} else
				cc[i] = cl != -1 ? cl : cr;
		}
	}
	x = 1;
	for (i = 0; i < n; i++)
		if (!path[i] && type[i] == 0 && (path[pp[i]] || type[pp[i]] == 1)) {
			g = gg[i], d = dd[i];
			if (g + dd[i] + hh[i] >= k - 1) {
				if (g >= gl)
					continue;
				x = (long long) x * dfs3(pp[i], i, k - 1 - (g + dd[i])) % MD;
			} else {
				if (g <= gr)
					continue;
				x = (long long) x * dfs3(pp[i], i, k - 1 - (l - 1 - g + dd[i])) % MD;
			}
		}
	for (g = 0; g < l; g++)
		if (type[ii[g]] == 1 && !dfs4(-1, ii[g]))
			return;
	yes = 1, ans = (ans + x) % MD;
}

int main() {
	static int uu[N - 1], vv[N - 1];
	int g, h, i, j, u, v, d, r;

	init();
	scanf("%d%d", &n, &k);
	if (k == 2) {
		printf("YES\n");
		printf("2\n");
		return 0;
	}
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		uu[h] = i, vv[h] = j;
		eo[i]++, eo[j]++;
	}
	for (i = 0; i < n; i++) {
		ej[i] = ptr, ptr += eo[i];
		eo[i] = 0;
	}
	for (h = 0; h < n - 1; h++) {
		i = uu[h], j = vv[h];
		ej[i][eo[i]++] = j, ej[j][eo[j]++] = i;
	}
	i_ = -1, l = -1, dfs1(-1, 0, 0), u = i_;
	i_ = -1, l = -1, dfs1(-1, u, 0), v = i_;
	if (l < k) {
		printf("YES\n");
		printf("%d\n", pp2[n]);
		return 0;
	}
	for (i = v, d = l - 1; i != u; i = pp[i], d--)
		path[ii[d] = i] = 1;
	path[ii[0] = u] = 1;
	for (g = 0; g < l; g++)
		dfs2(-1, ii[g], g, 0);
	for (i = 0; i < n; i++) {
		g = gg[i];
		if (max(g, l - 1 - g) + dd[i] + hh[i] < k - 1)
			type[i] = -1;
		else if (min(g, l - 1 - g) + dd[i] + hh[i] >= k - 1)
			type[i] = 1;
		else
			type[i] = 0;
	}
	yes = 0, ans = 0;
	for (r = 0; r < k; r++)
		try(r);
	if (yes) {
		printf("YES\n");
		for (i = 0; i < n; i++)
			if (!path[i] && type[i] == -1)
				ans = ans * 2 % MD;
		printf("%d\n", ans);
	} else {
		printf("NO\n");
		printf("0\n");
	}
	return 0;
}

Compilation message

wells.c: In function 'main':
wells.c:162:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
wells.c:169:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  169 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 312 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 320 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 1 ms 324 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 0 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 0 ms 324 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 312 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 320 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 1 ms 324 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 0 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 0 ms 324 KB Output is correct
59 Correct 0 ms 328 KB Output is correct
60 Correct 5 ms 716 KB Output is correct
61 Correct 4 ms 592 KB Output is correct
62 Correct 3 ms 716 KB Output is correct
63 Correct 5 ms 1136 KB Output is correct
64 Correct 72 ms 1484 KB Output is correct
65 Correct 3 ms 972 KB Output is correct
66 Correct 4 ms 956 KB Output is correct
67 Correct 111 ms 1476 KB Output is correct
68 Correct 3 ms 700 KB Output is correct
69 Correct 2 ms 456 KB Output is correct
70 Correct 3 ms 852 KB Output is correct
71 Correct 3 ms 716 KB Output is correct
72 Correct 4 ms 716 KB Output is correct
73 Correct 78 ms 808 KB Output is correct
74 Correct 269 ms 1200 KB Output is correct
75 Correct 92 ms 968 KB Output is correct
76 Correct 10 ms 1076 KB Output is correct
77 Correct 4 ms 568 KB Output is correct
78 Correct 14 ms 660 KB Output is correct
79 Correct 5 ms 592 KB Output is correct
80 Correct 207 ms 1068 KB Output is correct
81 Correct 241 ms 1100 KB Output is correct
82 Correct 86 ms 964 KB Output is correct
83 Correct 101 ms 1092 KB Output is correct
84 Correct 3 ms 884 KB Output is correct
85 Correct 284 ms 1256 KB Output is correct
86 Correct 8 ms 972 KB Output is correct
87 Correct 13 ms 1228 KB Output is correct
88 Correct 13 ms 1140 KB Output is correct
89 Correct 5 ms 1120 KB Output is correct
90 Correct 50 ms 772 KB Output is correct
91 Correct 76 ms 1136 KB Output is correct
92 Correct 217 ms 1400 KB Output is correct
93 Correct 20 ms 1228 KB Output is correct
94 Correct 5 ms 972 KB Output is correct
95 Correct 16 ms 844 KB Output is correct
96 Correct 9 ms 716 KB Output is correct
97 Correct 72 ms 844 KB Output is correct
98 Correct 77 ms 828 KB Output is correct
99 Correct 64 ms 840 KB Output is correct
100 Correct 201 ms 1220 KB Output is correct
101 Correct 31 ms 964 KB Output is correct
102 Correct 72 ms 1228 KB Output is correct
103 Correct 4 ms 1100 KB Output is correct
104 Correct 9 ms 1204 KB Output is correct
105 Correct 12 ms 1268 KB Output is correct
106 Correct 4 ms 972 KB Output is correct
107 Correct 24 ms 1380 KB Output is correct
108 Correct 5 ms 972 KB Output is correct
109 Correct 4 ms 1100 KB Output is correct
110 Correct 9 ms 1228 KB Output is correct
111 Correct 12 ms 1168 KB Output is correct
112 Correct 37 ms 1188 KB Output is correct
113 Correct 11 ms 1100 KB Output is correct
114 Correct 16 ms 1092 KB Output is correct
115 Correct 6 ms 1040 KB Output is correct
116 Correct 35 ms 1348 KB Output is correct
117 Correct 9 ms 1100 KB Output is correct
118 Correct 43 ms 1356 KB Output is correct
119 Correct 12 ms 1100 KB Output is correct
120 Correct 35 ms 1308 KB Output is correct
121 Correct 267 ms 1280 KB Output is correct
122 Correct 328 ms 1260 KB Output is correct
123 Correct 101 ms 1100 KB Output is correct
124 Correct 26 ms 1216 KB Output is correct
125 Correct 12 ms 1008 KB Output is correct
126 Correct 24 ms 972 KB Output is correct
127 Correct 379 ms 1356 KB Output is correct

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 312 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 320 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 1 ms 324 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 0 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 0 ms 324 KB Output is correct
59 Correct 0 ms 328 KB Output is correct
60 Correct 5 ms 716 KB Output is correct
61 Correct 4 ms 592 KB Output is correct
62 Correct 3 ms 716 KB Output is correct
63 Correct 5 ms 1136 KB Output is correct
64 Correct 72 ms 1484 KB Output is correct
65 Correct 3 ms 972 KB Output is correct
66 Correct 4 ms 956 KB Output is correct
67 Correct 111 ms 1476 KB Output is correct
68 Correct 3 ms 700 KB Output is correct
69 Correct 2 ms 456 KB Output is correct
70 Correct 3 ms 852 KB Output is correct
71 Correct 3 ms 716 KB Output is correct
72 Correct 4 ms 716 KB Output is correct
73 Correct 78 ms 808 KB Output is correct
74 Correct 269 ms 1200 KB Output is correct
75 Correct 92 ms 968 KB Output is correct
76 Correct 10 ms 1076 KB Output is correct
77 Correct 4 ms 568 KB Output is correct
78 Correct 14 ms 660 KB Output is correct
79 Correct 5 ms 592 KB Output is correct
80 Correct 207 ms 1068 KB Output is correct
81 Correct 241 ms 1100 KB Output is correct
82 Correct 86 ms 964 KB Output is correct
83 Correct 101 ms 1092 KB Output is correct
84 Correct 3 ms 884 KB Output is correct
85 Correct 284 ms 1256 KB Output is correct
86 Correct 8 ms 972 KB Output is correct
87 Correct 13 ms 1228 KB Output is correct
88 Correct 13 ms 1140 KB Output is correct
89 Correct 5 ms 1120 KB Output is correct
90 Correct 50 ms 772 KB Output is correct
91 Correct 76 ms 1136 KB Output is correct
92 Correct 217 ms 1400 KB Output is correct
93 Correct 20 ms 1228 KB Output is correct
94 Correct 5 ms 972 KB Output is correct
95 Correct 16 ms 844 KB Output is correct
96 Correct 9 ms 716 KB Output is correct
97 Correct 72 ms 844 KB Output is correct
98 Correct 77 ms 828 KB Output is correct
99 Correct 64 ms 840 KB Output is correct
100 Correct 201 ms 1220 KB Output is correct
101 Correct 31 ms 964 KB Output is correct
102 Correct 72 ms 1228 KB Output is correct
103 Correct 4 ms 1100 KB Output is correct
104 Correct 9 ms 1204 KB Output is correct
105 Correct 12 ms 1268 KB Output is correct
106 Correct 4 ms 972 KB Output is correct
107 Correct 24 ms 1380 KB Output is correct
108 Correct 5 ms 972 KB Output is correct
109 Correct 4 ms 1100 KB Output is correct
110 Correct 9 ms 1228 KB Output is correct
111 Correct 12 ms 1168 KB Output is correct
112 Correct 37 ms 1188 KB Output is correct
113 Correct 11 ms 1100 KB Output is correct
114 Correct 16 ms 1092 KB Output is correct
115 Correct 6 ms 1040 KB Output is correct
116 Correct 35 ms 1348 KB Output is correct
117 Correct 9 ms 1100 KB Output is correct
118 Correct 43 ms 1356 KB Output is correct
119 Correct 12 ms 1100 KB Output is correct
120 Correct 35 ms 1308 KB Output is correct
121 Correct 267 ms 1280 KB Output is correct
122 Correct 328 ms 1260 KB Output is correct
123 Correct 101 ms 1100 KB Output is correct
124 Correct 26 ms 1216 KB Output is correct
125 Correct 12 ms 1008 KB Output is correct
126 Correct 24 ms 972 KB Output is correct
127 Correct 379 ms 1356 KB Output is correct
128 Correct 0 ms 332 KB Output is correct
129 Runtime error 1 ms 464 KB Execution killed with signal 11
130 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 312 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 320 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 1 ms 324 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 0 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 0 ms 324 KB Output is correct
59 Correct 0 ms 328 KB Output is correct
60 Correct 5 ms 716 KB Output is correct
61 Correct 4 ms 592 KB Output is correct
62 Correct 3 ms 716 KB Output is correct
63 Correct 5 ms 1136 KB Output is correct
64 Correct 72 ms 1484 KB Output is correct
65 Correct 3 ms 972 KB Output is correct
66 Correct 4 ms 956 KB Output is correct
67 Correct 111 ms 1476 KB Output is correct
68 Correct 3 ms 700 KB Output is correct
69 Correct 2 ms 456 KB Output is correct
70 Correct 3 ms 852 KB Output is correct
71 Correct 3 ms 716 KB Output is correct
72 Correct 4 ms 716 KB Output is correct
73 Correct 78 ms 808 KB Output is correct
74 Correct 269 ms 1200 KB Output is correct
75 Correct 92 ms 968 KB Output is correct
76 Correct 10 ms 1076 KB Output is correct
77 Correct 4 ms 568 KB Output is correct
78 Correct 14 ms 660 KB Output is correct
79 Correct 5 ms 592 KB Output is correct
80 Correct 207 ms 1068 KB Output is correct
81 Correct 241 ms 1100 KB Output is correct
82 Correct 86 ms 964 KB Output is correct
83 Correct 101 ms 1092 KB Output is correct
84 Correct 3 ms 884 KB Output is correct
85 Correct 284 ms 1256 KB Output is correct
86 Correct 8 ms 972 KB Output is correct
87 Correct 13 ms 1228 KB Output is correct
88 Correct 13 ms 1140 KB Output is correct
89 Correct 5 ms 1120 KB Output is correct
90 Correct 50 ms 772 KB Output is correct
91 Correct 76 ms 1136 KB Output is correct
92 Correct 217 ms 1400 KB Output is correct
93 Correct 20 ms 1228 KB Output is correct
94 Correct 5 ms 972 KB Output is correct
95 Correct 16 ms 844 KB Output is correct
96 Correct 9 ms 716 KB Output is correct
97 Correct 72 ms 844 KB Output is correct
98 Correct 77 ms 828 KB Output is correct
99 Correct 64 ms 840 KB Output is correct
100 Correct 201 ms 1220 KB Output is correct
101 Correct 31 ms 964 KB Output is correct
102 Correct 72 ms 1228 KB Output is correct
103 Correct 4 ms 1100 KB Output is correct
104 Correct 9 ms 1204 KB Output is correct
105 Correct 12 ms 1268 KB Output is correct
106 Correct 4 ms 972 KB Output is correct
107 Correct 24 ms 1380 KB Output is correct
108 Correct 5 ms 972 KB Output is correct
109 Correct 4 ms 1100 KB Output is correct
110 Correct 9 ms 1228 KB Output is correct
111 Correct 12 ms 1168 KB Output is correct
112 Correct 37 ms 1188 KB Output is correct
113 Correct 11 ms 1100 KB Output is correct
114 Correct 16 ms 1092 KB Output is correct
115 Correct 6 ms 1040 KB Output is correct
116 Correct 35 ms 1348 KB Output is correct
117 Correct 9 ms 1100 KB Output is correct
118 Correct 43 ms 1356 KB Output is correct
119 Correct 12 ms 1100 KB Output is correct
120 Correct 35 ms 1308 KB Output is correct
121 Correct 267 ms 1280 KB Output is correct
122 Correct 328 ms 1260 KB Output is correct
123 Correct 101 ms 1100 KB Output is correct
124 Correct 26 ms 1216 KB Output is correct
125 Correct 12 ms 1008 KB Output is correct
126 Correct 24 ms 972 KB Output is correct
127 Correct 379 ms 1356 KB Output is correct
128 Correct 0 ms 332 KB Output is correct
129 Runtime error 1 ms 464 KB Execution killed with signal 11
130 Halted 0 ms 0 KB -