oj.uz

Submission #866427

# Submission time Handle Problem Language Result Execution time Memory
866427 2023-10-26T06:22:00 Z serifefedartar Railway (BOI17_railway) C++17
100 / 100
 81 ms 26064 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 20; 
const ll MAXN = 1e5 + 5;

vector<vector<pair<int,int>>> graph;
vector<int> ans;
int tin[MAXN], tout[MAXN], depth[MAXN], up[LOGN][MAXN];
int T = 0, val[MAXN], k;
void dfs(int node, int parent) {
	tin[node] = ++T;
	for (auto u : graph[node]) {
		if (u.f == parent)
			continue;
		depth[u.f] = depth[node] + 1;
		up[0][u.f] = node;
		for (int i = 1; i < LOGN; i++)
			up[i][u.f] = up[i-1][up[i-1][u.f]];
		dfs(u.f, node);
	}
	tout[node] = T;
}

int find(int node, int k) {
	for (int i = 0; i < LOGN; i++) {
		if ((1<<i) & k)
			node = up[i][node];
	}
	return node;
}

int lca(int a, int b) {
	if (depth[b] > depth[a])
		swap(a, b);
	a = find(a, depth[a] - depth[b]);
	if (a == b)
		return a;

	for (int i = LOGN - 1; i >= 0; i--) {
		if (up[i][a] != up[i][b]) {
			a = up[i][a];
			b = up[i][b];
		}
	}
	return up[0][a];
}

int dfs2(int node, int parent_edge) {
	for (auto u : graph[node]) {
		if (u.s != parent_edge)
			val[node] += dfs2(u.f, u.s);
	}

	if (val[node] >= 2 * k && node != 1)
		ans.push_back(parent_edge);
	return val[node];
}

int main() {
	fast
	int n, m, a, b;
	cin >> n >> m >> k;

	graph = vector<vector<pair<int,int>>>(n+1, vector<pair<int,int>>());
	for (int i = 1; i < n; i++) {
		cin >> a >> b;
		graph[a].push_back({b, i});
		graph[b].push_back({a, i});
	}
	for (int i = 0; i < LOGN; i++)
		up[i][1] = 1;
	dfs(1, 1);

	int q, p;
	for (int i = 0; i < m; i++) {
		cin >> q;
		vector<int> all;
		for (int j = 0; j < q; j++) {
			cin >> p;
			all.push_back(p);
		}
		sort(all.begin(), all.end(), [&](int a, int b) {
			return tin[a] < tin[b];
		});
		all.push_back(all[0]); 

		for (int i = 1; i < all.size(); i++) {
			int lowest = lca(all[i-1], all[i]);
			val[lowest] -= 2;
			val[all[i-1]]++;
			val[all[i]]++;
		}
	}
	dfs2(1, -1);

	sort(ans.begin(), ans.end());
	cout << ans.size() << "\n";
	for (auto u : ans)
		cout << u << " ";
	cout << "\n";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:93:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for (int i = 1; i < all.size(); i++) {
      |                   ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 4 ms 9308 KB Output is correct
3 Correct 5 ms 9304 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 4 ms 9852 KB Output is correct
7 Correct 4 ms 9564 KB Output is correct
8 Correct 3 ms 9308 KB Output is correct
9 Correct 4 ms 9308 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8672 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 4 ms 9308 KB Output is correct
3 Correct 5 ms 9304 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 4 ms 9852 KB Output is correct
7 Correct 4 ms 9564 KB Output is correct
8 Correct 3 ms 9308 KB Output is correct
9 Correct 4 ms 9308 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8672 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 15 ms 9820 KB Output is correct
16 Correct 15 ms 9820 KB Output is correct
17 Correct 15 ms 9820 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9436 KB Output is correct
20 Correct 15 ms 10076 KB Output is correct
21 Correct 16 ms 9820 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 4 ms 9308 KB Output is correct
24 Correct 4 ms 9432 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 4 ms 9880 KB Output is correct
28 Correct 4 ms 9564 KB Output is correct
29 Correct 3 ms 9308 KB Output is correct
30 Correct 4 ms 9308 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8792 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 24008 KB Output is correct
2 Correct 1 ms 8536 KB Output is correct
3 Correct 58 ms 25380 KB Output is correct
4 Correct 57 ms 24920 KB Output is correct
5 Correct 54 ms 25804 KB Output is correct
6 Correct 55 ms 25996 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 19468 KB Output is correct
2 Correct 59 ms 16316 KB Output is correct
3 Correct 56 ms 15708 KB Output is correct
4 Correct 62 ms 15772 KB Output is correct
5 Correct 54 ms 15700 KB Output is correct
6 Correct 53 ms 19704 KB Output is correct
7 Correct 56 ms 19560 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 19468 KB Output is correct
2 Correct 59 ms 16316 KB Output is correct
3 Correct 56 ms 15708 KB Output is correct
4 Correct 62 ms 15772 KB Output is correct
5 Correct 54 ms 15700 KB Output is correct
6 Correct 53 ms 19704 KB Output is correct
7 Correct 56 ms 19560 KB Output is correct
8 Correct 66 ms 19716 KB Output is correct
9 Correct 53 ms 21584 KB Output is correct
10 Correct 52 ms 25756 KB Output is correct
11 Correct 53 ms 25796 KB Output is correct
12 Correct 57 ms 17488 KB Output is correct
13 Correct 36 ms 17484 KB Output is correct
14 Correct 52 ms 17536 KB Output is correct
15 Correct 58 ms 17488 KB Output is correct
16 Correct 63 ms 17500 KB Output is correct
17 Correct 78 ms 17556 KB Output is correct
18 Correct 58 ms 17492 KB Output is correct
19 Correct 59 ms 18260 KB Output is correct
20 Correct 56 ms 21844 KB Output is correct
21 Correct 53 ms 21792 KB Output is correct
22 Correct 58 ms 21844 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 4 ms 9308 KB Output is correct
3 Correct 5 ms 9304 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 4 ms 9852 KB Output is correct
7 Correct 4 ms 9564 KB Output is correct
8 Correct 3 ms 9308 KB Output is correct
9 Correct 4 ms 9308 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8672 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 15 ms 9820 KB Output is correct
16 Correct 15 ms 9820 KB Output is correct
17 Correct 15 ms 9820 KB Output is correct
18 Correct 5 ms 9820 KB Output is correct
19 Correct 5 ms 9436 KB Output is correct
20 Correct 15 ms 10076 KB Output is correct
21 Correct 16 ms 9820 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 4 ms 9308 KB Output is correct
24 Correct 4 ms 9432 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 4 ms 9880 KB Output is correct
28 Correct 4 ms 9564 KB Output is correct
29 Correct 3 ms 9308 KB Output is correct
30 Correct 4 ms 9308 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8792 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 63 ms 24008 KB Output is correct
37 Correct 1 ms 8536 KB Output is correct
38 Correct 58 ms 25380 KB Output is correct
39 Correct 57 ms 24920 KB Output is correct
40 Correct 54 ms 25804 KB Output is correct
41 Correct 55 ms 25996 KB Output is correct
42 Correct 50 ms 19468 KB Output is correct
43 Correct 59 ms 16316 KB Output is correct
44 Correct 56 ms 15708 KB Output is correct
45 Correct 62 ms 15772 KB Output is correct
46 Correct 54 ms 15700 KB Output is correct
47 Correct 53 ms 19704 KB Output is correct
48 Correct 56 ms 19560 KB Output is correct
49 Correct 66 ms 19716 KB Output is correct
50 Correct 53 ms 21584 KB Output is correct
51 Correct 52 ms 25756 KB Output is correct
52 Correct 53 ms 25796 KB Output is correct
53 Correct 57 ms 17488 KB Output is correct
54 Correct 36 ms 17484 KB Output is correct
55 Correct 52 ms 17536 KB Output is correct
56 Correct 58 ms 17488 KB Output is correct
57 Correct 63 ms 17500 KB Output is correct
58 Correct 78 ms 17556 KB Output is correct
59 Correct 58 ms 17492 KB Output is correct
60 Correct 59 ms 18260 KB Output is correct
61 Correct 56 ms 21844 KB Output is correct
62 Correct 53 ms 21792 KB Output is correct
63 Correct 58 ms 21844 KB Output is correct
64 Correct 53 ms 21804 KB Output is correct
65 Correct 81 ms 17680 KB Output is correct
66 Correct 55 ms 17496 KB Output is correct
67 Correct 52 ms 17488 KB Output is correct
68 Correct 40 ms 17232 KB Output is correct
69 Correct 37 ms 17244 KB Output is correct
70 Correct 56 ms 22016 KB Output is correct
71 Correct 65 ms 21496 KB Output is correct
72 Correct 1 ms 8540 KB Output is correct
73 Correct 4 ms 9296 KB Output is correct
74 Correct 4 ms 9304 KB Output is correct
75 Correct 1 ms 8540 KB Output is correct
76 Correct 1 ms 8540 KB Output is correct
77 Correct 4 ms 9820 KB Output is correct
78 Correct 4 ms 9372 KB Output is correct
79 Correct 4 ms 9468 KB Output is correct
80 Correct 5 ms 9304 KB Output is correct
81 Correct 1 ms 8540 KB Output is correct
82 Correct 1 ms 8540 KB Output is correct
83 Correct 1 ms 8540 KB Output is correct
84 Correct 1 ms 8540 KB Output is correct
85 Correct 2 ms 8540 KB Output is correct
86 Correct 18 ms 9880 KB Output is correct
87 Correct 15 ms 9820 KB Output is correct
88 Correct 15 ms 9808 KB Output is correct
89 Correct 5 ms 9820 KB Output is correct
90 Correct 4 ms 9560 KB Output is correct
91 Correct 15 ms 10076 KB Output is correct
92 Correct 16 ms 9944 KB Output is correct
93 Correct 1 ms 8540 KB Output is correct
94 Correct 61 ms 25752 KB Output is correct
95 Correct 56 ms 25296 KB Output is correct
96 Correct 56 ms 24920 KB Output is correct
97 Correct 58 ms 25800 KB Output is correct
98 Correct 58 ms 26064 KB Output is correct
99 Correct 62 ms 17700 KB Output is correct
100 Correct 62 ms 17488 KB Output is correct
101 Correct 55 ms 17488 KB Output is correct
102 Correct 53 ms 18004 KB Output is correct
103 Correct 50 ms 21584 KB Output is correct
104 Correct 56 ms 21964 KB Output is correct
105 Correct 54 ms 21328 KB Output is correct
106 Correct 67 ms 21660 KB Output is correct
107 Correct 56 ms 21476 KB Output is correct
108 Correct 54 ms 25804 KB Output is correct
109 Correct 53 ms 25900 KB Output is correct
110 Correct 38 ms 17488 KB Output is correct
111 Correct 37 ms 17496 KB Output is correct
112 Correct 51 ms 17532 KB Output is correct
113 Correct 58 ms 17492 KB Output is correct