oj.uz

답안 #590185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590185 2022-07-05T16:08:17 Z rainboy Uplifting Excursion (BOI22_vault) C
30 / 100
 5000 ms 4288 KB 
#include <stdio.h>
#include <string.h>

#define N	100
#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[N * N * 2 + 1], qu[N * N * 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[N * N * 2 + 1], dq[N + 1][N * N + 1];
	int a;
	long long s, s0, s1, s2, k, k0, ans;

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

int main() {
	static long long kk[N * 2 + 1];
	int n, a, r;
	long long s, ans, tmp;

	scanf("%d%lld", &n, &s);
	for (a = -n; a <= n; a++)
		scanf("%lld", &kk[n + a]);
	ans = -INF;
	for (r = 0; r < 2; r++) {
		ans = max(ans, solve(kk, n, s));
		for (a = 1; a <= n; a++)
			tmp = kk[n - a], kk[n - a] = kk[n + a], kk[n + a] = tmp;
		s = -s;
	}
	if (ans == -INF)
		printf("impossible\n");
	else
		printf("%lld\n", ans);
	return 0;
}

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 5061 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 5061 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 224 ms 536 KB Output is correct
3 Correct 121 ms 532 KB Output is correct
4 Correct 133 ms 532 KB Output is correct
5 Correct 226 ms 540 KB Output is correct
6 Correct 48 ms 468 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 105 ms 468 KB Output is correct
10 Correct 146 ms 468 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 224 ms 536 KB Output is correct
3 Correct 121 ms 532 KB Output is correct
4 Correct 133 ms 532 KB Output is correct
5 Correct 226 ms 540 KB Output is correct
6 Correct 48 ms 468 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 105 ms 468 KB Output is correct
10 Correct 146 ms 468 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 218 ms 528 KB Output is correct
16 Correct 122 ms 528 KB Output is correct
17 Correct 115 ms 528 KB Output is correct
18 Correct 229 ms 528 KB Output is correct
19 Correct 51 ms 468 KB Output is correct
20 Correct 16 ms 468 KB Output is correct
21 Correct 24 ms 556 KB Output is correct
22 Correct 107 ms 468 KB Output is correct
23 Correct 151 ms 532 KB Output is correct
24 Correct 914 ms 528 KB Output is correct
25 Correct 392 ms 532 KB Output is correct
26 Correct 604 ms 532 KB Output is correct
27 Correct 882 ms 532 KB Output is correct
28 Correct 533 ms 536 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 224 ms 536 KB Output is correct
3 Correct 121 ms 532 KB Output is correct
4 Correct 133 ms 532 KB Output is correct
5 Correct 226 ms 540 KB Output is correct
6 Correct 48 ms 468 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 105 ms 468 KB Output is correct
10 Correct 146 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 220 ms 468 KB Output is correct
13 Correct 118 ms 536 KB Output is correct
14 Correct 114 ms 468 KB Output is correct
15 Correct 228 ms 528 KB Output is correct
16 Correct 54 ms 588 KB Output is correct
17 Correct 16 ms 468 KB Output is correct
18 Correct 25 ms 548 KB Output is correct
19 Correct 85 ms 468 KB Output is correct
20 Correct 155 ms 468 KB Output is correct
21 Correct 185 ms 1028 KB Output is correct
22 Correct 265 ms 1028 KB Output is correct
23 Correct 3211 ms 1036 KB Output is correct
24 Correct 2851 ms 1036 KB Output is correct
25 Correct 3238 ms 1028 KB Output is correct
26 Correct 2220 ms 1032 KB Output is correct
27 Correct 799 ms 1028 KB Output is correct
28 Correct 2780 ms 1036 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 5061 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 224 ms 536 KB Output is correct
3 Correct 121 ms 532 KB Output is correct
4 Correct 133 ms 532 KB Output is correct
5 Correct 226 ms 540 KB Output is correct
6 Correct 48 ms 468 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 105 ms 468 KB Output is correct
10 Correct 146 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 220 ms 468 KB Output is correct
13 Correct 118 ms 536 KB Output is correct
14 Correct 114 ms 468 KB Output is correct
15 Correct 228 ms 528 KB Output is correct
16 Correct 54 ms 588 KB Output is correct
17 Correct 16 ms 468 KB Output is correct
18 Correct 25 ms 548 KB Output is correct
19 Correct 85 ms 468 KB Output is correct
20 Correct 155 ms 468 KB Output is correct
21 Correct 185 ms 1028 KB Output is correct
22 Correct 265 ms 1028 KB Output is correct
23 Correct 3211 ms 1036 KB Output is correct
24 Correct 2851 ms 1036 KB Output is correct
25 Correct 3238 ms 1028 KB Output is correct
26 Correct 2220 ms 1032 KB Output is correct
27 Correct 799 ms 1028 KB Output is correct
28 Correct 2780 ms 1036 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 250 ms 528 KB Output is correct
31 Correct 141 ms 468 KB Output is correct
32 Correct 146 ms 468 KB Output is correct
33 Correct 254 ms 468 KB Output is correct
34 Correct 79 ms 528 KB Output is correct
35 Correct 21 ms 552 KB Output is correct
36 Correct 26 ms 556 KB Output is correct
37 Correct 96 ms 532 KB Output is correct
38 Correct 169 ms 532 KB Output is correct
39 Correct 216 ms 1032 KB Output is correct
40 Correct 295 ms 1032 KB Output is correct
41 Correct 3440 ms 1028 KB Output is correct
42 Correct 2805 ms 1032 KB Output is correct
43 Correct 3209 ms 1028 KB Output is correct
44 Correct 1985 ms 1028 KB Output is correct
45 Correct 702 ms 1032 KB Output is correct
46 Correct 2543 ms 1032 KB Output is correct
47 Execution timed out 5043 ms 4288 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 5061 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 224 ms 536 KB Output is correct
3 Correct 121 ms 532 KB Output is correct
4 Correct 133 ms 532 KB Output is correct
5 Correct 226 ms 540 KB Output is correct
6 Correct 48 ms 468 KB Output is correct
7 Correct 19 ms 468 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 105 ms 468 KB Output is correct
10 Correct 146 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 220 ms 468 KB Output is correct
13 Correct 118 ms 536 KB Output is correct
14 Correct 114 ms 468 KB Output is correct
15 Correct 228 ms 528 KB Output is correct
16 Correct 54 ms 588 KB Output is correct
17 Correct 16 ms 468 KB Output is correct
18 Correct 25 ms 548 KB Output is correct
19 Correct 85 ms 468 KB Output is correct
20 Correct 155 ms 468 KB Output is correct
21 Correct 185 ms 1028 KB Output is correct
22 Correct 265 ms 1028 KB Output is correct
23 Correct 3211 ms 1036 KB Output is correct
24 Correct 2851 ms 1036 KB Output is correct
25 Correct 3238 ms 1028 KB Output is correct
26 Correct 2220 ms 1032 KB Output is correct
27 Correct 799 ms 1028 KB Output is correct
28 Correct 2780 ms 1036 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 250 ms 528 KB Output is correct
31 Correct 141 ms 468 KB Output is correct
32 Correct 146 ms 468 KB Output is correct
33 Correct 254 ms 468 KB Output is correct
34 Correct 79 ms 528 KB Output is correct
35 Correct 21 ms 552 KB Output is correct
36 Correct 26 ms 556 KB Output is correct
37 Correct 96 ms 532 KB Output is correct
38 Correct 169 ms 532 KB Output is correct
39 Correct 216 ms 1032 KB Output is correct
40 Correct 295 ms 1032 KB Output is correct
41 Correct 3440 ms 1028 KB Output is correct
42 Correct 2805 ms 1032 KB Output is correct
43 Correct 3209 ms 1028 KB Output is correct
44 Correct 1985 ms 1028 KB Output is correct
45 Correct 702 ms 1032 KB Output is correct
46 Correct 2543 ms 1032 KB Output is correct
47 Execution timed out 5043 ms 4288 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 5061 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -