oj.uz

Submission #825269

# Submission time Handle Problem Language Result Execution time Memory
825269 2023-08-14T16:32:25 Z QwertyPi Railway (BOI17_railway) C++14
100 / 100
 207 ms 26396 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 11;

vector<pair<int, int>> G[MAXN];
int op[MAXN], ed[MAXN], t = 0;
int anc[20][MAXN], dep[MAXN], ps[MAXN], id[MAXN];

void dfs(int v, int pa = -1){
	op[v] = ++t;
	for(auto [u, e] : G[v]){
		if(u != pa){
			id[u] = e; anc[0][u] = v; for(int j = 1; j < 20; j++) anc[j][u] = anc[j - 1][anc[j - 1][u]];
			dep[u] = dep[v] + 1;
			dfs(u, v);
		}
	}
	ed[v] = t;
}

void dfs_calc(int v, int pa = -1){
	for(auto [u, e] : G[v]){
		if(u == pa) continue;
		dfs_calc(u, v);
		ps[v] += ps[u];
	}
}

bool is_anc(int u, int v){
	return op[u] <= op[v] && ed[v] <= ed[u];
}

int kth_anc(int u, int k){
	for(int j = 19; j >= 0; j--){
		if((1 << j) & k) u = anc[j][u];
	}
	return u;
}

int lca(int u, int v){
	if(dep[u] < dep[v]) swap(u, v);
	u = kth_anc(u, dep[u] - dep[v]);
	for(int j = 19; j >= 0; j--){
		if(anc[j][u] != anc[j][v]){
			u = anc[j][u];
			v = anc[j][v];
		}
	}
	return u == v ? u : anc[0][u];
}

int32_t main(){
	int n, m, k; cin >> n >> m >> k;
	for(int i = 0; i < n - 1; i++){
		int u, v; cin >> u >> v;
		G[u].push_back({v, i + 1});
		G[v].push_back({u, i + 1});
	}
	dfs(1);
	for(int i = 0; i < m; i++){
		int k; cin >> k; vector<int> V;
		for(int j = 0; j < k; j++){
			int u; cin >> u; V.push_back(u);
		}
		sort(V.begin(), V.end(), [](int u, int v){ return op[u] < op[v]; });

		vector<int> st {};
		for(int i = 0; i < V.size(); i++){
			int v = V[i];
			if(st.empty() || is_anc(st.back(), v)){
				st.push_back(v);
				continue;
			}
			while(st.size() >= 2 && !is_anc(st[st.size() - 2], v)){
				ps[st[st.size() - 1]]++; ps[st[st.size() - 2]]--;
				st.pop_back();
			}
			int l = lca(st.back(), v);
			ps[st.back()]++; ps[l]--;
			if(st.size() >= 2 && st[st.size() - 2] == l){
				st.pop_back(); st.push_back(v);
			}else{
				st.pop_back(); st.push_back(l); st.push_back(v);
			}
		}
		ps[st.back()]++; ps[st.front()]--;
	}
	dfs_calc(1);
	vector<int> ans;
	for(int i = 2; i <= n; i++){
		if(ps[i] >= k) ans.push_back(id[i]);
	}
	sort(ans.begin(), ans.end());

	cout << ans.size() << endl;
	for(auto i : ans) cout << i << ' '; cout << endl;
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:12:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   12 |  for(auto [u, e] : G[v]){
      |           ^
railway.cpp: In function 'void dfs_calc(int, int)':
railway.cpp:23:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   23 |  for(auto [u, e] : G[v]){
      |           ^
railway.cpp: In function 'int32_t main()':
railway.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for(int i = 0; i < V.size(); i++){
      |                  ~~^~~~~~~~~~
railway.cpp:97:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   97 |  for(auto i : ans) cout << i << ' '; cout << endl;
      |  ^~~
railway.cpp:97:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   97 |  for(auto i : ans) cout << i << ' '; cout << endl;
      |                                      ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 7 ms 4200 KB Output is correct
3 Correct 8 ms 4168 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 8 ms 4584 KB Output is correct
7 Correct 8 ms 4180 KB Output is correct
8 Correct 7 ms 4200 KB Output is correct
9 Correct 7 ms 4180 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 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 7 ms 4200 KB Output is correct
3 Correct 8 ms 4168 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 8 ms 4584 KB Output is correct
7 Correct 8 ms 4180 KB Output is correct
8 Correct 7 ms 4200 KB Output is correct
9 Correct 7 ms 4180 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 41 ms 4468 KB Output is correct
16 Correct 35 ms 4584 KB Output is correct
17 Correct 36 ms 4580 KB Output is correct
18 Correct 8 ms 4564 KB Output is correct
19 Correct 7 ms 4204 KB Output is correct
20 Correct 44 ms 4632 KB Output is correct
21 Correct 49 ms 4624 KB Output is correct
22 Correct 1 ms 2772 KB Output is correct
23 Correct 7 ms 4208 KB Output is correct
24 Correct 7 ms 4200 KB Output is correct
25 Correct 1 ms 2772 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 8 ms 4564 KB Output is correct
28 Correct 8 ms 4180 KB Output is correct
29 Correct 7 ms 4208 KB Output is correct
30 Correct 7 ms 4156 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 0 ms 2772 KB Output is correct
34 Correct 1 ms 2656 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 97 ms 24264 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 95 ms 23836 KB Output is correct
4 Correct 95 ms 23308 KB Output is correct
5 Correct 94 ms 24256 KB Output is correct
6 Correct 103 ms 24424 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 19880 KB Output is correct
2 Correct 125 ms 16536 KB Output is correct
3 Correct 130 ms 16044 KB Output is correct
4 Correct 128 ms 16140 KB Output is correct
5 Correct 139 ms 16044 KB Output is correct
6 Correct 104 ms 20044 KB Output is correct
7 Correct 103 ms 20008 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 19880 KB Output is correct
2 Correct 125 ms 16536 KB Output is correct
3 Correct 130 ms 16044 KB Output is correct
4 Correct 128 ms 16140 KB Output is correct
5 Correct 139 ms 16044 KB Output is correct
6 Correct 104 ms 20044 KB Output is correct
7 Correct 103 ms 20008 KB Output is correct
8 Correct 113 ms 20056 KB Output is correct
9 Correct 167 ms 20136 KB Output is correct
10 Correct 90 ms 24412 KB Output is correct
11 Correct 89 ms 24412 KB Output is correct
12 Correct 143 ms 16332 KB Output is correct
13 Correct 118 ms 17720 KB Output is correct
14 Correct 140 ms 17832 KB Output is correct
15 Correct 126 ms 17804 KB Output is correct
16 Correct 200 ms 17872 KB Output is correct
17 Correct 136 ms 17976 KB Output is correct
18 Correct 128 ms 17932 KB Output is correct
19 Correct 118 ms 18316 KB Output is correct
20 Correct 113 ms 22044 KB Output is correct
21 Correct 105 ms 22216 KB Output is correct
22 Correct 114 ms 22040 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 7 ms 4200 KB Output is correct
3 Correct 8 ms 4168 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 8 ms 4584 KB Output is correct
7 Correct 8 ms 4180 KB Output is correct
8 Correct 7 ms 4200 KB Output is correct
9 Correct 7 ms 4180 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2772 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 41 ms 4468 KB Output is correct
16 Correct 35 ms 4584 KB Output is correct
17 Correct 36 ms 4580 KB Output is correct
18 Correct 8 ms 4564 KB Output is correct
19 Correct 7 ms 4204 KB Output is correct
20 Correct 44 ms 4632 KB Output is correct
21 Correct 49 ms 4624 KB Output is correct
22 Correct 1 ms 2772 KB Output is correct
23 Correct 7 ms 4208 KB Output is correct
24 Correct 7 ms 4200 KB Output is correct
25 Correct 1 ms 2772 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 8 ms 4564 KB Output is correct
28 Correct 8 ms 4180 KB Output is correct
29 Correct 7 ms 4208 KB Output is correct
30 Correct 7 ms 4156 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 0 ms 2772 KB Output is correct
34 Correct 1 ms 2656 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 97 ms 24264 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 95 ms 23836 KB Output is correct
39 Correct 95 ms 23308 KB Output is correct
40 Correct 94 ms 24256 KB Output is correct
41 Correct 103 ms 24424 KB Output is correct
42 Correct 103 ms 19880 KB Output is correct
43 Correct 125 ms 16536 KB Output is correct
44 Correct 130 ms 16044 KB Output is correct
45 Correct 128 ms 16140 KB Output is correct
46 Correct 139 ms 16044 KB Output is correct
47 Correct 104 ms 20044 KB Output is correct
48 Correct 103 ms 20008 KB Output is correct
49 Correct 113 ms 20056 KB Output is correct
50 Correct 167 ms 20136 KB Output is correct
51 Correct 90 ms 24412 KB Output is correct
52 Correct 89 ms 24412 KB Output is correct
53 Correct 143 ms 16332 KB Output is correct
54 Correct 118 ms 17720 KB Output is correct
55 Correct 140 ms 17832 KB Output is correct
56 Correct 126 ms 17804 KB Output is correct
57 Correct 200 ms 17872 KB Output is correct
58 Correct 136 ms 17976 KB Output is correct
59 Correct 128 ms 17932 KB Output is correct
60 Correct 118 ms 18316 KB Output is correct
61 Correct 113 ms 22044 KB Output is correct
62 Correct 105 ms 22216 KB Output is correct
63 Correct 114 ms 22040 KB Output is correct
64 Correct 133 ms 21968 KB Output is correct
65 Correct 173 ms 17928 KB Output is correct
66 Correct 207 ms 17864 KB Output is correct
67 Correct 183 ms 17792 KB Output is correct
68 Correct 118 ms 17644 KB Output is correct
69 Correct 180 ms 17572 KB Output is correct
70 Correct 129 ms 22324 KB Output is correct
71 Correct 150 ms 21716 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 8 ms 4200 KB Output is correct
74 Correct 11 ms 4180 KB Output is correct
75 Correct 2 ms 2772 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 8 ms 4584 KB Output is correct
78 Correct 8 ms 4180 KB Output is correct
79 Correct 7 ms 4180 KB Output is correct
80 Correct 7 ms 4180 KB Output is correct
81 Correct 2 ms 2652 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 2696 KB Output is correct
86 Correct 35 ms 4548 KB Output is correct
87 Correct 40 ms 4592 KB Output is correct
88 Correct 37 ms 4552 KB Output is correct
89 Correct 8 ms 4596 KB Output is correct
90 Correct 10 ms 4224 KB Output is correct
91 Correct 45 ms 4760 KB Output is correct
92 Correct 49 ms 4620 KB Output is correct
93 Correct 1 ms 2656 KB Output is correct
94 Correct 102 ms 26004 KB Output is correct
95 Correct 97 ms 25740 KB Output is correct
96 Correct 91 ms 25196 KB Output is correct
97 Correct 92 ms 25984 KB Output is correct
98 Correct 102 ms 26396 KB Output is correct
99 Correct 139 ms 17944 KB Output is correct
100 Correct 173 ms 17932 KB Output is correct
101 Correct 130 ms 17928 KB Output is correct
102 Correct 144 ms 18308 KB Output is correct
103 Correct 108 ms 21808 KB Output is correct
104 Correct 103 ms 22188 KB Output is correct
105 Correct 101 ms 21708 KB Output is correct
106 Correct 124 ms 21964 KB Output is correct
107 Correct 127 ms 21916 KB Output is correct
108 Correct 87 ms 26128 KB Output is correct
109 Correct 89 ms 26052 KB Output is correct
110 Correct 139 ms 17632 KB Output is correct
111 Correct 121 ms 17616 KB Output is correct
112 Correct 135 ms 17856 KB Output is correct
113 Correct 135 ms 17760 KB Output is correct