oj.uz

Submission #927922

# Submission time Handle Problem Language Result Execution time Memory
927922 2024-02-15T14:05:56 Z TAhmed33 Railway (BOI17_railway) C++
100 / 100
 364 ms 56340 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 25;
int n, m, k;
vector <int> adj[MAXN];
int t = 0;
int in[MAXN], out[MAXN], dep[MAXN], p[MAXN];
void dfs (int pos, int par = 0) {
	in[pos] = ++t;
	p[pos] = par;
	for (auto j : adj[pos]) {
		if (j == par) continue;
		dep[j] = 1 + dep[pos];
		dfs(j, pos);
	}
	out[pos] = t;
}
int dp[18][MAXN];
int jump (int a, int b) {
	for (int i = 17; i >= 0; i--) {
		if (b & (1 << i)) {
			a = dp[i][a];
		}
	}
	return a;
}
int lca (int a, int b) {
	if (dep[a] > dep[b]) swap(a, b);
	b = jump(b, dep[b] - dep[a]);
	if (a == b) return a;
	for (int i = 17; i >= 0; i--) {
		int x = dp[i][a], y = dp[i][b];
		if (x && y && x != y) {
			a = x; b = y;
		}
	}
	return jump(a, 1);
}
map <int, int> vals[MAXN];
void insert (int a, int b, int c) {
	if (a == b) return;
	vals[a][c]++;
	vals[b][c]--;
}
vector <int> kk;
void dfs2 (int pos, int par) {
	for (auto j : adj[pos]) {
		if (j == par) continue;
		dfs2(j, pos);
		if (vals[j].size() > vals[pos].size()) vals[j].swap(vals[pos]);
		for (auto p : vals[j]) {
			vals[pos][p.first] += p.second;
			if (vals[pos][p.first] == 0) vals[pos].erase(p.first);
		}
		vals[j].clear();
	}
	if (vals[pos].size() >= k) {
		kk.push_back(pos);
	}
}
map <pair <int, int>, int> lll;
int main () {
	cin >> n >> m >> k;
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
		lll[{a, b}] = lll[{b, a}] = i;
	}
	dfs(1);
	for (int i = 1; i <= n; i++) dp[0][i] = p[i];
	for (int j = 1; j <= 17; j++) {
		for (int i = 1; i <= n; i++) {
			dp[j][i] = dp[j - 1][dp[j - 1][i]];
		}
	}
	while (m--) {
		int x;
		cin >> x;
		vector <int> dd(x);
		for (auto &i : dd) cin >> i;
		sort(dd.begin(), dd.end(), [&] (int a, int b) {
			return in[a] < in[b];
		});
		for (int i = 1; i < (int)dd.size(); i++) {
			int x = lca(dd[i], dd[i - 1]);
			insert(dd[i], x, m);
			insert(dd[i - 1], x, m);
		}
	}
	dfs2(1, -1);
	cout << (int)kk.size() << '\n';
	for (auto &i : kk) {
		i = lll[{i, p[i]}];
	}
	sort(kk.begin(), kk.end());
	for (auto i : kk) cout << i << " ";
}

Compilation message

railway.cpp: In function 'void dfs2(int, int)':
railway.cpp:57:23: warning: comparison of integer expressions of different signedness: 'std::map<int, int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |  if (vals[pos].size() >= k) {
      |      ~~~~~~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 15 ms 17756 KB Output is correct
3 Correct 18 ms 17664 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 4 ms 15964 KB Output is correct
6 Correct 14 ms 18524 KB Output is correct
7 Correct 14 ms 17888 KB Output is correct
8 Correct 12 ms 17756 KB Output is correct
9 Correct 14 ms 17944 KB Output is correct
10 Correct 3 ms 16084 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 4 ms 16036 KB Output is correct
13 Correct 3 ms 15964 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 15 ms 17756 KB Output is correct
3 Correct 18 ms 17664 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 4 ms 15964 KB Output is correct
6 Correct 14 ms 18524 KB Output is correct
7 Correct 14 ms 17888 KB Output is correct
8 Correct 12 ms 17756 KB Output is correct
9 Correct 14 ms 17944 KB Output is correct
10 Correct 3 ms 16084 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 4 ms 16036 KB Output is correct
13 Correct 3 ms 15964 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct
15 Correct 101 ms 22552 KB Output is correct
16 Correct 102 ms 22712 KB Output is correct
17 Correct 81 ms 22692 KB Output is correct
18 Correct 20 ms 18780 KB Output is correct
19 Correct 18 ms 18072 KB Output is correct
20 Correct 88 ms 23024 KB Output is correct
21 Correct 96 ms 23068 KB Output is correct
22 Correct 3 ms 15964 KB Output is correct
23 Correct 14 ms 17720 KB Output is correct
24 Correct 15 ms 17756 KB Output is correct
25 Correct 3 ms 16056 KB Output is correct
26 Correct 3 ms 15964 KB Output is correct
27 Correct 16 ms 18524 KB Output is correct
28 Correct 14 ms 17944 KB Output is correct
29 Correct 13 ms 17756 KB Output is correct
30 Correct 13 ms 17756 KB Output is correct
31 Correct 4 ms 15964 KB Output is correct
32 Correct 3 ms 15964 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 4 ms 15964 KB Output is correct
35 Correct 3 ms 15964 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 54228 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 225 ms 53928 KB Output is correct
4 Correct 229 ms 53348 KB Output is correct
5 Correct 239 ms 54228 KB Output is correct
6 Correct 225 ms 56340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 46448 KB Output is correct
2 Correct 294 ms 40820 KB Output is correct
3 Correct 307 ms 40760 KB Output is correct
4 Correct 306 ms 40276 KB Output is correct
5 Correct 364 ms 40196 KB Output is correct
6 Correct 255 ms 46552 KB Output is correct
7 Correct 252 ms 46392 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 46448 KB Output is correct
2 Correct 294 ms 40820 KB Output is correct
3 Correct 307 ms 40760 KB Output is correct
4 Correct 306 ms 40276 KB Output is correct
5 Correct 364 ms 40196 KB Output is correct
6 Correct 255 ms 46552 KB Output is correct
7 Correct 252 ms 46392 KB Output is correct
8 Correct 240 ms 47456 KB Output is correct
9 Correct 246 ms 47184 KB Output is correct
10 Correct 178 ms 54252 KB Output is correct
11 Correct 166 ms 54312 KB Output is correct
12 Correct 201 ms 37848 KB Output is correct
13 Correct 202 ms 37972 KB Output is correct
14 Correct 302 ms 41224 KB Output is correct
15 Correct 318 ms 40920 KB Output is correct
16 Correct 364 ms 40640 KB Output is correct
17 Correct 272 ms 40784 KB Output is correct
18 Correct 321 ms 40628 KB Output is correct
19 Correct 261 ms 41072 KB Output is correct
20 Correct 247 ms 46692 KB Output is correct
21 Correct 246 ms 47008 KB Output is correct
22 Correct 220 ms 46876 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 15 ms 17756 KB Output is correct
3 Correct 18 ms 17664 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 4 ms 15964 KB Output is correct
6 Correct 14 ms 18524 KB Output is correct
7 Correct 14 ms 17888 KB Output is correct
8 Correct 12 ms 17756 KB Output is correct
9 Correct 14 ms 17944 KB Output is correct
10 Correct 3 ms 16084 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 4 ms 16036 KB Output is correct
13 Correct 3 ms 15964 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct
15 Correct 101 ms 22552 KB Output is correct
16 Correct 102 ms 22712 KB Output is correct
17 Correct 81 ms 22692 KB Output is correct
18 Correct 20 ms 18780 KB Output is correct
19 Correct 18 ms 18072 KB Output is correct
20 Correct 88 ms 23024 KB Output is correct
21 Correct 96 ms 23068 KB Output is correct
22 Correct 3 ms 15964 KB Output is correct
23 Correct 14 ms 17720 KB Output is correct
24 Correct 15 ms 17756 KB Output is correct
25 Correct 3 ms 16056 KB Output is correct
26 Correct 3 ms 15964 KB Output is correct
27 Correct 16 ms 18524 KB Output is correct
28 Correct 14 ms 17944 KB Output is correct
29 Correct 13 ms 17756 KB Output is correct
30 Correct 13 ms 17756 KB Output is correct
31 Correct 4 ms 15964 KB Output is correct
32 Correct 3 ms 15964 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 4 ms 15964 KB Output is correct
35 Correct 3 ms 15964 KB Output is correct
36 Correct 228 ms 54228 KB Output is correct
37 Correct 3 ms 15964 KB Output is correct
38 Correct 225 ms 53928 KB Output is correct
39 Correct 229 ms 53348 KB Output is correct
40 Correct 239 ms 54228 KB Output is correct
41 Correct 225 ms 56340 KB Output is correct
42 Correct 235 ms 46448 KB Output is correct
43 Correct 294 ms 40820 KB Output is correct
44 Correct 307 ms 40760 KB Output is correct
45 Correct 306 ms 40276 KB Output is correct
46 Correct 364 ms 40196 KB Output is correct
47 Correct 255 ms 46552 KB Output is correct
48 Correct 252 ms 46392 KB Output is correct
49 Correct 240 ms 47456 KB Output is correct
50 Correct 246 ms 47184 KB Output is correct
51 Correct 178 ms 54252 KB Output is correct
52 Correct 166 ms 54312 KB Output is correct
53 Correct 201 ms 37848 KB Output is correct
54 Correct 202 ms 37972 KB Output is correct
55 Correct 302 ms 41224 KB Output is correct
56 Correct 318 ms 40920 KB Output is correct
57 Correct 364 ms 40640 KB Output is correct
58 Correct 272 ms 40784 KB Output is correct
59 Correct 321 ms 40628 KB Output is correct
60 Correct 261 ms 41072 KB Output is correct
61 Correct 247 ms 46692 KB Output is correct
62 Correct 246 ms 47008 KB Output is correct
63 Correct 220 ms 46876 KB Output is correct
64 Correct 206 ms 46884 KB Output is correct
65 Correct 337 ms 40236 KB Output is correct
66 Correct 341 ms 40852 KB Output is correct
67 Correct 339 ms 40504 KB Output is correct
68 Correct 198 ms 36608 KB Output is correct
69 Correct 177 ms 36620 KB Output is correct
70 Correct 225 ms 47232 KB Output is correct
71 Correct 236 ms 46960 KB Output is correct
72 Correct 3 ms 15960 KB Output is correct
73 Correct 13 ms 17756 KB Output is correct
74 Correct 15 ms 17848 KB Output is correct
75 Correct 3 ms 15964 KB Output is correct
76 Correct 3 ms 15964 KB Output is correct
77 Correct 14 ms 18648 KB Output is correct
78 Correct 13 ms 18012 KB Output is correct
79 Correct 12 ms 17756 KB Output is correct
80 Correct 13 ms 17884 KB Output is correct
81 Correct 7 ms 15964 KB Output is correct
82 Correct 3 ms 15964 KB Output is correct
83 Correct 3 ms 15964 KB Output is correct
84 Correct 4 ms 15964 KB Output is correct
85 Correct 4 ms 16076 KB Output is correct
86 Correct 71 ms 22612 KB Output is correct
87 Correct 77 ms 22684 KB Output is correct
88 Correct 68 ms 22768 KB Output is correct
89 Correct 14 ms 18776 KB Output is correct
90 Correct 13 ms 18012 KB Output is correct
91 Correct 64 ms 22868 KB Output is correct
92 Correct 68 ms 22868 KB Output is correct
93 Correct 4 ms 15960 KB Output is correct
94 Correct 210 ms 54232 KB Output is correct
95 Correct 203 ms 53720 KB Output is correct
96 Correct 181 ms 53332 KB Output is correct
97 Correct 181 ms 54228 KB Output is correct
98 Correct 196 ms 56276 KB Output is correct
99 Correct 296 ms 40656 KB Output is correct
100 Correct 278 ms 40532 KB Output is correct
101 Correct 278 ms 40464 KB Output is correct
102 Correct 282 ms 41044 KB Output is correct
103 Correct 220 ms 46436 KB Output is correct
104 Correct 224 ms 46908 KB Output is correct
105 Correct 212 ms 46420 KB Output is correct
106 Correct 214 ms 47268 KB Output is correct
107 Correct 215 ms 47324 KB Output is correct
108 Correct 160 ms 54388 KB Output is correct
109 Correct 162 ms 54368 KB Output is correct
110 Correct 153 ms 37884 KB Output is correct
111 Correct 155 ms 37900 KB Output is correct
112 Correct 250 ms 40896 KB Output is correct
113 Correct 258 ms 41436 KB Output is correct