oj.uz

답안 #500644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500644 2021-12-31T16:19:42 Z rainboy Tortoise (CEOI21_tortoise) C
48 / 100
 3000 ms 391620 KB 
#include <stdio.h>
#include <string.h>

#define N	5000
#define INF	0x3f3f3f3f

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

int main() {
	static int aa[N], ll[N], rr[N], tt[N], dp[N][N * 2 + 1], dq[N][N * 2 + 1];
	int n, i, j, k, k_;
	long long ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 0; i < n; i++) {
		for (j = i - 1; j >= 0; j--)
			if (aa[j] == -1)
				break;
		ll[i] = j;
		for (j = i + 1; j < n; j++)
			if (aa[j] == -1)
				break;
		rr[i] = j;
		tt[i] = min(ll[i] == -1 ? INF : i - ll[i], rr[i] == n ? INF : rr[i] - i) * 2;
	}
	for (i = 0; i < n; i++) {
		memset(dp[i], 0x3f, (n * 2 + 1) * sizeof *dp[i]);
		memset(dq[i], 0x3f, (n * 2 + 1) * sizeof *dq[i]);
	}
	ans = 0;
	for (i = 0; i < n; i++)
		if (aa[i] > 0) {
			for (k = 0; k <= n * 2; k++) {
				if ((j = ll[i]) >= 0)
					dp[i][k] = min(dp[i][k], dq[j][k] + i - j);
				if ((j = rr[i]) < n)
					dp[i][k] = min(dp[i][k], dq[j][k] + j - i);
			}
			dp[i][1] = min(dp[i][1], i);
			for (k = n * 2; k >= 0; k--) {
				int t = dp[i][k];

				if (t > i * 2)
					continue;
				for (k_ = k + 1; k_ <= n * 2 && k_ - k < aa[i]; k_++)
					dp[i][k_] = min(dp[i][k_], t + tt[i] * (k_ - k));
			}
			for (k = 0; k <= n * 2; k++) {
				int t = dp[i][k];

				if (t > i * 2)
					continue;
				ans = max(ans, k);
				if (k < n * 2) {
					if ((j = ll[i]) >= 0)
						dq[j][k + 1] = min(dq[j][k + 1], t + i - j);
					if ((j = rr[i]) < n)
						dq[j][k + 1] = min(dq[j][k + 1], t + j - i);
				}
			}
		} else
			for (k = 0; k <= n * 2; k++) {
				int t = dq[i][k];

				if (t == INF)
					continue;
				if ((j = rr[i]) < n)
					dq[j][k] = min(dq[j][k], t + j - i);
			}
	ans = -ans;
	for (i = 0; i < n; i++)
		if (aa[i] > 0)
			ans += aa[i];
	printf("%lld\n", ans);
	return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 3280 KB Output is correct
28 Correct 2 ms 3928 KB Output is correct
29 Correct 2 ms 3800 KB Output is correct
30 Correct 1 ms 3416 KB Output is correct
31 Correct 2 ms 4056 KB Output is correct
32 Correct 1 ms 2700 KB Output is correct
33 Correct 2 ms 3672 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 2 ms 4176 KB Output is correct
36 Correct 2 ms 4104 KB Output is correct
37 Correct 2 ms 4176 KB Output is correct
38 Correct 2 ms 4176 KB Output is correct
39 Correct 2 ms 4176 KB Output is correct
40 Correct 2 ms 4172 KB Output is correct
41 Correct 2 ms 4188 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 3280 KB Output is correct
28 Correct 2 ms 3928 KB Output is correct
29 Correct 2 ms 3800 KB Output is correct
30 Correct 1 ms 3416 KB Output is correct
31 Correct 2 ms 4056 KB Output is correct
32 Correct 1 ms 2700 KB Output is correct
33 Correct 2 ms 3672 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 2 ms 4176 KB Output is correct
36 Correct 2 ms 4104 KB Output is correct
37 Correct 2 ms 4176 KB Output is correct
38 Correct 2 ms 4176 KB Output is correct
39 Correct 2 ms 4176 KB Output is correct
40 Correct 2 ms 4172 KB Output is correct
41 Correct 2 ms 4188 KB Output is correct
42 Correct 1 ms 2508 KB Output is correct
43 Correct 1 ms 2636 KB Output is correct
44 Correct 1 ms 3020 KB Output is correct
45 Correct 2 ms 3788 KB Output is correct
46 Correct 1 ms 2892 KB Output is correct
47 Correct 1 ms 2508 KB Output is correct
48 Correct 2 ms 3404 KB Output is correct
49 Correct 1 ms 3020 KB Output is correct
50 Correct 2 ms 3660 KB Output is correct
51 Correct 3 ms 3928 KB Output is correct
52 Correct 1 ms 2636 KB Output is correct
53 Correct 3 ms 3788 KB Output is correct
54 Correct 4 ms 3788 KB Output is correct
55 Correct 5 ms 3404 KB Output is correct
56 Correct 2 ms 3996 KB Output is correct
57 Correct 2 ms 2636 KB Output is correct
58 Correct 3 ms 3748 KB Output is correct
59 Correct 1 ms 2892 KB Output is correct
60 Correct 2 ms 3404 KB Output is correct
61 Correct 2 ms 3604 KB Output is correct
62 Correct 2 ms 3660 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 3280 KB Output is correct
28 Correct 2 ms 3928 KB Output is correct
29 Correct 2 ms 3800 KB Output is correct
30 Correct 1 ms 3416 KB Output is correct
31 Correct 2 ms 4056 KB Output is correct
32 Correct 1 ms 2700 KB Output is correct
33 Correct 2 ms 3672 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 2 ms 4176 KB Output is correct
36 Correct 2 ms 4104 KB Output is correct
37 Correct 2 ms 4176 KB Output is correct
38 Correct 2 ms 4176 KB Output is correct
39 Correct 2 ms 4176 KB Output is correct
40 Correct 2 ms 4172 KB Output is correct
41 Correct 2 ms 4188 KB Output is correct
42 Correct 1 ms 2508 KB Output is correct
43 Correct 1 ms 2636 KB Output is correct
44 Correct 1 ms 3020 KB Output is correct
45 Correct 2 ms 3788 KB Output is correct
46 Correct 1 ms 2892 KB Output is correct
47 Correct 1 ms 2508 KB Output is correct
48 Correct 2 ms 3404 KB Output is correct
49 Correct 1 ms 3020 KB Output is correct
50 Correct 2 ms 3660 KB Output is correct
51 Correct 3 ms 3928 KB Output is correct
52 Correct 1 ms 2636 KB Output is correct
53 Correct 3 ms 3788 KB Output is correct
54 Correct 4 ms 3788 KB Output is correct
55 Correct 5 ms 3404 KB Output is correct
56 Correct 2 ms 3996 KB Output is correct
57 Correct 2 ms 2636 KB Output is correct
58 Correct 3 ms 3748 KB Output is correct
59 Correct 1 ms 2892 KB Output is correct
60 Correct 2 ms 3404 KB Output is correct
61 Correct 2 ms 3604 KB Output is correct
62 Correct 2 ms 3660 KB Output is correct
63 Correct 232 ms 386836 KB Output is correct
64 Correct 307 ms 389908 KB Output is correct
65 Correct 243 ms 390520 KB Output is correct
66 Correct 249 ms 386584 KB Output is correct
67 Correct 245 ms 391620 KB Output is correct
68 Correct 234 ms 384564 KB Output is correct
69 Correct 246 ms 390344 KB Output is correct
70 Correct 263 ms 390880 KB Output is correct
71 Execution timed out 3105 ms 390864 KB Time limit exceeded
72 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 3280 KB Output is correct
28 Correct 2 ms 3928 KB Output is correct
29 Correct 2 ms 3800 KB Output is correct
30 Correct 1 ms 3416 KB Output is correct
31 Correct 2 ms 4056 KB Output is correct
32 Correct 1 ms 2700 KB Output is correct
33 Correct 2 ms 3672 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 2 ms 4176 KB Output is correct
36 Correct 2 ms 4104 KB Output is correct
37 Correct 2 ms 4176 KB Output is correct
38 Correct 2 ms 4176 KB Output is correct
39 Correct 2 ms 4176 KB Output is correct
40 Correct 2 ms 4172 KB Output is correct
41 Correct 2 ms 4188 KB Output is correct
42 Correct 1 ms 2508 KB Output is correct
43 Correct 1 ms 2636 KB Output is correct
44 Correct 1 ms 3020 KB Output is correct
45 Correct 2 ms 3788 KB Output is correct
46 Correct 1 ms 2892 KB Output is correct
47 Correct 1 ms 2508 KB Output is correct
48 Correct 2 ms 3404 KB Output is correct
49 Correct 1 ms 3020 KB Output is correct
50 Correct 2 ms 3660 KB Output is correct
51 Correct 3 ms 3928 KB Output is correct
52 Correct 1 ms 2636 KB Output is correct
53 Correct 3 ms 3788 KB Output is correct
54 Correct 4 ms 3788 KB Output is correct
55 Correct 5 ms 3404 KB Output is correct
56 Correct 2 ms 3996 KB Output is correct
57 Correct 2 ms 2636 KB Output is correct
58 Correct 3 ms 3748 KB Output is correct
59 Correct 1 ms 2892 KB Output is correct
60 Correct 2 ms 3404 KB Output is correct
61 Correct 2 ms 3604 KB Output is correct
62 Correct 2 ms 3660 KB Output is correct
63 Correct 232 ms 386836 KB Output is correct
64 Correct 307 ms 389908 KB Output is correct
65 Correct 243 ms 390520 KB Output is correct
66 Correct 249 ms 386584 KB Output is correct
67 Correct 245 ms 391620 KB Output is correct
68 Correct 234 ms 384564 KB Output is correct
69 Correct 246 ms 390344 KB Output is correct
70 Correct 263 ms 390880 KB Output is correct
71 Execution timed out 3105 ms 390864 KB Time limit exceeded
72 Halted 0 ms 0 KB -