oj.uz

답안 #590179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590179 2022-07-05T15:53:28 Z rainboy Uplifting Excursion (BOI22_vault) C
30 / 100
 5000 ms 4396 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, s1, s2;
	long long s, s0, 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)
				for (s2 = 0; s2 <= n * n; s2++)
					if (dq[a][s2] != -INF) {
						s = s0 - (s1 - n * n) + s2;
						if (a == 0) {
							if (s == s_)
								ans = max(ans, k0 + dp[s1] + dq[a][s2] + kk[n + a]);
						} else {
							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:102:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |  scanf("%d%lld", &n, &s);
      |  ^~~~~~~~~~~~~~~~~~~~~~~
vault.c:104:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |   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 5088 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 5088 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 202 ms 532 KB Output is correct
3 Correct 109 ms 532 KB Output is correct
4 Correct 109 ms 536 KB Output is correct
5 Correct 216 ms 532 KB Output is correct
6 Correct 39 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 77 ms 528 KB Output is correct
10 Correct 136 ms 528 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 202 ms 532 KB Output is correct
3 Correct 109 ms 532 KB Output is correct
4 Correct 109 ms 536 KB Output is correct
5 Correct 216 ms 532 KB Output is correct
6 Correct 39 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 77 ms 528 KB Output is correct
10 Correct 136 ms 528 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 1 ms 340 KB Output is correct
15 Correct 207 ms 528 KB Output is correct
16 Correct 108 ms 532 KB Output is correct
17 Correct 116 ms 532 KB Output is correct
18 Correct 209 ms 544 KB Output is correct
19 Correct 39 ms 468 KB Output is correct
20 Correct 10 ms 468 KB Output is correct
21 Correct 17 ms 552 KB Output is correct
22 Correct 69 ms 528 KB Output is correct
23 Correct 149 ms 532 KB Output is correct
24 Correct 906 ms 532 KB Output is correct
25 Correct 404 ms 468 KB Output is correct
26 Correct 594 ms 536 KB Output is correct
27 Correct 897 ms 532 KB Output is correct
28 Correct 525 ms 532 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 202 ms 532 KB Output is correct
3 Correct 109 ms 532 KB Output is correct
4 Correct 109 ms 536 KB Output is correct
5 Correct 216 ms 532 KB Output is correct
6 Correct 39 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 77 ms 528 KB Output is correct
10 Correct 136 ms 528 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 219 ms 528 KB Output is correct
13 Correct 96 ms 532 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 214 ms 532 KB Output is correct
16 Correct 44 ms 532 KB Output is correct
17 Correct 12 ms 548 KB Output is correct
18 Correct 15 ms 556 KB Output is correct
19 Correct 69 ms 468 KB Output is correct
20 Correct 129 ms 532 KB Output is correct
21 Correct 118 ms 980 KB Output is correct
22 Correct 138 ms 1036 KB Output is correct
23 Correct 3079 ms 1028 KB Output is correct
24 Correct 2509 ms 1028 KB Output is correct
25 Correct 2947 ms 1036 KB Output is correct
26 Correct 1823 ms 1028 KB Output is correct
27 Correct 522 ms 1032 KB Output is correct
28 Correct 2250 ms 1032 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 5088 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 202 ms 532 KB Output is correct
3 Correct 109 ms 532 KB Output is correct
4 Correct 109 ms 536 KB Output is correct
5 Correct 216 ms 532 KB Output is correct
6 Correct 39 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 77 ms 528 KB Output is correct
10 Correct 136 ms 528 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 219 ms 528 KB Output is correct
13 Correct 96 ms 532 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 214 ms 532 KB Output is correct
16 Correct 44 ms 532 KB Output is correct
17 Correct 12 ms 548 KB Output is correct
18 Correct 15 ms 556 KB Output is correct
19 Correct 69 ms 468 KB Output is correct
20 Correct 129 ms 532 KB Output is correct
21 Correct 118 ms 980 KB Output is correct
22 Correct 138 ms 1036 KB Output is correct
23 Correct 3079 ms 1028 KB Output is correct
24 Correct 2509 ms 1028 KB Output is correct
25 Correct 2947 ms 1036 KB Output is correct
26 Correct 1823 ms 1028 KB Output is correct
27 Correct 522 ms 1032 KB Output is correct
28 Correct 2250 ms 1032 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 212 ms 468 KB Output is correct
31 Correct 95 ms 532 KB Output is correct
32 Correct 104 ms 528 KB Output is correct
33 Correct 221 ms 532 KB Output is correct
34 Correct 43 ms 468 KB Output is correct
35 Correct 10 ms 548 KB Output is correct
36 Correct 15 ms 548 KB Output is correct
37 Correct 69 ms 540 KB Output is correct
38 Correct 135 ms 532 KB Output is correct
39 Correct 99 ms 980 KB Output is correct
40 Correct 141 ms 1028 KB Output is correct
41 Correct 3061 ms 1028 KB Output is correct
42 Correct 2506 ms 1032 KB Output is correct
43 Correct 2901 ms 1032 KB Output is correct
44 Correct 1790 ms 1036 KB Output is correct
45 Correct 518 ms 1032 KB Output is correct
46 Correct 2231 ms 1032 KB Output is correct
47 Correct 2933 ms 4392 KB Output is correct
48 Correct 3477 ms 4396 KB Output is correct
49 Execution timed out 5039 ms 4388 KB Time limit exceeded
50 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 5088 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 202 ms 532 KB Output is correct
3 Correct 109 ms 532 KB Output is correct
4 Correct 109 ms 536 KB Output is correct
5 Correct 216 ms 532 KB Output is correct
6 Correct 39 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 77 ms 528 KB Output is correct
10 Correct 136 ms 528 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 219 ms 528 KB Output is correct
13 Correct 96 ms 532 KB Output is correct
14 Correct 101 ms 468 KB Output is correct
15 Correct 214 ms 532 KB Output is correct
16 Correct 44 ms 532 KB Output is correct
17 Correct 12 ms 548 KB Output is correct
18 Correct 15 ms 556 KB Output is correct
19 Correct 69 ms 468 KB Output is correct
20 Correct 129 ms 532 KB Output is correct
21 Correct 118 ms 980 KB Output is correct
22 Correct 138 ms 1036 KB Output is correct
23 Correct 3079 ms 1028 KB Output is correct
24 Correct 2509 ms 1028 KB Output is correct
25 Correct 2947 ms 1036 KB Output is correct
26 Correct 1823 ms 1028 KB Output is correct
27 Correct 522 ms 1032 KB Output is correct
28 Correct 2250 ms 1032 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 212 ms 468 KB Output is correct
31 Correct 95 ms 532 KB Output is correct
32 Correct 104 ms 528 KB Output is correct
33 Correct 221 ms 532 KB Output is correct
34 Correct 43 ms 468 KB Output is correct
35 Correct 10 ms 548 KB Output is correct
36 Correct 15 ms 548 KB Output is correct
37 Correct 69 ms 540 KB Output is correct
38 Correct 135 ms 532 KB Output is correct
39 Correct 99 ms 980 KB Output is correct
40 Correct 141 ms 1028 KB Output is correct
41 Correct 3061 ms 1028 KB Output is correct
42 Correct 2506 ms 1032 KB Output is correct
43 Correct 2901 ms 1032 KB Output is correct
44 Correct 1790 ms 1036 KB Output is correct
45 Correct 518 ms 1032 KB Output is correct
46 Correct 2231 ms 1032 KB Output is correct
47 Correct 2933 ms 4392 KB Output is correct
48 Correct 3477 ms 4396 KB Output is correct
49 Execution timed out 5039 ms 4388 KB Time limit exceeded
50 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 5088 ms 980 KB Time limit exceeded
6 Halted 0 ms 0 KB -