oj.uz

Submission #936007

# Submission time Handle Problem Language Result Execution time Memory
936007 2024-02-29T22:49:40 Z Litusiano Railway (BOI17_railway) C++17
100 / 100
 283 ms 66432 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; //parent
		dfs(v);
		if(SmtoLG[v].size() > SmtoLG[u].size()) swap(SmtoLG[u], SmtoLG[v]); // the nodes for which the node can pass
		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 = 2; i<=n; i++){
		//cout<<fromk[i]<<" ";
		if(fromk[i] >= k){
			// cerr<<i<<" "<<LC.jump[i][0]<<endl;
			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:107:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  107 |  for(int i : ans) cout<<i<<" "; cout<<endl;
      |  ^~~
railway.cpp:107:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  107 |  for(int i : ans) cout<<i<<" "; cout<<endl;
      |                                 ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 11 ms 4776 KB Output is correct
3 Correct 9 ms 4700 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 5468 KB Output is correct
7 Correct 9 ms 4956 KB Output is correct
8 Correct 8 ms 4952 KB Output is correct
9 Correct 9 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 1 ms 344 KB Output is correct
2 Correct 11 ms 4776 KB Output is correct
3 Correct 9 ms 4700 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 5468 KB Output is correct
7 Correct 9 ms 4956 KB Output is correct
8 Correct 8 ms 4952 KB Output is correct
9 Correct 9 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 34 ms 9044 KB Output is correct
16 Correct 40 ms 8992 KB Output is correct
17 Correct 32 ms 9040 KB Output is correct
18 Correct 10 ms 5468 KB Output is correct
19 Correct 9 ms 4924 KB Output is correct
20 Correct 39 ms 10704 KB Output is correct
21 Correct 40 ms 10576 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 9 ms 4712 KB Output is correct
24 Correct 9 ms 4696 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 448 KB Output is correct
27 Correct 10 ms 5464 KB Output is correct
28 Correct 9 ms 4952 KB Output is correct
29 Correct 9 ms 4968 KB Output is correct
30 Correct 13 ms 5212 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 456 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 58316 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 188 ms 57852 KB Output is correct
4 Correct 200 ms 57500 KB Output is correct
5 Correct 184 ms 56716 KB Output is correct
6 Correct 162 ms 56564 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 51920 KB Output is correct
2 Correct 200 ms 49792 KB Output is correct
3 Correct 223 ms 55676 KB Output is correct
4 Correct 212 ms 55600 KB Output is correct
5 Correct 210 ms 55936 KB Output is correct
6 Correct 186 ms 52032 KB Output is correct
7 Correct 155 ms 52088 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 51920 KB Output is correct
2 Correct 200 ms 49792 KB Output is correct
3 Correct 223 ms 55676 KB Output is correct
4 Correct 212 ms 55600 KB Output is correct
5 Correct 210 ms 55936 KB Output is correct
6 Correct 186 ms 52032 KB Output is correct
7 Correct 155 ms 52088 KB Output is correct
8 Correct 181 ms 51948 KB Output is correct
9 Correct 191 ms 51780 KB Output is correct
10 Correct 152 ms 56596 KB Output is correct
11 Correct 204 ms 56524 KB Output is correct
12 Correct 130 ms 49428 KB Output is correct
13 Correct 134 ms 50628 KB Output is correct
14 Correct 189 ms 52424 KB Output is correct
15 Correct 194 ms 52684 KB Output is correct
16 Correct 212 ms 58452 KB Output is correct
17 Correct 221 ms 58828 KB Output is correct
18 Correct 201 ms 56496 KB Output is correct
19 Correct 205 ms 51932 KB Output is correct
20 Correct 159 ms 54072 KB Output is correct
21 Correct 199 ms 54332 KB Output is correct
22 Correct 168 ms 54136 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 11 ms 4776 KB Output is correct
3 Correct 9 ms 4700 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 5468 KB Output is correct
7 Correct 9 ms 4956 KB Output is correct
8 Correct 8 ms 4952 KB Output is correct
9 Correct 9 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 34 ms 9044 KB Output is correct
16 Correct 40 ms 8992 KB Output is correct
17 Correct 32 ms 9040 KB Output is correct
18 Correct 10 ms 5468 KB Output is correct
19 Correct 9 ms 4924 KB Output is correct
20 Correct 39 ms 10704 KB Output is correct
21 Correct 40 ms 10576 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 9 ms 4712 KB Output is correct
24 Correct 9 ms 4696 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 448 KB Output is correct
27 Correct 10 ms 5464 KB Output is correct
28 Correct 9 ms 4952 KB Output is correct
29 Correct 9 ms 4968 KB Output is correct
30 Correct 13 ms 5212 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 456 KB Output is correct
36 Correct 177 ms 58316 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 188 ms 57852 KB Output is correct
39 Correct 200 ms 57500 KB Output is correct
40 Correct 184 ms 56716 KB Output is correct
41 Correct 162 ms 56564 KB Output is correct
42 Correct 157 ms 51920 KB Output is correct
43 Correct 200 ms 49792 KB Output is correct
44 Correct 223 ms 55676 KB Output is correct
45 Correct 212 ms 55600 KB Output is correct
46 Correct 210 ms 55936 KB Output is correct
47 Correct 186 ms 52032 KB Output is correct
48 Correct 155 ms 52088 KB Output is correct
49 Correct 181 ms 51948 KB Output is correct
50 Correct 191 ms 51780 KB Output is correct
51 Correct 152 ms 56596 KB Output is correct
52 Correct 204 ms 56524 KB Output is correct
53 Correct 130 ms 49428 KB Output is correct
54 Correct 134 ms 50628 KB Output is correct
55 Correct 189 ms 52424 KB Output is correct
56 Correct 194 ms 52684 KB Output is correct
57 Correct 212 ms 58452 KB Output is correct
58 Correct 221 ms 58828 KB Output is correct
59 Correct 201 ms 56496 KB Output is correct
60 Correct 205 ms 51932 KB Output is correct
61 Correct 159 ms 54072 KB Output is correct
62 Correct 199 ms 54332 KB Output is correct
63 Correct 168 ms 54136 KB Output is correct
64 Correct 177 ms 54228 KB Output is correct
65 Correct 283 ms 66432 KB Output is correct
66 Correct 246 ms 62048 KB Output is correct
67 Correct 203 ms 57032 KB Output is correct
68 Correct 143 ms 48360 KB Output is correct
69 Correct 137 ms 48456 KB Output is correct
70 Correct 216 ms 55748 KB Output is correct
71 Correct 168 ms 53912 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 9 ms 4656 KB Output is correct
74 Correct 11 ms 4700 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 9 ms 5464 KB Output is correct
78 Correct 12 ms 4956 KB Output is correct
79 Correct 8 ms 5032 KB Output is correct
80 Correct 11 ms 4956 KB Output is correct
81 Correct 0 ms 344 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 344 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 30 ms 9044 KB Output is correct
87 Correct 32 ms 9204 KB Output is correct
88 Correct 30 ms 9224 KB Output is correct
89 Correct 10 ms 5468 KB Output is correct
90 Correct 10 ms 4956 KB Output is correct
91 Correct 35 ms 10580 KB Output is correct
92 Correct 34 ms 10588 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 186 ms 60104 KB Output is correct
95 Correct 173 ms 59484 KB Output is correct
96 Correct 166 ms 59216 KB Output is correct
97 Correct 192 ms 58696 KB Output is correct
98 Correct 164 ms 58676 KB Output is correct
99 Correct 222 ms 61128 KB Output is correct
100 Correct 210 ms 58128 KB Output is correct
101 Correct 217 ms 58572 KB Output is correct
102 Correct 180 ms 51520 KB Output is correct
103 Correct 199 ms 53776 KB Output is correct
104 Correct 169 ms 54368 KB Output is correct
105 Correct 164 ms 53704 KB Output is correct
106 Correct 189 ms 54244 KB Output is correct
107 Correct 174 ms 54212 KB Output is correct
108 Correct 153 ms 58316 KB Output is correct
109 Correct 181 ms 58396 KB Output is correct
110 Correct 123 ms 50636 KB Output is correct
111 Correct 146 ms 50844 KB Output is correct
112 Correct 197 ms 52324 KB Output is correct
113 Correct 208 ms 52240 KB Output is correct