oj.uz

답안 #590175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590175 2022-07-05T15:43:06 Z rainboy Uplifting Excursion (BOI22_vault) C
40 / 100
 5000 ms 17864 KB 
#include <stdio.h>
#include <string.h>

#define N	100
#define S	(N * N * N)
#define N3	30
#define N4	50
#define S_	(N4 * N4)
#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 <= N4) {
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15940 KB Output is correct
2 Correct 41 ms 15852 KB Output is correct
3 Correct 22 ms 15892 KB Output is correct
4 Correct 214 ms 15940 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2403 ms 16064 KB Output is correct
7 Correct 2767 ms 15976 KB Output is correct
8 Correct 2452 ms 16060 KB Output is correct
9 Correct 2336 ms 16176 KB Output is correct
10 Correct 1875 ms 15932 KB Output is correct
11 Correct 1922 ms 15944 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15940 KB Output is correct
2 Correct 41 ms 15852 KB Output is correct
3 Correct 22 ms 15892 KB Output is correct
4 Correct 214 ms 15940 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2403 ms 16064 KB Output is correct
7 Correct 2767 ms 15976 KB Output is correct
8 Correct 2452 ms 16060 KB Output is correct
9 Correct 2336 ms 16176 KB Output is correct
10 Correct 1875 ms 15932 KB Output is correct
11 Correct 1922 ms 15944 KB Output is correct
12 Correct 26 ms 15828 KB Output is correct
13 Correct 35 ms 15828 KB Output is correct
14 Correct 17 ms 15956 KB Output is correct
15 Correct 190 ms 15940 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1869 ms 16060 KB Output is correct
18 Correct 1940 ms 16076 KB Output is correct
19 Correct 2578 ms 16060 KB Output is correct
20 Correct 2530 ms 16176 KB Output is correct
21 Correct 2361 ms 15948 KB Output is correct
22 Correct 1789 ms 15932 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3467 ms 16840 KB Output is correct
25 Correct 3415 ms 16376 KB Output is correct
26 Correct 4030 ms 17864 KB Output is correct
27 Correct 3918 ms 17852 KB Output is correct
28 Correct 3068 ms 15932 KB Output is correct
29 Correct 2684 ms 15936 KB Output is correct

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 15936 KB Output is correct
2 Correct 1317 ms 648 KB Output is correct
3 Correct 390 ms 648 KB Output is correct
4 Correct 555 ms 648 KB Output is correct
5 Correct 1452 ms 644 KB Output is correct
6 Correct 304 ms 644 KB Output is correct
7 Correct 56 ms 640 KB Output is correct
8 Correct 73 ms 644 KB Output is correct
9 Correct 376 ms 648 KB Output is correct
10 Correct 742 ms 644 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 15936 KB Output is correct
2 Correct 1317 ms 648 KB Output is correct
3 Correct 390 ms 648 KB Output is correct
4 Correct 555 ms 648 KB Output is correct
5 Correct 1452 ms 644 KB Output is correct
6 Correct 304 ms 644 KB Output is correct
7 Correct 56 ms 640 KB Output is correct
8 Correct 73 ms 644 KB Output is correct
9 Correct 376 ms 648 KB Output is correct
10 Correct 742 ms 644 KB Output is correct
11 Correct 24 ms 15956 KB Output is correct
12 Correct 35 ms 15912 KB Output is correct
13 Correct 15 ms 15956 KB Output is correct
14 Correct 160 ms 15956 KB Output is correct
15 Correct 1349 ms 648 KB Output is correct
16 Correct 388 ms 652 KB Output is correct
17 Correct 551 ms 656 KB Output is correct
18 Correct 1452 ms 648 KB Output is correct
19 Correct 283 ms 648 KB Output is correct
20 Correct 59 ms 596 KB Output is correct
21 Correct 63 ms 648 KB Output is correct
22 Correct 337 ms 648 KB Output is correct
23 Correct 724 ms 644 KB Output is correct
24 Execution timed out 5022 ms 596 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 15936 KB Output is correct
2 Correct 1317 ms 648 KB Output is correct
3 Correct 390 ms 648 KB Output is correct
4 Correct 555 ms 648 KB Output is correct
5 Correct 1452 ms 644 KB Output is correct
6 Correct 304 ms 644 KB Output is correct
7 Correct 56 ms 640 KB Output is correct
8 Correct 73 ms 644 KB Output is correct
9 Correct 376 ms 648 KB Output is correct
10 Correct 742 ms 644 KB Output is correct
11 Correct 182 ms 15936 KB Output is correct
12 Correct 1276 ms 648 KB Output is correct
13 Correct 423 ms 652 KB Output is correct
14 Correct 525 ms 652 KB Output is correct
15 Correct 1470 ms 644 KB Output is correct
16 Correct 291 ms 644 KB Output is correct
17 Correct 57 ms 640 KB Output is correct
18 Correct 60 ms 640 KB Output is correct
19 Correct 331 ms 644 KB Output is correct
20 Correct 734 ms 648 KB Output is correct
21 Correct 1621 ms 15932 KB Output is correct
22 Correct 1876 ms 15932 KB Output is correct
23 Correct 2923 ms 816 KB Output is correct
24 Correct 2480 ms 828 KB Output is correct
25 Correct 2909 ms 824 KB Output is correct
26 Correct 1592 ms 824 KB Output is correct
27 Correct 235 ms 828 KB Output is correct
28 Correct 2175 ms 824 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15940 KB Output is correct
2 Correct 41 ms 15852 KB Output is correct
3 Correct 22 ms 15892 KB Output is correct
4 Correct 214 ms 15940 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2403 ms 16064 KB Output is correct
7 Correct 2767 ms 15976 KB Output is correct
8 Correct 2452 ms 16060 KB Output is correct
9 Correct 2336 ms 16176 KB Output is correct
10 Correct 1875 ms 15932 KB Output is correct
11 Correct 1922 ms 15944 KB Output is correct
12 Correct 170 ms 15936 KB Output is correct
13 Correct 1317 ms 648 KB Output is correct
14 Correct 390 ms 648 KB Output is correct
15 Correct 555 ms 648 KB Output is correct
16 Correct 1452 ms 644 KB Output is correct
17 Correct 304 ms 644 KB Output is correct
18 Correct 56 ms 640 KB Output is correct
19 Correct 73 ms 644 KB Output is correct
20 Correct 376 ms 648 KB Output is correct
21 Correct 742 ms 644 KB Output is correct
22 Correct 24 ms 15956 KB Output is correct
23 Correct 35 ms 15912 KB Output is correct
24 Correct 15 ms 15956 KB Output is correct
25 Correct 160 ms 15956 KB Output is correct
26 Correct 1349 ms 648 KB Output is correct
27 Correct 388 ms 652 KB Output is correct
28 Correct 551 ms 656 KB Output is correct
29 Correct 1452 ms 648 KB Output is correct
30 Correct 283 ms 648 KB Output is correct
31 Correct 59 ms 596 KB Output is correct
32 Correct 63 ms 648 KB Output is correct
33 Correct 337 ms 648 KB Output is correct
34 Correct 724 ms 644 KB Output is correct
35 Execution timed out 5022 ms 596 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 15936 KB Output is correct
2 Correct 1317 ms 648 KB Output is correct
3 Correct 390 ms 648 KB Output is correct
4 Correct 555 ms 648 KB Output is correct
5 Correct 1452 ms 644 KB Output is correct
6 Correct 304 ms 644 KB Output is correct
7 Correct 56 ms 640 KB Output is correct
8 Correct 73 ms 644 KB Output is correct
9 Correct 376 ms 648 KB Output is correct
10 Correct 742 ms 644 KB Output is correct
11 Correct 182 ms 15936 KB Output is correct
12 Correct 1276 ms 648 KB Output is correct
13 Correct 423 ms 652 KB Output is correct
14 Correct 525 ms 652 KB Output is correct
15 Correct 1470 ms 644 KB Output is correct
16 Correct 291 ms 644 KB Output is correct
17 Correct 57 ms 640 KB Output is correct
18 Correct 60 ms 640 KB Output is correct
19 Correct 331 ms 644 KB Output is correct
20 Correct 734 ms 648 KB Output is correct
21 Correct 1621 ms 15932 KB Output is correct
22 Correct 1876 ms 15932 KB Output is correct
23 Correct 2923 ms 816 KB Output is correct
24 Correct 2480 ms 828 KB Output is correct
25 Correct 2909 ms 824 KB Output is correct
26 Correct 1592 ms 824 KB Output is correct
27 Correct 235 ms 828 KB Output is correct
28 Correct 2175 ms 824 KB Output is correct
29 Correct 168 ms 15956 KB Output is correct
30 Correct 1403 ms 656 KB Output is correct
31 Correct 476 ms 644 KB Output is correct
32 Correct 617 ms 648 KB Output is correct
33 Correct 1579 ms 644 KB Output is correct
34 Correct 324 ms 644 KB Output is correct
35 Correct 69 ms 596 KB Output is correct
36 Correct 64 ms 640 KB Output is correct
37 Correct 354 ms 644 KB Output is correct
38 Correct 802 ms 648 KB Output is correct
39 Correct 1732 ms 15932 KB Output is correct
40 Correct 2124 ms 15952 KB Output is correct
41 Correct 3047 ms 820 KB Output is correct
42 Correct 2487 ms 824 KB Output is correct
43 Correct 2920 ms 824 KB Output is correct
44 Correct 1558 ms 824 KB Output is correct
45 Correct 266 ms 820 KB Output is correct
46 Correct 2164 ms 820 KB Output is correct
47 Correct 3083 ms 15932 KB Output is correct
48 Correct 3163 ms 15940 KB Output is correct
49 Incorrect 1 ms 212 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15940 KB Output is correct
2 Correct 41 ms 15852 KB Output is correct
3 Correct 22 ms 15892 KB Output is correct
4 Correct 214 ms 15940 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2403 ms 16064 KB Output is correct
7 Correct 2767 ms 15976 KB Output is correct
8 Correct 2452 ms 16060 KB Output is correct
9 Correct 2336 ms 16176 KB Output is correct
10 Correct 1875 ms 15932 KB Output is correct
11 Correct 1922 ms 15944 KB Output is correct
12 Correct 26 ms 15828 KB Output is correct
13 Correct 35 ms 15828 KB Output is correct
14 Correct 17 ms 15956 KB Output is correct
15 Correct 190 ms 15940 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1869 ms 16060 KB Output is correct
18 Correct 1940 ms 16076 KB Output is correct
19 Correct 2578 ms 16060 KB Output is correct
20 Correct 2530 ms 16176 KB Output is correct
21 Correct 2361 ms 15948 KB Output is correct
22 Correct 1789 ms 15932 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3467 ms 16840 KB Output is correct
25 Correct 3415 ms 16376 KB Output is correct
26 Correct 4030 ms 17864 KB Output is correct
27 Correct 3918 ms 17852 KB Output is correct
28 Correct 3068 ms 15932 KB Output is correct
29 Correct 2684 ms 15936 KB Output is correct
30 Correct 170 ms 15936 KB Output is correct
31 Correct 1317 ms 648 KB Output is correct
32 Correct 390 ms 648 KB Output is correct
33 Correct 555 ms 648 KB Output is correct
34 Correct 1452 ms 644 KB Output is correct
35 Correct 304 ms 644 KB Output is correct
36 Correct 56 ms 640 KB Output is correct
37 Correct 73 ms 644 KB Output is correct
38 Correct 376 ms 648 KB Output is correct
39 Correct 742 ms 644 KB Output is correct
40 Correct 24 ms 15956 KB Output is correct
41 Correct 35 ms 15912 KB Output is correct
42 Correct 15 ms 15956 KB Output is correct
43 Correct 160 ms 15956 KB Output is correct
44 Correct 1349 ms 648 KB Output is correct
45 Correct 388 ms 652 KB Output is correct
46 Correct 551 ms 656 KB Output is correct
47 Correct 1452 ms 648 KB Output is correct
48 Correct 283 ms 648 KB Output is correct
49 Correct 59 ms 596 KB Output is correct
50 Correct 63 ms 648 KB Output is correct
51 Correct 337 ms 648 KB Output is correct
52 Correct 724 ms 644 KB Output is correct
53 Execution timed out 5022 ms 596 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 15936 KB Output is correct
2 Correct 1317 ms 648 KB Output is correct
3 Correct 390 ms 648 KB Output is correct
4 Correct 555 ms 648 KB Output is correct
5 Correct 1452 ms 644 KB Output is correct
6 Correct 304 ms 644 KB Output is correct
7 Correct 56 ms 640 KB Output is correct
8 Correct 73 ms 644 KB Output is correct
9 Correct 376 ms 648 KB Output is correct
10 Correct 742 ms 644 KB Output is correct
11 Correct 182 ms 15936 KB Output is correct
12 Correct 1276 ms 648 KB Output is correct
13 Correct 423 ms 652 KB Output is correct
14 Correct 525 ms 652 KB Output is correct
15 Correct 1470 ms 644 KB Output is correct
16 Correct 291 ms 644 KB Output is correct
17 Correct 57 ms 640 KB Output is correct
18 Correct 60 ms 640 KB Output is correct
19 Correct 331 ms 644 KB Output is correct
20 Correct 734 ms 648 KB Output is correct
21 Correct 1621 ms 15932 KB Output is correct
22 Correct 1876 ms 15932 KB Output is correct
23 Correct 2923 ms 816 KB Output is correct
24 Correct 2480 ms 828 KB Output is correct
25 Correct 2909 ms 824 KB Output is correct
26 Correct 1592 ms 824 KB Output is correct
27 Correct 235 ms 828 KB Output is correct
28 Correct 2175 ms 824 KB Output is correct
29 Correct 168 ms 15956 KB Output is correct
30 Correct 1403 ms 656 KB Output is correct
31 Correct 476 ms 644 KB Output is correct
32 Correct 617 ms 648 KB Output is correct
33 Correct 1579 ms 644 KB Output is correct
34 Correct 324 ms 644 KB Output is correct
35 Correct 69 ms 596 KB Output is correct
36 Correct 64 ms 640 KB Output is correct
37 Correct 354 ms 644 KB Output is correct
38 Correct 802 ms 648 KB Output is correct
39 Correct 1732 ms 15932 KB Output is correct
40 Correct 2124 ms 15952 KB Output is correct
41 Correct 3047 ms 820 KB Output is correct
42 Correct 2487 ms 824 KB Output is correct
43 Correct 2920 ms 824 KB Output is correct
44 Correct 1558 ms 824 KB Output is correct
45 Correct 266 ms 820 KB Output is correct
46 Correct 2164 ms 820 KB Output is correct
47 Correct 3083 ms 15932 KB Output is correct
48 Correct 3163 ms 15940 KB Output is correct
49 Incorrect 1 ms 212 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15940 KB Output is correct
2 Correct 41 ms 15852 KB Output is correct
3 Correct 22 ms 15892 KB Output is correct
4 Correct 214 ms 15940 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2403 ms 16064 KB Output is correct
7 Correct 2767 ms 15976 KB Output is correct
8 Correct 2452 ms 16060 KB Output is correct
9 Correct 2336 ms 16176 KB Output is correct
10 Correct 1875 ms 15932 KB Output is correct
11 Correct 1922 ms 15944 KB Output is correct
12 Correct 26 ms 15828 KB Output is correct
13 Correct 35 ms 15828 KB Output is correct
14 Correct 17 ms 15956 KB Output is correct
15 Correct 190 ms 15940 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1869 ms 16060 KB Output is correct
18 Correct 1940 ms 16076 KB Output is correct
19 Correct 2578 ms 16060 KB Output is correct
20 Correct 2530 ms 16176 KB Output is correct
21 Correct 2361 ms 15948 KB Output is correct
22 Correct 1789 ms 15932 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 3467 ms 16840 KB Output is correct
25 Correct 3415 ms 16376 KB Output is correct
26 Correct 4030 ms 17864 KB Output is correct
27 Correct 3918 ms 17852 KB Output is correct
28 Correct 3068 ms 15932 KB Output is correct
29 Correct 2684 ms 15936 KB Output is correct
30 Correct 170 ms 15936 KB Output is correct
31 Correct 1317 ms 648 KB Output is correct
32 Correct 390 ms 648 KB Output is correct
33 Correct 555 ms 648 KB Output is correct
34 Correct 1452 ms 644 KB Output is correct
35 Correct 304 ms 644 KB Output is correct
36 Correct 56 ms 640 KB Output is correct
37 Correct 73 ms 644 KB Output is correct
38 Correct 376 ms 648 KB Output is correct
39 Correct 742 ms 644 KB Output is correct
40 Correct 24 ms 15956 KB Output is correct
41 Correct 35 ms 15912 KB Output is correct
42 Correct 15 ms 15956 KB Output is correct
43 Correct 160 ms 15956 KB Output is correct
44 Correct 1349 ms 648 KB Output is correct
45 Correct 388 ms 652 KB Output is correct
46 Correct 551 ms 656 KB Output is correct
47 Correct 1452 ms 648 KB Output is correct
48 Correct 283 ms 648 KB Output is correct
49 Correct 59 ms 596 KB Output is correct
50 Correct 63 ms 648 KB Output is correct
51 Correct 337 ms 648 KB Output is correct
52 Correct 724 ms 644 KB Output is correct
53 Execution timed out 5022 ms 596 KB Time limit exceeded
54 Halted 0 ms 0 KB -