oj.uz

Submission #544731

# Submission time Handle Problem Language Result Execution time Memory
544731 2022-04-02T16:14:13 Z rainboy Railway (BOI17_railway) C
100 / 100
 119 ms 18992 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	100000

unsigned int X = 12345;

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

int ij[N];
int *eh[N], eo[N];

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

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

int dd[N], pp[N], qq[N], ff[N], sz[N], ta[N], tb[N], qu[N], cnt;

void dfs(int p, int f, int i, int d) {
	int o, j_;

	qu[ta[i] = cnt++] = i;
	dd[i] = d, pp[i] = p, ff[i] = f;
	j_ = -1, sz[i] = 1;
	for (o = 0; o < eo[i]; o++) {
		int h = eh[i][o], j = i ^ ij[h];

		if (h != f) {
			dfs(i, h, j, d + 1);
			if (j_ == -1 || sz[j_] < sz[j])
				j_ = j;
			sz[i] += sz[j];
		}
	}
	if (j_ != -1)
		qq[j_] = -1;
	tb[i] = cnt;
}

int lca(int i, int j) {
	while (qq[i] != qq[j])
		if (dd[qq[i]] > dd[qq[j]])
			i = pp[qq[i]];
		else
			j = pp[qq[j]];
	return dd[i] < dd[j] ? i : j;
}

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 (ta[ii[j]] == ta[i_])
				j++;
			else if (ta[ii[j]] < ta[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 main() {
	static int kk[N];
	static char used[N];
	int n, m, k, h, i, j;

	scanf("%d%d%d", &n, &m, &k);
	for (i = 0; i < n; i++)
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		ij[h] = i ^ j;
		append(i, h), append(j, h);
	}
	dfs(-1, -1, 0, 0);
	for (h = 0; h < cnt; h++) {
		i = qu[h];
		qq[i] = qq[i] ? qq[pp[i]] : i;
	}
	while (m--) {
		static int ii[N];

		scanf("%d", &cnt);
		for (h = 0; h < cnt; h++)
			scanf("%d", &ii[h]), ii[h]--;
		sort(ii, 0, cnt);
		for (h = 0; h < cnt; h++) {
			i = ii[h], j = lca(ii[h], ii[(h - 1 + cnt) % cnt]);
			kk[ta[i]]++, kk[ta[j]]--;
		}
	}
	for (i = 1; i < n; i++)
		kk[i] += kk[i - 1];
	cnt = 0;
	for (i = 0; i < n; i++)
		if (kk[tb[i] - 1] - (ta[i] == 0 ? 0 : kk[ta[i] - 1]) >= k)
			used[ff[i]] = 1, cnt++;
	printf("%d\n", cnt);
	for (h = 0; h < n - 1; h++)
		if (used[h])
			printf("%d ", h + 1);
	printf("\n");
	return 0;
}

Compilation message

railway.c: In function 'append':
railway.c:18:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   18 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
railway.c: In function 'main':
railway.c:79:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |  scanf("%d%d%d", &n, &m, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~
railway.c:83:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
railway.c:95:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |   scanf("%d", &cnt);
      |   ^~~~~~~~~~~~~~~~~
railway.c:97:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |    scanf("%d", &ii[h]), ii[h]--;
      |    ^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 5 ms 1240 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 4 ms 1200 KB Output is correct
9 Correct 4 ms 1236 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 5 ms 1240 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 4 ms 1200 KB Output is correct
9 Correct 4 ms 1236 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 24 ms 1640 KB Output is correct
16 Correct 24 ms 1568 KB Output is correct
17 Correct 22 ms 1632 KB Output is correct
18 Correct 5 ms 1620 KB Output is correct
19 Correct 5 ms 1376 KB Output is correct
20 Correct 22 ms 1680 KB Output is correct
21 Correct 23 ms 1756 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 6 ms 1304 KB Output is correct
24 Correct 6 ms 1288 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 5 ms 1612 KB Output is correct
28 Correct 5 ms 1364 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 4 ms 1228 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 296 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 18736 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 77 ms 18444 KB Output is correct
4 Correct 55 ms 18048 KB Output is correct
5 Correct 61 ms 18632 KB Output is correct
6 Correct 81 ms 18912 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 14288 KB Output is correct
2 Correct 73 ms 10792 KB Output is correct
3 Correct 85 ms 10452 KB Output is correct
4 Correct 87 ms 10428 KB Output is correct
5 Correct 97 ms 10492 KB Output is correct
6 Correct 78 ms 14396 KB Output is correct
7 Correct 85 ms 14264 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 14288 KB Output is correct
2 Correct 73 ms 10792 KB Output is correct
3 Correct 85 ms 10452 KB Output is correct
4 Correct 87 ms 10428 KB Output is correct
5 Correct 97 ms 10492 KB Output is correct
6 Correct 78 ms 14396 KB Output is correct
7 Correct 85 ms 14264 KB Output is correct
8 Correct 82 ms 14268 KB Output is correct
9 Correct 90 ms 14316 KB Output is correct
10 Correct 70 ms 18604 KB Output is correct
11 Correct 67 ms 18640 KB Output is correct
12 Correct 73 ms 10268 KB Output is correct
13 Correct 78 ms 10268 KB Output is correct
14 Correct 97 ms 10352 KB Output is correct
15 Correct 90 ms 10404 KB Output is correct
16 Correct 86 ms 10500 KB Output is correct
17 Correct 76 ms 10396 KB Output is correct
18 Correct 81 ms 10516 KB Output is correct
19 Correct 84 ms 10896 KB Output is correct
20 Correct 68 ms 14396 KB Output is correct
21 Correct 74 ms 14544 KB Output is correct
22 Correct 75 ms 14428 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 5 ms 1240 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 5 ms 1620 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 4 ms 1200 KB Output is correct
9 Correct 4 ms 1236 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 24 ms 1640 KB Output is correct
16 Correct 24 ms 1568 KB Output is correct
17 Correct 22 ms 1632 KB Output is correct
18 Correct 5 ms 1620 KB Output is correct
19 Correct 5 ms 1376 KB Output is correct
20 Correct 22 ms 1680 KB Output is correct
21 Correct 23 ms 1756 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 6 ms 1304 KB Output is correct
24 Correct 6 ms 1288 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 5 ms 1612 KB Output is correct
28 Correct 5 ms 1364 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 4 ms 1228 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 89 ms 18736 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 77 ms 18444 KB Output is correct
39 Correct 55 ms 18048 KB Output is correct
40 Correct 61 ms 18632 KB Output is correct
41 Correct 81 ms 18912 KB Output is correct
42 Correct 69 ms 14288 KB Output is correct
43 Correct 73 ms 10792 KB Output is correct
44 Correct 85 ms 10452 KB Output is correct
45 Correct 87 ms 10428 KB Output is correct
46 Correct 97 ms 10492 KB Output is correct
47 Correct 78 ms 14396 KB Output is correct
48 Correct 85 ms 14264 KB Output is correct
49 Correct 82 ms 14268 KB Output is correct
50 Correct 90 ms 14316 KB Output is correct
51 Correct 70 ms 18604 KB Output is correct
52 Correct 67 ms 18640 KB Output is correct
53 Correct 73 ms 10268 KB Output is correct
54 Correct 78 ms 10268 KB Output is correct
55 Correct 97 ms 10352 KB Output is correct
56 Correct 90 ms 10404 KB Output is correct
57 Correct 86 ms 10500 KB Output is correct
58 Correct 76 ms 10396 KB Output is correct
59 Correct 81 ms 10516 KB Output is correct
60 Correct 84 ms 10896 KB Output is correct
61 Correct 68 ms 14396 KB Output is correct
62 Correct 74 ms 14544 KB Output is correct
63 Correct 75 ms 14428 KB Output is correct
64 Correct 71 ms 14380 KB Output is correct
65 Correct 98 ms 10528 KB Output is correct
66 Correct 119 ms 10368 KB Output is correct
67 Correct 91 ms 10344 KB Output is correct
68 Correct 72 ms 10152 KB Output is correct
69 Correct 58 ms 10156 KB Output is correct
70 Correct 68 ms 14644 KB Output is correct
71 Correct 69 ms 14216 KB Output is correct
72 Correct 1 ms 296 KB Output is correct
73 Correct 7 ms 1276 KB Output is correct
74 Correct 5 ms 1236 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 5 ms 1620 KB Output is correct
78 Correct 5 ms 1332 KB Output is correct
79 Correct 5 ms 1188 KB Output is correct
80 Correct 5 ms 1236 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 292 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 0 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 26 ms 1644 KB Output is correct
87 Correct 23 ms 1644 KB Output is correct
88 Correct 25 ms 1692 KB Output is correct
89 Correct 6 ms 1620 KB Output is correct
90 Correct 5 ms 1328 KB Output is correct
91 Correct 25 ms 1692 KB Output is correct
92 Correct 26 ms 1740 KB Output is correct
93 Correct 0 ms 340 KB Output is correct
94 Correct 68 ms 18604 KB Output is correct
95 Correct 80 ms 18396 KB Output is correct
96 Correct 62 ms 18148 KB Output is correct
97 Correct 68 ms 18584 KB Output is correct
98 Correct 72 ms 18992 KB Output is correct
99 Correct 84 ms 10520 KB Output is correct
100 Correct 87 ms 10444 KB Output is correct
101 Correct 101 ms 10524 KB Output is correct
102 Correct 71 ms 10896 KB Output is correct
103 Correct 72 ms 14248 KB Output is correct
104 Correct 68 ms 14516 KB Output is correct
105 Correct 69 ms 14336 KB Output is correct
106 Correct 68 ms 14360 KB Output is correct
107 Correct 60 ms 14280 KB Output is correct
108 Correct 61 ms 18684 KB Output is correct
109 Correct 62 ms 18636 KB Output is correct
110 Correct 64 ms 10184 KB Output is correct
111 Correct 61 ms 10200 KB Output is correct
112 Correct 67 ms 10364 KB Output is correct
113 Correct 66 ms 10436 KB Output is correct