답안 #488550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488550	2021-11-19T15:07:41 Z	rainboy	Volontiranje (COCI21_volontiranje)	C	110 / 110	278 ms	66948 KB

Main

#include <stdio.h>
#include <stdlib.h>

#define N	1000000

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

int ft[N];

void update(int i, int n, int x) {
	while (i < n) {
		ft[i] = max(ft[i], x);
		i |= i + 1;
	}
}

int query(int i) {
	int x = 0;

	while (i >= 0) {
		x = max(x, ft[i]);
		i &= i + 1, i--;
	}
	return x;
}

int *ei[N], eo[N];

void append(int h, int i) {
	int o = eo[h]++;

	if (o >= 2 && (o & o - 1) == 0)
		ei[h] = (int *) realloc(ei[h], o * 2 * sizeof *ei[h]);
	ei[h][o] = i;
}

int main() {
	static int aa[N], nxt[N], hh[N];
	int n, h, i, j, l, c;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]), aa[i]--;
	for (i = 0; i < n; i++)
		update(aa[i], n, (hh[i] = query(aa[i])) + 1);
	l = query(n - 1);
	for (h = 0; h < l; h++)
		ei[h] = (int *) malloc(2 * sizeof *ei[h]);
	for (i = 0; i < n; i++) {
		append(hh[i], i);
		nxt[i] = -1;
	}
	c = 0, h = 0;
	while (1)
		if (h == l) {
			for (h = 0; h < l; h++)
				nxt[ei[h][eo[h] - 1]] = h + 1 == l ? n : ei[h + 1][eo[h + 1] - 1], eo[h]--;
			c++, h = 0;
		} else {
			if (eo[h] == 0)
				break;
			if (h > 0) {
				if (ei[h - 1][eo[h - 1] - 1] > ei[h][eo[h] - 1]) {
					eo[--h]--;
					continue;
				}
				if (aa[ei[h - 1][eo[h - 1] - 1]] > aa[ei[h][eo[h] - 1]]) {
					eo[h]--;
					continue;
				}
			}
			h++;
		}
	printf("%d %d\n", c, l);
	for (i = 0; i < n; i++)
		if (hh[i] == 0 && nxt[i] != -1) {
			for (j = i; j < n; j = nxt[j])
				printf("%d ", j + 1);
			printf("\n");
		}
	return 0;
}

Compilation message

Main.c: In function 'append':
Main.c:32:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   32 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
Main.c: In function 'main':
Main.c:41:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
Main.c:43:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   scanf("%d", &aa[i]), aa[i]--;
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct
9	Correct	204 KB	Output is correct
10	Correct	204 KB	Output is correct
11	Correct	204 KB	Output is correct
12	Correct	204 KB	Output is correct
13	Correct	204 KB	Output is correct
14	Correct	204 KB	Output is correct
15	Correct	204 KB	Output is correct
16	Correct	204 KB	Output is correct
17	Correct	204 KB	Output is correct
18	Correct	204 KB	Output is correct
19	Correct	204 KB	Output is correct
20	Correct	204 KB	Output is correct
21	Correct	204 KB	Output is correct
22	Correct	204 KB	Output is correct
23	Correct	204 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 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	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 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	1 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	0 ms	332 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	1 ms	332 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	204 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

Subtask #3
60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 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	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 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	1 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	0 ms	332 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	1 ms	332 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	204 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	83 ms	9592 KB	Output is correct
48	Correct	83 ms	10256 KB	Output is correct
49	Correct	106 ms	13224 KB	Output is correct
50	Correct	187 ms	22320 KB	Output is correct
51	Correct	40 ms	5836 KB	Output is correct
52	Correct	269 ms	66948 KB	Output is correct
53	Correct	245 ms	28868 KB	Output is correct
54	Correct	239 ms	28088 KB	Output is correct
55	Correct	278 ms	27976 KB	Output is correct
56	Correct	2 ms	588 KB	Output is correct
57	Correct	151 ms	18208 KB	Output is correct
58	Correct	35 ms	4976 KB	Output is correct
59	Correct	29 ms	4376 KB	Output is correct
60	Correct	152 ms	18516 KB	Output is correct
61	Correct	93 ms	12316 KB	Output is correct
62	Correct	0 ms	204 KB	Output is correct
63	Correct	0 ms	204 KB	Output is correct
64	Correct	0 ms	204 KB	Output is correct
65	Correct	0 ms	204 KB	Output is correct
66	Correct	0 ms	204 KB	Output is correct
67	Correct	0 ms	204 KB	Output is correct
68	Correct	0 ms	332 KB	Output is correct
69	Correct	0 ms	332 KB	Output is correct

답안 #488550

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 60.0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
60.0 / 60.0