oj.uz

답안 #500647

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

#define N	5000
#define INF	0x3f3f3f3f3f3f3f3fLL

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

long long eval(long long a, long long b, long long c) { return b - a * c; }

int main() {
	static int aa[N], ll[N], rr[N], tt[N];
	static long long dp[N][N * 2 + 1], dq[N][N * 2 + 1], dr[N * 2 + 1], qu[N * 2 + 1];
	int n, i, j, k, head, cnt;
	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);
			head = cnt = 0;
			for (k = 0; k <= n * 2; k++) {
				if (dp[i][k] <= i * 2) {
					while (cnt && eval(qu[head + cnt - 1], dp[i][qu[head + cnt - 1]], tt[i]) >= eval(k, dp[i][k], tt[i]))
						cnt--;
					qu[head + cnt++] = k;
				}
				while (cnt && k - qu[head] >= aa[i])
					head++, cnt--;
				dr[k] = cnt == 0 ? INF : eval(qu[head], dp[i][qu[head]], tt[i]) + (long long) tt[i] * k;
			}
			for (k = 0; k <= n * 2; k++)
				dp[i][k] = dr[k];
			for (k = 0; k <= n * 2; k++) {
				long long 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++) {
				long long 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:18:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
tortoise.c:20:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   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 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 460 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 416 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 1 ms 460 KB Output is correct
19 Correct 0 ms 460 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 460 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 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 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 460 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 416 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 1 ms 460 KB Output is correct
19 Correct 0 ms 460 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 460 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 4300 KB Output is correct
28 Correct 3 ms 5324 KB Output is correct
29 Correct 2 ms 4940 KB Output is correct
30 Correct 2 ms 4428 KB Output is correct
31 Correct 3 ms 5452 KB Output is correct
32 Correct 2 ms 3532 KB Output is correct
33 Correct 3 ms 4812 KB Output is correct
34 Correct 2 ms 4384 KB Output is correct
35 Correct 3 ms 5580 KB Output is correct
36 Correct 3 ms 5580 KB Output is correct
37 Correct 3 ms 5580 KB Output is correct
38 Correct 3 ms 5540 KB Output is correct
39 Correct 3 ms 5536 KB Output is correct
40 Correct 3 ms 5536 KB Output is correct
41 Correct 3 ms 5580 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 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 460 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 416 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 1 ms 460 KB Output is correct
19 Correct 0 ms 460 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 460 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 4300 KB Output is correct
28 Correct 3 ms 5324 KB Output is correct
29 Correct 2 ms 4940 KB Output is correct
30 Correct 2 ms 4428 KB Output is correct
31 Correct 3 ms 5452 KB Output is correct
32 Correct 2 ms 3532 KB Output is correct
33 Correct 3 ms 4812 KB Output is correct
34 Correct 2 ms 4384 KB Output is correct
35 Correct 3 ms 5580 KB Output is correct
36 Correct 3 ms 5580 KB Output is correct
37 Correct 3 ms 5580 KB Output is correct
38 Correct 3 ms 5540 KB Output is correct
39 Correct 3 ms 5536 KB Output is correct
40 Correct 3 ms 5536 KB Output is correct
41 Correct 3 ms 5580 KB Output is correct
42 Correct 2 ms 3276 KB Output is correct
43 Correct 2 ms 3276 KB Output is correct
44 Correct 2 ms 4044 KB Output is correct
45 Correct 2 ms 5068 KB Output is correct
46 Correct 2 ms 3788 KB Output is correct
47 Correct 2 ms 3276 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 2 ms 3740 KB Output is correct
50 Correct 3 ms 4892 KB Output is correct
51 Correct 3 ms 5196 KB Output is correct
52 Correct 2 ms 3404 KB Output is correct
53 Correct 3 ms 5072 KB Output is correct
54 Correct 3 ms 5068 KB Output is correct
55 Correct 3 ms 4428 KB Output is correct
56 Correct 2 ms 5452 KB Output is correct
57 Correct 2 ms 3352 KB Output is correct
58 Correct 3 ms 4940 KB Output is correct
59 Correct 2 ms 3660 KB Output is correct
60 Correct 3 ms 4556 KB Output is correct
61 Correct 2 ms 4812 KB Output is correct
62 Correct 3 ms 4892 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 460 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 416 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 1 ms 460 KB Output is correct
19 Correct 0 ms 460 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 460 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 4300 KB Output is correct
28 Correct 3 ms 5324 KB Output is correct
29 Correct 2 ms 4940 KB Output is correct
30 Correct 2 ms 4428 KB Output is correct
31 Correct 3 ms 5452 KB Output is correct
32 Correct 2 ms 3532 KB Output is correct
33 Correct 3 ms 4812 KB Output is correct
34 Correct 2 ms 4384 KB Output is correct
35 Correct 3 ms 5580 KB Output is correct
36 Correct 3 ms 5580 KB Output is correct
37 Correct 3 ms 5580 KB Output is correct
38 Correct 3 ms 5540 KB Output is correct
39 Correct 3 ms 5536 KB Output is correct
40 Correct 3 ms 5536 KB Output is correct
41 Correct 3 ms 5580 KB Output is correct
42 Correct 2 ms 3276 KB Output is correct
43 Correct 2 ms 3276 KB Output is correct
44 Correct 2 ms 4044 KB Output is correct
45 Correct 2 ms 5068 KB Output is correct
46 Correct 2 ms 3788 KB Output is correct
47 Correct 2 ms 3276 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 2 ms 3740 KB Output is correct
50 Correct 3 ms 4892 KB Output is correct
51 Correct 3 ms 5196 KB Output is correct
52 Correct 2 ms 3404 KB Output is correct
53 Correct 3 ms 5072 KB Output is correct
54 Correct 3 ms 5068 KB Output is correct
55 Correct 3 ms 4428 KB Output is correct
56 Correct 2 ms 5452 KB Output is correct
57 Correct 2 ms 3352 KB Output is correct
58 Correct 3 ms 4940 KB Output is correct
59 Correct 2 ms 3660 KB Output is correct
60 Correct 3 ms 4556 KB Output is correct
61 Correct 2 ms 4812 KB Output is correct
62 Correct 3 ms 4892 KB Output is correct
63 Runtime error 212 ms 524292 KB Execution killed with signal 9
64 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 460 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 460 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 416 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 1 ms 460 KB Output is correct
19 Correct 0 ms 460 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 460 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 4300 KB Output is correct
28 Correct 3 ms 5324 KB Output is correct
29 Correct 2 ms 4940 KB Output is correct
30 Correct 2 ms 4428 KB Output is correct
31 Correct 3 ms 5452 KB Output is correct
32 Correct 2 ms 3532 KB Output is correct
33 Correct 3 ms 4812 KB Output is correct
34 Correct 2 ms 4384 KB Output is correct
35 Correct 3 ms 5580 KB Output is correct
36 Correct 3 ms 5580 KB Output is correct
37 Correct 3 ms 5580 KB Output is correct
38 Correct 3 ms 5540 KB Output is correct
39 Correct 3 ms 5536 KB Output is correct
40 Correct 3 ms 5536 KB Output is correct
41 Correct 3 ms 5580 KB Output is correct
42 Correct 2 ms 3276 KB Output is correct
43 Correct 2 ms 3276 KB Output is correct
44 Correct 2 ms 4044 KB Output is correct
45 Correct 2 ms 5068 KB Output is correct
46 Correct 2 ms 3788 KB Output is correct
47 Correct 2 ms 3276 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 2 ms 3740 KB Output is correct
50 Correct 3 ms 4892 KB Output is correct
51 Correct 3 ms 5196 KB Output is correct
52 Correct 2 ms 3404 KB Output is correct
53 Correct 3 ms 5072 KB Output is correct
54 Correct 3 ms 5068 KB Output is correct
55 Correct 3 ms 4428 KB Output is correct
56 Correct 2 ms 5452 KB Output is correct
57 Correct 2 ms 3352 KB Output is correct
58 Correct 3 ms 4940 KB Output is correct
59 Correct 2 ms 3660 KB Output is correct
60 Correct 3 ms 4556 KB Output is correct
61 Correct 2 ms 4812 KB Output is correct
62 Correct 3 ms 4892 KB Output is correct
63 Runtime error 212 ms 524292 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -