Submission #502837

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
502837	2022-01-06T15:53:59 Z	rainboy	Tortoise (CEOI21_tortoise)	C	73 / 100	46 ms	460 KB

tortoise

/* https://hsin.hr/ceoi/competition/ceoi2021_day2_editorial.pdf */
#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; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int tt[N], dd[N];

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (dd[ii[j]] == dd[i_])
				j++;
			else if (dd[ii[j]] < dd[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int check(int *ss, int *kk, int n) {
	int i, s;

	for (i = 0, s = 0; i < n; i++) {
		s += ss[i];
		if (kk[i] > 0 && s < 0)
			return 0;
	}
	return 1;
}

int main() {
	static int aa[N], ii[N], ll[N], rr[N], pp[N], ss[N], kk[N];
	int n, n_, i, j;
	long long ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 0; i < n; i++)
		ll[i] = aa[i] == -1 ? i : (i == 0 ? -INF : ll[i - 1]);
	for (i = n - 1; i >= 0; i--)
		rr[i] = aa[i] == -1 ? i : (i + 1 == n ? INF : rr[i + 1]);
	n_ = 0;
	for (i = 0; i < n; i++)
		if (aa[i] > 0) {
			if (i - ll[i] <= rr[i] - i)
				tt[i] = -1, dd[i] = i - ll[i];
			else
				tt[i] = 1, dd[i] = rr[i] - i;
			ii[n_++] = i;
		}
	ans = 0;
	for (i = 0; i < n; i++)
		if (aa[i] > 0)
			ans += aa[i];
	for (j = 0; j < n; j++)
		if (aa[j] == -1) {
			i = j - 1;
			while (i >= 0 && aa[i] == 0)
				i--;
			if (i >= 0 && aa[i] > 0)
				pp[j] = i, kk[i]++, ans--;
			else
				pp[j] = -1;
		}
	sort(ii, 0, n_);
	for (i = 1; i < n; i++)
		ss[i] = 1;
	for (i = 0; i < n_; i++) {
		int i_ = ii[i], r = rr[i_], p;

		while (kk[i_] <= aa[i_]) {
			p = r == INF ? INF : pp[r];
			if (tt[i_] == -1) {
				if (kk[i_] == aa[i_])
					break;
				if (kk[i_]++ == 0) {
					if (i_ + 1 < n)
						ss[i_ + 1] -= dd[i_] * 2;
				} else
					ss[i_] -= dd[i_] * 2;
				if (check(ss, kk, n))
					ans--;
				else {
					if (--kk[i_] == 0) {
						if (i_ + 1 < n)
							ss[i_ + 1] += dd[i_] * 2;
					} else
						ss[i_] += dd[i_] * 2;
					break;
				}
			} else {
				if (i_ != p)
					break;
				while (p >= 0 && kk[p] == aa[p])
					p--;
				if (p < 0 || aa[p] == -1)
					break;
				kk[p]++, ss[i_] -= dd[i_] * 2;
				if (check(ss, kk, n))
					pp[r] = p, ans--;
				else {
					kk[p]--, ss[i_] += dd[i_] * 2;
					break;
				}
			}
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #3
30.0 / 30.0

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

Subtask #4
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	260 KB	Output is correct
5	Correct	0 ms	280 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	284 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	272 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	280 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	280 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	276 KB	Output is correct
21	Correct	1 ms	280 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	280 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	280 KB	Output is correct
30	Correct	0 ms	272 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	280 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	284 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	280 KB	Output is correct
44	Correct	1 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	0 ms	204 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Correct	0 ms	280 KB	Output is correct
50	Correct	0 ms	276 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	0 ms	204 KB	Output is correct
53	Correct	0 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	0 ms	204 KB	Output is correct
57	Correct	0 ms	204 KB	Output is correct
58	Correct	0 ms	204 KB	Output is correct
59	Correct	0 ms	204 KB	Output is correct
60	Correct	0 ms	204 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	0 ms	280 KB	Output is correct
63	Correct	5 ms	332 KB	Output is correct
64	Correct	18 ms	456 KB	Output is correct
65	Correct	9 ms	412 KB	Output is correct
66	Correct	12 ms	332 KB	Output is correct
67	Correct	8 ms	416 KB	Output is correct
68	Correct	10 ms	452 KB	Output is correct
69	Correct	16 ms	332 KB	Output is correct
70	Correct	13 ms	452 KB	Output is correct
71	Correct	24 ms	460 KB	Output is correct
72	Correct	46 ms	444 KB	Output is correct
73	Correct	23 ms	344 KB	Output is correct
74	Correct	23 ms	460 KB	Output is correct
75	Correct	1 ms	292 KB	Output is correct
76	Correct	15 ms	452 KB	Output is correct
77	Correct	14 ms	332 KB	Output is correct
78	Correct	14 ms	460 KB	Output is correct
79	Correct	14 ms	452 KB	Output is correct
80	Correct	12 ms	452 KB	Output is correct
81	Correct	12 ms	452 KB	Output is correct
82	Correct	12 ms	456 KB	Output is correct
83	Correct	15 ms	452 KB	Output is correct
84	Correct	16 ms	332 KB	Output is correct
85	Correct	20 ms	404 KB	Output is correct
86	Correct	19 ms	332 KB	Output is correct
87	Correct	23 ms	400 KB	Output is correct
88	Correct	21 ms	436 KB	Output is correct

Subtask #5
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	260 KB	Output is correct
5	Correct	0 ms	280 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	284 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	272 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	280 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	280 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	276 KB	Output is correct
21	Correct	1 ms	280 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	280 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	280 KB	Output is correct
30	Correct	0 ms	272 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	280 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	284 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	280 KB	Output is correct
44	Correct	1 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	0 ms	204 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Correct	0 ms	280 KB	Output is correct
50	Correct	0 ms	276 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	0 ms	204 KB	Output is correct
53	Correct	0 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	0 ms	204 KB	Output is correct
57	Correct	0 ms	204 KB	Output is correct
58	Correct	0 ms	204 KB	Output is correct
59	Correct	0 ms	204 KB	Output is correct
60	Correct	0 ms	204 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	0 ms	280 KB	Output is correct
63	Correct	5 ms	332 KB	Output is correct
64	Correct	18 ms	456 KB	Output is correct
65	Correct	9 ms	412 KB	Output is correct
66	Correct	12 ms	332 KB	Output is correct
67	Correct	8 ms	416 KB	Output is correct
68	Correct	10 ms	452 KB	Output is correct
69	Correct	16 ms	332 KB	Output is correct
70	Correct	13 ms	452 KB	Output is correct
71	Correct	24 ms	460 KB	Output is correct
72	Correct	46 ms	444 KB	Output is correct
73	Correct	23 ms	344 KB	Output is correct
74	Correct	23 ms	460 KB	Output is correct
75	Correct	1 ms	292 KB	Output is correct
76	Correct	15 ms	452 KB	Output is correct
77	Correct	14 ms	332 KB	Output is correct
78	Correct	14 ms	460 KB	Output is correct
79	Correct	14 ms	452 KB	Output is correct
80	Correct	12 ms	452 KB	Output is correct
81	Correct	12 ms	452 KB	Output is correct
82	Correct	12 ms	456 KB	Output is correct
83	Correct	15 ms	452 KB	Output is correct
84	Correct	16 ms	332 KB	Output is correct
85	Correct	20 ms	404 KB	Output is correct
86	Correct	19 ms	332 KB	Output is correct
87	Correct	23 ms	400 KB	Output is correct
88	Correct	21 ms	436 KB	Output is correct
89	Runtime error	2 ms	460 KB	Execution killed with signal 11
90	Halted	0 ms	0 KB	-

Submission #502837

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 10.0 / 10.0

Subtask #3 30.0 / 30.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 27.0

Subtask #1
8.0 / 8.0

Subtask #2
10.0 / 10.0

Subtask #3
30.0 / 30.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 27.0