oj.uz

Submission #936008

# Submission time Handle Problem Language Result Execution time Memory
936008 2024-02-29T22:51:07 Z Litusiano Railway (BOI17_railway) C++17
100 / 100
 317 ms 64860 KB 
#include<bits/stdc++.h>
using namespace std;
 
struct LCA{
	int n;
	vector<vector<int>> jump;
	vector<int> dep;
	void dfs(int u, int p, int d, vector<vector<int>>& G, vector<int>& used){
		if(used[u]) return;
		dep[u] = d;
		used[u] = 1;
		jump[u][0] = p;
		for(int v : G[u]) dfs(v,u,d+1,G,used);
	}
	void init(int n1, vector<vector<int>>& G){
		n = n1;
		jump.assign(n+1,vector<int>(25,1));
		dep.assign(n+1,0);
		vector<int> used(n+1,0);
		dfs(1,1,0,G,used);
		for(int k = 1; k<25; k++){
			for(int u = 1; u<=n; u++){
				jump[u][k] = jump[jump[u][k-1]][k-1];
			}
		}
	}
	int LCAA(int a, int b){
		if(dep[a] > dep[b]) swap(a,b);
		int x = dep[b]-dep[a];
		for(int i = 0; i<25; i++){
			if(x & (1<<i)){
				b = jump[b][i];
			}
		}
		if(a == b) return a;
		for(int i = 24; i>=0; i--){
			if(jump[a][i] != jump[b][i]){
				a = jump[a][i];
				b = jump[b][i];
			}
		}
		return jump[a][0];
	}
};
 
int n,m,k;
vector<vector<int>> G;
vector<vector<int>> isLCA, FromU;
vector<set<int>> SmtoLG;
vector<int> used, fromk;
 
void dfs(int u){
	if(used[u]) return;
	used[u] = 1;
	for(int v : G[u]){
		if(used[v]) continue;
		dfs(v);
		if(SmtoLG[v].size() > SmtoLG[u].size()) swap(SmtoLG[u], SmtoLG[v]);
		for(auto x : SmtoLG[v]) SmtoLG[u].insert(x);
	}
	for(auto x : FromU[u]) SmtoLG[u].insert(x);
	for(auto x : isLCA[u]) SmtoLG[u].erase(x);
	fromk[u] = SmtoLG[u].size();
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m>>k;
	G.assign(n+1,vector<int>()); isLCA = G; FromU = isLCA;
	map<pair<int,int>,int> edge;
	for(int i = 1; i<n; i++){
		int u,v; cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
		pair<int,int> p = {u,v};
		edge[p] = i;
		swap(p.first,p.second);
		edge[p] = i;
	}
	LCA LC; LC.init(n,G);
	for(int i = 0; i<m; i++){
		int x; cin>>x;
		int a,b; cin>>a>>b;
		FromU[a].push_back(i); FromU[b].push_back(i);
		int lc = LC.LCAA(a,b);
		for(int j = 0; j<x-2; j++){
			int c; cin>>c;
			FromU[c].push_back(i);
			lc = LC.LCAA(lc,c);
		}
		isLCA[lc].push_back(i);
	}
	SmtoLG.resize(n+1);
	used.assign(n+1,0); fromk = used;
	dfs(1);
	vector<int> ans;
	for(int i = 1; i<=n; i++){
		//cout<<fromk[i]<<" ";
		if(fromk[i] >= k){
			ans.push_back(edge[{i, LC.jump[i][0]}]);
		}
	}
  	sort(ans.begin(),ans.end());
	cout<<ans.size()<<endl;
	for(int i : ans) cout<<i<<" "; cout<<endl;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:106:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  106 |  for(int i : ans) cout<<i<<" "; cout<<endl;
      |  ^~~
railway.cpp:106:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  106 |  for(int i : ans) cout<<i<<" "; cout<<endl;
      |                                 ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 4700 KB Output is correct
3 Correct 9 ms 4696 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 5212 KB Output is correct
7 Correct 9 ms 4800 KB Output is correct
8 Correct 8 ms 4700 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 4700 KB Output is correct
3 Correct 9 ms 4696 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 5212 KB Output is correct
7 Correct 9 ms 4800 KB Output is correct
8 Correct 8 ms 4700 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 31 ms 8528 KB Output is correct
16 Correct 31 ms 8528 KB Output is correct
17 Correct 33 ms 8788 KB Output is correct
18 Correct 10 ms 5208 KB Output is correct
19 Correct 10 ms 4956 KB Output is correct
20 Correct 35 ms 10124 KB Output is correct
21 Correct 35 ms 10328 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 10 ms 4700 KB Output is correct
24 Correct 9 ms 4700 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 5468 KB Output is correct
28 Correct 9 ms 4700 KB Output is correct
29 Correct 8 ms 4700 KB Output is correct
30 Correct 9 ms 4728 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 58240 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 179 ms 57860 KB Output is correct
4 Correct 159 ms 57544 KB Output is correct
5 Correct 175 ms 56776 KB Output is correct
6 Correct 163 ms 56516 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 51816 KB Output is correct
2 Correct 188 ms 49868 KB Output is correct
3 Correct 217 ms 55632 KB Output is correct
4 Correct 198 ms 55548 KB Output is correct
5 Correct 205 ms 55848 KB Output is correct
6 Correct 154 ms 52172 KB Output is correct
7 Correct 156 ms 52080 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 51816 KB Output is correct
2 Correct 188 ms 49868 KB Output is correct
3 Correct 217 ms 55632 KB Output is correct
4 Correct 198 ms 55548 KB Output is correct
5 Correct 205 ms 55848 KB Output is correct
6 Correct 154 ms 52172 KB Output is correct
7 Correct 156 ms 52080 KB Output is correct
8 Correct 177 ms 52164 KB Output is correct
9 Correct 170 ms 51736 KB Output is correct
10 Correct 154 ms 56420 KB Output is correct
11 Correct 146 ms 56452 KB Output is correct
12 Correct 142 ms 49484 KB Output is correct
13 Correct 140 ms 49356 KB Output is correct
14 Correct 177 ms 50632 KB Output is correct
15 Correct 225 ms 50940 KB Output is correct
16 Correct 203 ms 56520 KB Output is correct
17 Correct 201 ms 57036 KB Output is correct
18 Correct 193 ms 54732 KB Output is correct
19 Correct 183 ms 50160 KB Output is correct
20 Correct 168 ms 52172 KB Output is correct
21 Correct 164 ms 52456 KB Output is correct
22 Correct 164 ms 52420 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 4700 KB Output is correct
3 Correct 9 ms 4696 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 5212 KB Output is correct
7 Correct 9 ms 4800 KB Output is correct
8 Correct 8 ms 4700 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 31 ms 8528 KB Output is correct
16 Correct 31 ms 8528 KB Output is correct
17 Correct 33 ms 8788 KB Output is correct
18 Correct 10 ms 5208 KB Output is correct
19 Correct 10 ms 4956 KB Output is correct
20 Correct 35 ms 10124 KB Output is correct
21 Correct 35 ms 10328 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 10 ms 4700 KB Output is correct
24 Correct 9 ms 4700 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 5468 KB Output is correct
28 Correct 9 ms 4700 KB Output is correct
29 Correct 8 ms 4700 KB Output is correct
30 Correct 9 ms 4728 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 185 ms 58240 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 179 ms 57860 KB Output is correct
39 Correct 159 ms 57544 KB Output is correct
40 Correct 175 ms 56776 KB Output is correct
41 Correct 163 ms 56516 KB Output is correct
42 Correct 167 ms 51816 KB Output is correct
43 Correct 188 ms 49868 KB Output is correct
44 Correct 217 ms 55632 KB Output is correct
45 Correct 198 ms 55548 KB Output is correct
46 Correct 205 ms 55848 KB Output is correct
47 Correct 154 ms 52172 KB Output is correct
48 Correct 156 ms 52080 KB Output is correct
49 Correct 177 ms 52164 KB Output is correct
50 Correct 170 ms 51736 KB Output is correct
51 Correct 154 ms 56420 KB Output is correct
52 Correct 146 ms 56452 KB Output is correct
53 Correct 142 ms 49484 KB Output is correct
54 Correct 140 ms 49356 KB Output is correct
55 Correct 177 ms 50632 KB Output is correct
56 Correct 225 ms 50940 KB Output is correct
57 Correct 203 ms 56520 KB Output is correct
58 Correct 201 ms 57036 KB Output is correct
59 Correct 193 ms 54732 KB Output is correct
60 Correct 183 ms 50160 KB Output is correct
61 Correct 168 ms 52172 KB Output is correct
62 Correct 164 ms 52456 KB Output is correct
63 Correct 164 ms 52420 KB Output is correct
64 Correct 168 ms 52424 KB Output is correct
65 Correct 317 ms 64860 KB Output is correct
66 Correct 244 ms 60452 KB Output is correct
67 Correct 214 ms 55256 KB Output is correct
68 Correct 131 ms 47320 KB Output is correct
69 Correct 135 ms 47280 KB Output is correct
70 Correct 191 ms 53844 KB Output is correct
71 Correct 169 ms 52072 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 12 ms 4728 KB Output is correct
74 Correct 9 ms 4696 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 10 ms 5208 KB Output is correct
78 Correct 9 ms 4700 KB Output is correct
79 Correct 8 ms 4736 KB Output is correct
80 Correct 9 ms 4956 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 31 ms 8748 KB Output is correct
87 Correct 33 ms 8532 KB Output is correct
88 Correct 31 ms 8796 KB Output is correct
89 Correct 9 ms 5212 KB Output is correct
90 Correct 10 ms 4956 KB Output is correct
91 Correct 39 ms 10048 KB Output is correct
92 Correct 33 ms 10076 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 183 ms 58368 KB Output is correct
95 Correct 171 ms 57832 KB Output is correct
96 Correct 178 ms 57548 KB Output is correct
97 Correct 171 ms 56652 KB Output is correct
98 Correct 147 ms 56504 KB Output is correct
99 Correct 222 ms 59712 KB Output is correct
100 Correct 201 ms 56372 KB Output is correct
101 Correct 218 ms 56872 KB Output is correct
102 Correct 192 ms 49644 KB Output is correct
103 Correct 157 ms 52064 KB Output is correct
104 Correct 166 ms 52424 KB Output is correct
105 Correct 161 ms 51912 KB Output is correct
106 Correct 168 ms 52424 KB Output is correct
107 Correct 222 ms 52204 KB Output is correct
108 Correct 152 ms 56700 KB Output is correct
109 Correct 150 ms 56516 KB Output is correct
110 Correct 140 ms 49308 KB Output is correct
111 Correct 134 ms 49360 KB Output is correct
112 Correct 191 ms 50664 KB Output is correct
113 Correct 194 ms 50888 KB Output is correct