oj.uz

Submission #590173

# Submission time Handle Problem Language Result Execution time Memory
590173 2022-07-05T15:42:25 Z rainboy Uplifting Excursion (BOI22_vault) C
40 / 100
 4844 ms 17860 KB 
#include <stdio.h>
#include <string.h>

#define N	100
#define S	(N * N * N)
#define N3	30
#define N4	50
#define S_	(N3 * N3)
#define INF	0x3f3f3f3f

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

void update(int *dp, int s_,int a, int k, int c) {
	static int dq[S * 2 + 1], qu[S * 2 + 1];
	int s, r, head, cnt;

	if (a > 0) {
		for (s = 0; s <= s_; s++)
			dq[s] = dp[s] == -INF ? -INF : dp[s] - s / a * c;
		for (r = 0; r < a; r++) {
			head = cnt = 0;
			for (s = r; s <= s_; s += a) {
				if (dq[s] != -INF) {
					while (cnt && dq[qu[head + cnt - 1]] < dq[s])
						cnt--;
					qu[head + cnt++] = s;
				}
				dp[s] = cnt == 0 ? -INF : dq[qu[head]] + s / a * c;
				if (cnt && qu[head] == s - a * k)
					head++, cnt--;
			}
		}
	} else if (a < 0) {
		a = -a;
		for (s = 0; s <= s_; s++)
			dq[s] = dp[s] == -INF ? -INF : dp[s] + s / a * c;
		for (r = 0; r < a; r++) {
			head = cnt = 0;
			for (s = (s_ - r) / a * a + r; s >= 0; s -= a) {
				if (dq[s] != -INF) {
					while (cnt && dq[qu[head + cnt - 1]] < dq[s])
						cnt--;
					qu[head + cnt++] = s;
				}
				dp[s] = cnt == 0 ? -INF : dq[qu[head]] - s / a * c;
				if (cnt && qu[head] == s + a * k)
					head++, cnt--;
			}
		}
	} else {
		if (c <= 0)
			return;
		for (s = 0; s <= s_; s++)
			if (dp[s] != -INF)
				dp[s] += k * c;
	}
}

long long solve(long long *kk, int n, long long s_) {
	static int dp[S_ * 2 + 1], dq[N + 1][S_ + 1];
	int a, s1, s2;
	long long s, s0, k, k0, ans;

	for (s = 0; s <= S_; s++)
		dp[s] = -INF;
	dp[0] = 0;
	for (a = n; a >= 0; a--) {
		memcpy(dq[a], dp, (S_ + 1) * sizeof *dp);
		update(dp, S_, a, min(kk[a + n], n), 1);
	}
	for (s = 0; s <= S_ * 2; s++)
		dp[s] = -INF;
	dp[S_ + 0] = 0;
	s0 = 0, k0 = 0;
	for (a = -n; a < 0; a++) {
		update(dp, S_ * 2, a, min(kk[a + n], n), -1);
		s0 += kk[a + n] * a, k0 += kk[a + n];
	}
	ans = -INF;
	for (a = 0; a <= n; a++) {
		for (s1 = 0; s1 <= S_ * 2; s1++)
			if (dp[s1] != -INF)
				for (s2 = 0; s2 <= S_; s2++)
					if (dq[a][s2] != -INF) {
						s = s0 - (s1 - S_) + s2;
						if (a == 0) {
							if (s == s_)
								ans = max(ans, k0 + dp[s1] + dq[a][s2] + kk[a + n]);
						} else {
							if (s <= s_ && (s_ - s) % a == 0 && (k = (s_ - s) / a) <= kk[a + n])
								ans = max(ans, k0 + dp[s1] + dq[a][s2] + k);
						}
					}
		update(dp, S_ * 2, a, min(kk[a + n], n), -1);
		s0 += kk[a + n] * a, k0 += kk[a + n];
	}
	return ans;
}

int main() {
	static long long kk[N * 2 + 1];
	static int dp[S * 2 + 1], dq[N][S_ + 1];
	int n, a, r, s1, s2, subtask2;
	long long s, s_, s0, k0, k, ans, tmp;

	scanf("%d%lld", &n, &s_);
	subtask2 = n <= N;
	for (a = -n; a <= n; a++) {
		scanf("%lld", &kk[a + n]);
		if (kk[a + n] > N)
			subtask2 = 0;
	}
	if (subtask2) {
		if (s_ < -S || s_ > S) {
			printf("impossible\n");
			return 0;
		}
		for (s = 0; s <= S * 2; s++)
			dp[s] = -INF;
		dp[S + 0] = 0;
		for (a = -n; a <= n; a++)
			update(dp, S * 2, a, kk[a + n], 1);
		if (dp[S + s_] == -INF)
			printf("impossible\n");
		else
			printf("%d\n", dp[S + s_]);
	} else if (n <= N3) {
		ans = -INF;
		for (r = 0; r < 2; r++) {
			ans = max(ans, solve(kk, n, s_));
			s_ = -s_;
			for (a = 1; a <= n; a++)
				tmp = kk[n - a], kk[n - a] = kk[n + a], kk[n + a] = tmp;
		}
		if (ans == -INF)
			printf("impossible\n");
		else
			printf("%lld\n", ans);
	} else if (n <= N3) {
		for (s = 0; s <= S_; s++)
			dp[s] = -INF;
		dp[0] = 0;
		for (a = n; a >= 0; a--) {
			memcpy(dq[a], dp, (S_ + 1) * sizeof *dp);
			update(dp, S_, a, min(kk[a + n], n), 1);
		}
		for (s = 0; s <= S_; s++)
			dp[s] = -INF;
		dp[0] = 0;
		ans = -INF, s0 = 0, k0 = 0;
		for (a = 0; a <= n; a++) {
			for (s1 = 0; s1 <= S_; s1++)
				if (dp[s1] != -INF)
					for (s2 = 0; s2 <= S_; s2++)
						if (dq[a][s2] != -INF) {
							s = s0 - s1 + s2;
							if (a == 0) {
								if (s == s_)
									ans = max(ans, k0 + dp[s1] + dq[a][s2] + kk[a + n]);
							} else {
								if (s <= s_ && (s_ - s) % a == 0 && (k = (s_ - s) / a) <= kk[a + n])
									ans = max(ans, k0 + dp[s1] + dq[a][s2] + k);
							}
						}
			update(dp, S_, a, min(kk[a + n], n), -1);
			s0 += kk[a + n] * a, k0 += kk[a + n];
		}
		if (ans == -INF)
			printf("impossible\n");
		else
			printf("%lld\n", ans);
	}
	return 0;
}

Compilation message

vault.c: In function 'main':
vault.c:107:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |  scanf("%d%lld", &n, &s_);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~
vault.c:110:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |   scanf("%lld", &kk[a + n]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 37 ms 15928 KB Output is correct
3 Correct 16 ms 15948 KB Output is correct
4 Correct 180 ms 15928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2024 ms 16056 KB Output is correct
7 Correct 1905 ms 16056 KB Output is correct
8 Correct 1893 ms 16064 KB Output is correct
9 Correct 1969 ms 16160 KB Output is correct
10 Correct 1949 ms 15924 KB Output is correct
11 Correct 1889 ms 15928 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 37 ms 15928 KB Output is correct
3 Correct 16 ms 15948 KB Output is correct
4 Correct 180 ms 15928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2024 ms 16056 KB Output is correct
7 Correct 1905 ms 16056 KB Output is correct
8 Correct 1893 ms 16064 KB Output is correct
9 Correct 1969 ms 16160 KB Output is correct
10 Correct 1949 ms 15924 KB Output is correct
11 Correct 1889 ms 15928 KB Output is correct
12 Correct 25 ms 15828 KB Output is correct
13 Correct 38 ms 15928 KB Output is correct
14 Correct 20 ms 15944 KB Output is correct
15 Correct 177 ms 15932 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1678 ms 16052 KB Output is correct
18 Correct 1825 ms 15928 KB Output is correct
19 Correct 1844 ms 16048 KB Output is correct
20 Correct 1710 ms 16160 KB Output is correct
21 Correct 1783 ms 15928 KB Output is correct
22 Correct 1862 ms 15928 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3861 ms 16892 KB Output is correct
25 Correct 3175 ms 16368 KB Output is correct
26 Correct 4146 ms 17860 KB Output is correct
27 Correct 4528 ms 17848 KB Output is correct
28 Correct 3592 ms 15928 KB Output is correct
29 Correct 4844 ms 15928 KB Output is correct

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15928 KB Output is correct
2 Correct 236 ms 420 KB Output is correct
3 Correct 113 ms 412 KB Output is correct
4 Correct 123 ms 416 KB Output is correct
5 Correct 318 ms 416 KB Output is correct
6 Correct 61 ms 420 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 78 ms 416 KB Output is correct
10 Correct 151 ms 412 KB Output is correct

Subtask #3-2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15928 KB Output is correct
2 Correct 236 ms 420 KB Output is correct
3 Correct 113 ms 412 KB Output is correct
4 Correct 123 ms 416 KB Output is correct
5 Correct 318 ms 416 KB Output is correct
6 Correct 61 ms 420 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 78 ms 416 KB Output is correct
10 Correct 151 ms 412 KB Output is correct
11 Correct 30 ms 15936 KB Output is correct
12 Correct 42 ms 15944 KB Output is correct
13 Correct 18 ms 15924 KB Output is correct
14 Correct 206 ms 15932 KB Output is correct
15 Correct 226 ms 340 KB Output is correct
16 Correct 121 ms 416 KB Output is correct
17 Correct 141 ms 416 KB Output is correct
18 Correct 229 ms 412 KB Output is correct
19 Correct 112 ms 416 KB Output is correct
20 Correct 13 ms 340 KB Output is correct
21 Correct 17 ms 436 KB Output is correct
22 Correct 83 ms 340 KB Output is correct
23 Correct 145 ms 416 KB Output is correct
24 Correct 1008 ms 412 KB Output is correct
25 Correct 454 ms 416 KB Output is correct
26 Correct 640 ms 416 KB Output is correct
27 Correct 977 ms 416 KB Output is correct
28 Correct 593 ms 416 KB Output is correct

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15928 KB Output is correct
2 Correct 236 ms 420 KB Output is correct
3 Correct 113 ms 412 KB Output is correct
4 Correct 123 ms 416 KB Output is correct
5 Correct 318 ms 416 KB Output is correct
6 Correct 61 ms 420 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 78 ms 416 KB Output is correct
10 Correct 151 ms 412 KB Output is correct
11 Correct 267 ms 15940 KB Output is correct
12 Correct 229 ms 416 KB Output is correct
13 Correct 117 ms 416 KB Output is correct
14 Correct 120 ms 416 KB Output is correct
15 Correct 234 ms 416 KB Output is correct
16 Correct 63 ms 340 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 16 ms 432 KB Output is correct
19 Correct 86 ms 420 KB Output is correct
20 Correct 184 ms 412 KB Output is correct
21 Correct 2498 ms 15932 KB Output is correct
22 Correct 2805 ms 15924 KB Output is correct
23 Incorrect 0 ms 212 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 37 ms 15928 KB Output is correct
3 Correct 16 ms 15948 KB Output is correct
4 Correct 180 ms 15928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2024 ms 16056 KB Output is correct
7 Correct 1905 ms 16056 KB Output is correct
8 Correct 1893 ms 16064 KB Output is correct
9 Correct 1969 ms 16160 KB Output is correct
10 Correct 1949 ms 15924 KB Output is correct
11 Correct 1889 ms 15928 KB Output is correct
12 Correct 224 ms 15928 KB Output is correct
13 Correct 236 ms 420 KB Output is correct
14 Correct 113 ms 412 KB Output is correct
15 Correct 123 ms 416 KB Output is correct
16 Correct 318 ms 416 KB Output is correct
17 Correct 61 ms 420 KB Output is correct
18 Correct 11 ms 428 KB Output is correct
19 Correct 17 ms 436 KB Output is correct
20 Correct 78 ms 416 KB Output is correct
21 Correct 151 ms 412 KB Output is correct
22 Correct 30 ms 15936 KB Output is correct
23 Correct 42 ms 15944 KB Output is correct
24 Correct 18 ms 15924 KB Output is correct
25 Correct 206 ms 15932 KB Output is correct
26 Correct 226 ms 340 KB Output is correct
27 Correct 121 ms 416 KB Output is correct
28 Correct 141 ms 416 KB Output is correct
29 Correct 229 ms 412 KB Output is correct
30 Correct 112 ms 416 KB Output is correct
31 Correct 13 ms 340 KB Output is correct
32 Correct 17 ms 436 KB Output is correct
33 Correct 83 ms 340 KB Output is correct
34 Correct 145 ms 416 KB Output is correct
35 Correct 1008 ms 412 KB Output is correct
36 Correct 454 ms 416 KB Output is correct
37 Correct 640 ms 416 KB Output is correct
38 Correct 977 ms 416 KB Output is correct
39 Correct 593 ms 416 KB Output is correct
40 Correct 267 ms 15940 KB Output is correct
41 Correct 229 ms 416 KB Output is correct
42 Correct 117 ms 416 KB Output is correct
43 Correct 120 ms 416 KB Output is correct
44 Correct 234 ms 416 KB Output is correct
45 Correct 63 ms 340 KB Output is correct
46 Correct 12 ms 340 KB Output is correct
47 Correct 16 ms 432 KB Output is correct
48 Correct 86 ms 420 KB Output is correct
49 Correct 184 ms 412 KB Output is correct
50 Correct 2498 ms 15932 KB Output is correct
51 Correct 2805 ms 15924 KB Output is correct
52 Incorrect 0 ms 212 KB Output isn't correct
53 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15928 KB Output is correct
2 Correct 236 ms 420 KB Output is correct
3 Correct 113 ms 412 KB Output is correct
4 Correct 123 ms 416 KB Output is correct
5 Correct 318 ms 416 KB Output is correct
6 Correct 61 ms 420 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 78 ms 416 KB Output is correct
10 Correct 151 ms 412 KB Output is correct
11 Correct 267 ms 15940 KB Output is correct
12 Correct 229 ms 416 KB Output is correct
13 Correct 117 ms 416 KB Output is correct
14 Correct 120 ms 416 KB Output is correct
15 Correct 234 ms 416 KB Output is correct
16 Correct 63 ms 340 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 16 ms 432 KB Output is correct
19 Correct 86 ms 420 KB Output is correct
20 Correct 184 ms 412 KB Output is correct
21 Correct 2498 ms 15932 KB Output is correct
22 Correct 2805 ms 15924 KB Output is correct
23 Incorrect 0 ms 212 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 37 ms 15928 KB Output is correct
3 Correct 16 ms 15948 KB Output is correct
4 Correct 180 ms 15928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2024 ms 16056 KB Output is correct
7 Correct 1905 ms 16056 KB Output is correct
8 Correct 1893 ms 16064 KB Output is correct
9 Correct 1969 ms 16160 KB Output is correct
10 Correct 1949 ms 15924 KB Output is correct
11 Correct 1889 ms 15928 KB Output is correct
12 Correct 25 ms 15828 KB Output is correct
13 Correct 38 ms 15928 KB Output is correct
14 Correct 20 ms 15944 KB Output is correct
15 Correct 177 ms 15932 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1678 ms 16052 KB Output is correct
18 Correct 1825 ms 15928 KB Output is correct
19 Correct 1844 ms 16048 KB Output is correct
20 Correct 1710 ms 16160 KB Output is correct
21 Correct 1783 ms 15928 KB Output is correct
22 Correct 1862 ms 15928 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3861 ms 16892 KB Output is correct
25 Correct 3175 ms 16368 KB Output is correct
26 Correct 4146 ms 17860 KB Output is correct
27 Correct 4528 ms 17848 KB Output is correct
28 Correct 3592 ms 15928 KB Output is correct
29 Correct 4844 ms 15928 KB Output is correct
30 Correct 224 ms 15928 KB Output is correct
31 Correct 236 ms 420 KB Output is correct
32 Correct 113 ms 412 KB Output is correct
33 Correct 123 ms 416 KB Output is correct
34 Correct 318 ms 416 KB Output is correct
35 Correct 61 ms 420 KB Output is correct
36 Correct 11 ms 428 KB Output is correct
37 Correct 17 ms 436 KB Output is correct
38 Correct 78 ms 416 KB Output is correct
39 Correct 151 ms 412 KB Output is correct
40 Correct 30 ms 15936 KB Output is correct
41 Correct 42 ms 15944 KB Output is correct
42 Correct 18 ms 15924 KB Output is correct
43 Correct 206 ms 15932 KB Output is correct
44 Correct 226 ms 340 KB Output is correct
45 Correct 121 ms 416 KB Output is correct
46 Correct 141 ms 416 KB Output is correct
47 Correct 229 ms 412 KB Output is correct
48 Correct 112 ms 416 KB Output is correct
49 Correct 13 ms 340 KB Output is correct
50 Correct 17 ms 436 KB Output is correct
51 Correct 83 ms 340 KB Output is correct
52 Correct 145 ms 416 KB Output is correct
53 Correct 1008 ms 412 KB Output is correct
54 Correct 454 ms 416 KB Output is correct
55 Correct 640 ms 416 KB Output is correct
56 Correct 977 ms 416 KB Output is correct
57 Correct 593 ms 416 KB Output is correct
58 Correct 267 ms 15940 KB Output is correct
59 Correct 229 ms 416 KB Output is correct
60 Correct 117 ms 416 KB Output is correct
61 Correct 120 ms 416 KB Output is correct
62 Correct 234 ms 416 KB Output is correct
63 Correct 63 ms 340 KB Output is correct
64 Correct 12 ms 340 KB Output is correct
65 Correct 16 ms 432 KB Output is correct
66 Correct 86 ms 420 KB Output is correct
67 Correct 184 ms 412 KB Output is correct
68 Correct 2498 ms 15932 KB Output is correct
69 Correct 2805 ms 15924 KB Output is correct
70 Incorrect 0 ms 212 KB Output isn't correct
71 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15928 KB Output is correct
2 Correct 236 ms 420 KB Output is correct
3 Correct 113 ms 412 KB Output is correct
4 Correct 123 ms 416 KB Output is correct
5 Correct 318 ms 416 KB Output is correct
6 Correct 61 ms 420 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 78 ms 416 KB Output is correct
10 Correct 151 ms 412 KB Output is correct
11 Correct 267 ms 15940 KB Output is correct
12 Correct 229 ms 416 KB Output is correct
13 Correct 117 ms 416 KB Output is correct
14 Correct 120 ms 416 KB Output is correct
15 Correct 234 ms 416 KB Output is correct
16 Correct 63 ms 340 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 16 ms 432 KB Output is correct
19 Correct 86 ms 420 KB Output is correct
20 Correct 184 ms 412 KB Output is correct
21 Correct 2498 ms 15932 KB Output is correct
22 Correct 2805 ms 15924 KB Output is correct
23 Incorrect 0 ms 212 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 37 ms 15928 KB Output is correct
3 Correct 16 ms 15948 KB Output is correct
4 Correct 180 ms 15928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2024 ms 16056 KB Output is correct
7 Correct 1905 ms 16056 KB Output is correct
8 Correct 1893 ms 16064 KB Output is correct
9 Correct 1969 ms 16160 KB Output is correct
10 Correct 1949 ms 15924 KB Output is correct
11 Correct 1889 ms 15928 KB Output is correct
12 Correct 25 ms 15828 KB Output is correct
13 Correct 38 ms 15928 KB Output is correct
14 Correct 20 ms 15944 KB Output is correct
15 Correct 177 ms 15932 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1678 ms 16052 KB Output is correct
18 Correct 1825 ms 15928 KB Output is correct
19 Correct 1844 ms 16048 KB Output is correct
20 Correct 1710 ms 16160 KB Output is correct
21 Correct 1783 ms 15928 KB Output is correct
22 Correct 1862 ms 15928 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3861 ms 16892 KB Output is correct
25 Correct 3175 ms 16368 KB Output is correct
26 Correct 4146 ms 17860 KB Output is correct
27 Correct 4528 ms 17848 KB Output is correct
28 Correct 3592 ms 15928 KB Output is correct
29 Correct 4844 ms 15928 KB Output is correct
30 Correct 224 ms 15928 KB Output is correct
31 Correct 236 ms 420 KB Output is correct
32 Correct 113 ms 412 KB Output is correct
33 Correct 123 ms 416 KB Output is correct
34 Correct 318 ms 416 KB Output is correct
35 Correct 61 ms 420 KB Output is correct
36 Correct 11 ms 428 KB Output is correct
37 Correct 17 ms 436 KB Output is correct
38 Correct 78 ms 416 KB Output is correct
39 Correct 151 ms 412 KB Output is correct
40 Correct 30 ms 15936 KB Output is correct
41 Correct 42 ms 15944 KB Output is correct
42 Correct 18 ms 15924 KB Output is correct
43 Correct 206 ms 15932 KB Output is correct
44 Correct 226 ms 340 KB Output is correct
45 Correct 121 ms 416 KB Output is correct
46 Correct 141 ms 416 KB Output is correct
47 Correct 229 ms 412 KB Output is correct
48 Correct 112 ms 416 KB Output is correct
49 Correct 13 ms 340 KB Output is correct
50 Correct 17 ms 436 KB Output is correct
51 Correct 83 ms 340 KB Output is correct
52 Correct 145 ms 416 KB Output is correct
53 Correct 1008 ms 412 KB Output is correct
54 Correct 454 ms 416 KB Output is correct
55 Correct 640 ms 416 KB Output is correct
56 Correct 977 ms 416 KB Output is correct
57 Correct 593 ms 416 KB Output is correct
58 Correct 267 ms 15940 KB Output is correct
59 Correct 229 ms 416 KB Output is correct
60 Correct 117 ms 416 KB Output is correct
61 Correct 120 ms 416 KB Output is correct
62 Correct 234 ms 416 KB Output is correct
63 Correct 63 ms 340 KB Output is correct
64 Correct 12 ms 340 KB Output is correct
65 Correct 16 ms 432 KB Output is correct
66 Correct 86 ms 420 KB Output is correct
67 Correct 184 ms 412 KB Output is correct
68 Correct 2498 ms 15932 KB Output is correct
69 Correct 2805 ms 15924 KB Output is correct
70 Incorrect 0 ms 212 KB Output isn't correct
71 Halted 0 ms 0 KB -