oj.uz

Submission #667177

# Submission time Handle Problem Language Result Execution time Memory
667177 2022-11-30T16:05:06 Z Kahou Railway (BOI17_railway) C++14
100 / 100
 112 ms 24780 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e5 + 50;
int n, m, k, out[N], par[20][N], h[N], st[N], ft[N], t, p[N];
pii E[N];
vector<int> adj[N];
vector<int> vc;

void dfs(int u, int p) {
	st[u] = ++t;
	par[0][u] = p;
	h[u] = h[p]+1;
	for (int v:adj[u]) {
		if (v == p) continue;
		dfs(v, u);
	}
	ft[u] = t;
}

int Par(int u, int k) {
	for (int i = 0; i < 20; i++) {
		if (k>>i&1) u = par[i][u];
	}
	return u;
}

int LCA(int u, int v) {
	if (h[u] < h[v]) swap(u, v);
	u = Par(u, h[u]-h[v]);
	if (u == v) return u;

	for (int i = 19; i >= 0; i--) {
		if (par[i][u] != par[i][v]) {
			u = par[i][u];
			v = par[i][v];
		}
	}
	return par[0][u];
}

void dfs2(int u, int p) {
	for (int v:adj[u]) {
		if (v == p) continue;
		dfs2(v, u);
		out[u]+= out[v];
	}
}

bool cmp(int u, int v) {
	return st[u] < st[v];
}

void solve() {
	cin >> n >> m >> k;
	for (int i=1; i <= n-1; i++) {
		int u,v;
		cin >> u >> v;
		E[i] = {u, v};
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1,0);
	for (int k = 1; k < 20; k++) {
		for (int u = 1; u <= n; u++) {
			par[k][u] = par[k-1][par[k-1][u]];
		}
	}

	while (m--) {
		vc.clear();
		int s;
		cin >> s;
		for (int i = 1; i <= s; i++) {
			int u;
			cin >> u;
			vc.push_back(u);
		}
		sort(vc.begin(), vc.end(), cmp);
		for (int i = 1; i < s; i++) {
			vc.push_back(LCA(vc[i-1], vc[i]));
		}
		sort(vc.begin(), vc.end(), cmp);
		vc.resize(unique(vc.begin(), vc.end()) - vc.begin());
		
		p[vc[0]] = 0;
		for (int i = 1; i < (int)vc.size(); i++) {
			int u = vc[i];
			p[u] = vc[i-1];
			while (p[u] > 0 && ft[p[u]] < ft[u]) p[u] = p[p[u]];
			out[u]++, out[p[u]]--;
		}
	}
	dfs2(1, 0);
	int ans = 0;
	for (int i = 1; i <= n-1; i++) {
		if (par[0][E[i].S] == E[i].F) swap(E[i].F, E[i].S);
		if (out[E[i].F] >= k) ans++;
	}
	cout << ans << endl;
	for (int i = 1; i <= n-1; i++) {
		if (out[E[i].F] >= k) cout << i << ' ';
	}
	cout << endl;
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 28 ms 4052 KB Output is correct
16 Correct 28 ms 4176 KB Output is correct
17 Correct 29 ms 4308 KB Output is correct
18 Correct 6 ms 4464 KB Output is correct
19 Correct 5 ms 4180 KB Output is correct
20 Correct 22 ms 4212 KB Output is correct
21 Correct 28 ms 4180 KB Output is correct
22 Correct 1 ms 2772 KB Output is correct
23 Correct 5 ms 4180 KB Output is correct
24 Correct 5 ms 4180 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 5 ms 4564 KB Output is correct
28 Correct 5 ms 4272 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4180 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 24592 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct
3 Correct 74 ms 24376 KB Output is correct
4 Correct 64 ms 24172 KB Output is correct
5 Correct 76 ms 24636 KB Output is correct
6 Correct 81 ms 24780 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 20116 KB Output is correct
2 Correct 64 ms 16756 KB Output is correct
3 Correct 76 ms 16352 KB Output is correct
4 Correct 73 ms 16420 KB Output is correct
5 Correct 69 ms 16456 KB Output is correct
6 Correct 55 ms 20092 KB Output is correct
7 Correct 56 ms 20044 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 20116 KB Output is correct
2 Correct 64 ms 16756 KB Output is correct
3 Correct 76 ms 16352 KB Output is correct
4 Correct 73 ms 16420 KB Output is correct
5 Correct 69 ms 16456 KB Output is correct
6 Correct 55 ms 20092 KB Output is correct
7 Correct 56 ms 20044 KB Output is correct
8 Correct 74 ms 20284 KB Output is correct
9 Correct 71 ms 20300 KB Output is correct
10 Correct 72 ms 24644 KB Output is correct
11 Correct 75 ms 24640 KB Output is correct
12 Correct 90 ms 16752 KB Output is correct
13 Correct 91 ms 16796 KB Output is correct
14 Correct 85 ms 16392 KB Output is correct
15 Correct 75 ms 16472 KB Output is correct
16 Correct 70 ms 16476 KB Output is correct
17 Correct 69 ms 16544 KB Output is correct
18 Correct 64 ms 16468 KB Output is correct
19 Correct 65 ms 16808 KB Output is correct
20 Correct 58 ms 20180 KB Output is correct
21 Correct 57 ms 20292 KB Output is correct
22 Correct 58 ms 20340 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 5 ms 4180 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 28 ms 4052 KB Output is correct
16 Correct 28 ms 4176 KB Output is correct
17 Correct 29 ms 4308 KB Output is correct
18 Correct 6 ms 4464 KB Output is correct
19 Correct 5 ms 4180 KB Output is correct
20 Correct 22 ms 4212 KB Output is correct
21 Correct 28 ms 4180 KB Output is correct
22 Correct 1 ms 2772 KB Output is correct
23 Correct 5 ms 4180 KB Output is correct
24 Correct 5 ms 4180 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 5 ms 4564 KB Output is correct
28 Correct 5 ms 4272 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4180 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 69 ms 24592 KB Output is correct
37 Correct 1 ms 2772 KB Output is correct
38 Correct 74 ms 24376 KB Output is correct
39 Correct 64 ms 24172 KB Output is correct
40 Correct 76 ms 24636 KB Output is correct
41 Correct 81 ms 24780 KB Output is correct
42 Correct 55 ms 20116 KB Output is correct
43 Correct 64 ms 16756 KB Output is correct
44 Correct 76 ms 16352 KB Output is correct
45 Correct 73 ms 16420 KB Output is correct
46 Correct 69 ms 16456 KB Output is correct
47 Correct 55 ms 20092 KB Output is correct
48 Correct 56 ms 20044 KB Output is correct
49 Correct 74 ms 20284 KB Output is correct
50 Correct 71 ms 20300 KB Output is correct
51 Correct 72 ms 24644 KB Output is correct
52 Correct 75 ms 24640 KB Output is correct
53 Correct 90 ms 16752 KB Output is correct
54 Correct 91 ms 16796 KB Output is correct
55 Correct 85 ms 16392 KB Output is correct
56 Correct 75 ms 16472 KB Output is correct
57 Correct 70 ms 16476 KB Output is correct
58 Correct 69 ms 16544 KB Output is correct
59 Correct 64 ms 16468 KB Output is correct
60 Correct 65 ms 16808 KB Output is correct
61 Correct 58 ms 20180 KB Output is correct
62 Correct 57 ms 20292 KB Output is correct
63 Correct 58 ms 20340 KB Output is correct
64 Correct 61 ms 20392 KB Output is correct
65 Correct 78 ms 16464 KB Output is correct
66 Correct 99 ms 16456 KB Output is correct
67 Correct 112 ms 16392 KB Output is correct
68 Correct 56 ms 16856 KB Output is correct
69 Correct 64 ms 16860 KB Output is correct
70 Correct 68 ms 20468 KB Output is correct
71 Correct 73 ms 20196 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 5 ms 4052 KB Output is correct
74 Correct 5 ms 4052 KB Output is correct
75 Correct 2 ms 2772 KB Output is correct
76 Correct 1 ms 2792 KB Output is correct
77 Correct 5 ms 4488 KB Output is correct
78 Correct 5 ms 4152 KB Output is correct
79 Correct 4 ms 4180 KB Output is correct
80 Correct 5 ms 4180 KB Output is correct
81 Correct 2 ms 2772 KB Output is correct
82 Correct 1 ms 2772 KB Output is correct
83 Correct 1 ms 2772 KB Output is correct
84 Correct 1 ms 2772 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 27 ms 4180 KB Output is correct
87 Correct 27 ms 4180 KB Output is correct
88 Correct 28 ms 4140 KB Output is correct
89 Correct 5 ms 4564 KB Output is correct
90 Correct 5 ms 4180 KB Output is correct
91 Correct 28 ms 4180 KB Output is correct
92 Correct 26 ms 4220 KB Output is correct
93 Correct 2 ms 2772 KB Output is correct
94 Correct 70 ms 24552 KB Output is correct
95 Correct 66 ms 24464 KB Output is correct
96 Correct 62 ms 24124 KB Output is correct
97 Correct 73 ms 24628 KB Output is correct
98 Correct 78 ms 24652 KB Output is correct
99 Correct 76 ms 16352 KB Output is correct
100 Correct 67 ms 16436 KB Output is correct
101 Correct 70 ms 16444 KB Output is correct
102 Correct 63 ms 16800 KB Output is correct
103 Correct 57 ms 20100 KB Output is correct
104 Correct 57 ms 20300 KB Output is correct
105 Correct 58 ms 20044 KB Output is correct
106 Correct 73 ms 20420 KB Output is correct
107 Correct 72 ms 20304 KB Output is correct
108 Correct 72 ms 24640 KB Output is correct
109 Correct 76 ms 24728 KB Output is correct
110 Correct 76 ms 16796 KB Output is correct
111 Correct 73 ms 16844 KB Output is correct
112 Correct 76 ms 16356 KB Output is correct
113 Correct 76 ms 16460 KB Output is correct