oj.uz

Submission #501280

# Submission time Handle Problem Language Result Execution time Memory
501280 2022-01-02T17:57:45 Z rainboy Tortoise (CEOI21_tortoise) C
48 / 100
 3000 ms 336 KB 
#include <assert.h>
#include <stdio.h>

#define N	5000
#define INF	0x3f3f3f3f

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

void is_it_concave(int *dp, int n) {
	int i;

	for (i = 1; i + 1 < n && dp[i + 1] != -INF; i++)
		assert(dp[i - 1] - dp[i] <= dp[i] - dp[i + 1]);
}

int main() {
	static int aa[N], dp[N * 2 + 1];
	int n, h, i, j, k, r, ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (k = 0; k <= n * 2; k++)
		dp[k] = -INF;
	dp[0] = 0;
	for (i = -1, j = 0; j <= n; j++)
		if (j == n || aa[j] == -1) {
			int d_, h_, i_, j_;

			d_ = -1, h_ = -1;
			for (h = i + 1; h <= j; h++)
				if (aa[h] > 0) {
					int d;

					d = INF;
					if (i != -1)
						d = min(d, h - i);
					if (j != n)
						d = min(d, j - h);
					if (d_ < d)
						d_ = d, h_ = h;
				}
			i_ = max(i, 0), j_ = min(j, n - 1);
			if (d_ == -1) {
				for (k = 0; k <= n * 2; k++)
					if (dp[k] != -INF)
						dp[k] += j_ - i_;
			} else {
				for (h = i + 1; h < h_; h++)
					for (r = 0; r < aa[h]; r++) {
						for (k = n * 2; k >= 0; k--)
							if (dp[k] != -INF && dp[k] + h - i >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] - (h - i) * 2);
						is_it_concave(dp, n * 2 + 1);
					}
				if (j == n || i >= 0 && h_ - i <= j - h_) {
					for (r = 0; r < aa[h_] - 1; r++) {
						for (k = n * 2; k >= 0; k--)
							if (dp[k] != -INF && dp[k] + h_ - i >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] - (h_ - i) * 2);
						is_it_concave(dp, n * 2 + 1);
					}
					for (k = n * 2; k >= 0; k--)
						if (dp[k] != -INF) {
							if (dp[k] + h_ - i_ >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] + j_ - i_);
							dp[k] += j_ - i_;
						}
					is_it_concave(dp, n * 2 + 1);
				} else {
					for (k = n * 2; k >= 0; k--)
						if (dp[k] != -INF) {
							if (dp[k] + h_ - i_ >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] + j_ - i_);
							dp[k] += j_ - i_;
						}
					is_it_concave(dp, n * 2 + 1);
					for (r = 0; r < aa[h_] - 1; r++) {
						for (k = n * 2; k >= 0; k--)
							if (dp[k] != -INF && dp[k] - (j - h_) * 3 >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] - (j - h_) * 2);
						is_it_concave(dp, n * 2 + 1);
					}
				}
				for (h = h_ + 1; h < j; h++)
					for (r = 0; r < aa[h]; r++) {
						for (k = n * 2; k >= 0; k--)
							if (dp[k] != -INF && dp[k] - (j - h) * 3 >= 0)
								dp[k + 1] = max(dp[k + 1], dp[k] - (j - h) * 2);
						is_it_concave(dp, n * 2 + 1);
					}
			}
			is_it_concave(dp, n * 2 + 1);
			i = j;
		}
	ans = 0;
	for (i = 0; i < n; i++)
		if (aa[i] > 0)
			ans += aa[i];
	k = 0;
	while (k < n * 2 && dp[k + 1] != -INF)
		k++;
	ans -= k;
	printf("%d\n", ans);
	return 0;
}

Compilation message

tortoise.c: In function 'main':
tortoise.c:57:26: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |     if (j == n || i >= 0 && h_ - i <= j - h_) {
      |                   ~~~~~~~^~~~~~~~~~~~~~~~~~~
tortoise.c:21:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
tortoise.c:23:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 280 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 280 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 284 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 284 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 280 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 284 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 284 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 280 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 2 ms 204 KB Output is correct
51 Correct 3 ms 284 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 16 ms 204 KB Output is correct
54 Correct 18 ms 204 KB Output is correct
55 Correct 28 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 2 ms 284 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 280 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 284 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 284 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 280 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 2 ms 204 KB Output is correct
51 Correct 3 ms 284 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 16 ms 204 KB Output is correct
54 Correct 18 ms 204 KB Output is correct
55 Correct 28 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 2 ms 284 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 18 ms 324 KB Output is correct
64 Correct 98 ms 332 KB Output is correct
65 Correct 26 ms 332 KB Output is correct
66 Correct 45 ms 336 KB Output is correct
67 Correct 35 ms 324 KB Output is correct
68 Correct 32 ms 332 KB Output is correct
69 Correct 45 ms 332 KB Output is correct
70 Correct 72 ms 292 KB Output is correct
71 Execution timed out 3057 ms 332 KB Time limit exceeded
72 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 280 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 284 KB Output is correct
29 Correct 1 ms 284 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 284 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 280 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 2 ms 204 KB Output is correct
51 Correct 3 ms 284 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 16 ms 204 KB Output is correct
54 Correct 18 ms 204 KB Output is correct
55 Correct 28 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 2 ms 284 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 18 ms 324 KB Output is correct
64 Correct 98 ms 332 KB Output is correct
65 Correct 26 ms 332 KB Output is correct
66 Correct 45 ms 336 KB Output is correct
67 Correct 35 ms 324 KB Output is correct
68 Correct 32 ms 332 KB Output is correct
69 Correct 45 ms 332 KB Output is correct
70 Correct 72 ms 292 KB Output is correct
71 Execution timed out 3057 ms 332 KB Time limit exceeded
72 Halted 0 ms 0 KB -