oj.uz

Submission #230894

# Submission time Handle Problem Language Result Execution time Memory
230894 2020-05-11T23:18:53 Z eohomegrownapps Railway (BOI17_railway) C++14
100 / 100
 241 ms 45048 KB 
#include <bits/stdc++.h>
using namespace std;
 
vector<vector<pair<int,int>>> adjlist;
vector<int> depth;
vector<set<int>*> sets;
vector<vector<int>> nadd;
vector<vector<int>> nremove;
vector<int> ans;
int pk[100000][20];
int n,k;
 
void dfs(int node, int parent){
	for (auto p : adjlist[node]){
		if (p.first==parent){continue;}
		int i=p.first;
		pk[i][0]=node;
		depth[i]=depth[node]+1;
		dfs(i,node);
	}
}
 
void decom2k(){
	for (int i = 1; i<20; i++){
		for (int j = 0; j<n; j++){
			if (pk[j][i-1]!=-1){
				pk[j][i]=pk[pk[j][i-1]][i-1];
			}
		}
	}
}
 
int lca(int a, int b){
	//wlog a deeper
	if (depth[b]>depth[a]){
		swap(a,b);
	}
	for (int i = 19; i>=0; i--){
		if (pk[a][i]==-1){continue;}
		if (depth[pk[a][i]]>=depth[b]){
			a=pk[a][i];
		}
	}
	if (a==b){
		return a;
	}
	for (int i = 19; i>=0; i--){
		if (pk[a][i]==-1){continue;}
		if (pk[a][i]!=pk[b][i]){
			a=pk[a][i];b=pk[b][i];
		}
	}
	return pk[a][0];
}
 
void setdfs(int node, int parent){
	if (parent!=-1&&adjlist[node].size()==1&&adjlist[node][0].first==parent){
		sets[node] = new set<int>();
		for (int i : nadd[node]){
			sets[node]->insert(i);
		}
		for (int i : nremove[node]){
			sets[node]->erase(i);
		}
		return;
	}
	int largestset = -1;
	int largestnode = -1;
	for (auto p : adjlist[node]){
		if (p.first==parent){continue;}
		setdfs(p.first,node);
		int s = sets[p.first]->size();
		if (s>=k){
			ans.push_back(p.second);
		}
		if (s>largestset){
			largestnode=p.first;
			largestset=s;
		}
	}
	for (auto p : adjlist[node]){
		if (p.first==parent){continue;}
		if (p.first==largestnode){continue;}
		sets[largestnode]->insert(sets[p.first]->begin(), sets[p.first]->end());
	}
	sets[node]=sets[largestnode];
	for (int i : nadd[node]){
		sets[node]->insert(i);
	}
	for (int i : nremove[node]){
		sets[node]->erase(i);
	}
}
 
int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int m;
	cin>>n>>m>>k;
	adjlist.resize(n);
	depth.resize(n,0);
	nadd.resize(n);
	nremove.resize(n);
	sets.resize(n);
	for (int i = 0; i<n-1; i++){
		int a,b;
		cin>>a>>b;
		a--;b--;
		adjlist[a].push_back({b,i});
		adjlist[b].push_back({a,i});
	}
	pk[0][0]=-1;
	dfs(0,-1);
	decom2k();
	for (int i = 0; i<m; i++){
		int num;
		cin>>num;
		int prevlca = -1;
		for (int j = 0; j<num; j++){
			int x;
			cin>>x;
			x--;
			nadd[x].push_back(i);
			if (prevlca==-1){
				prevlca=x;
			} else {
				prevlca=lca(prevlca,x);
			}
		}
		//cout<<prevlca<<endl;
		nremove[prevlca].push_back(i);
	}
	setdfs(0,-1);
	sort(ans.begin(),ans.end());
	cout<<ans.size()<<'\n';
	for (int i : ans){
		cout<<i+1<<" ";
	}cout<<'\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 2816 KB Output is correct
3 Correct 10 ms 2816 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 3456 KB Output is correct
7 Correct 10 ms 2944 KB Output is correct
8 Correct 10 ms 3200 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 2816 KB Output is correct
3 Correct 10 ms 2816 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 3456 KB Output is correct
7 Correct 10 ms 2944 KB Output is correct
8 Correct 10 ms 3200 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 46 ms 6648 KB Output is correct
16 Correct 45 ms 6776 KB Output is correct
17 Correct 46 ms 6776 KB Output is correct
18 Correct 11 ms 3456 KB Output is correct
19 Correct 11 ms 3072 KB Output is correct
20 Correct 54 ms 8568 KB Output is correct
21 Correct 54 ms 8568 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 10 ms 2816 KB Output is correct
24 Correct 10 ms 2816 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 11 ms 3456 KB Output is correct
28 Correct 10 ms 2944 KB Output is correct
29 Correct 10 ms 3328 KB Output is correct
30 Correct 11 ms 3328 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 37232 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 196 ms 37108 KB Output is correct
4 Correct 204 ms 36732 KB Output is correct
5 Correct 165 ms 35608 KB Output is correct
6 Correct 147 ms 35320 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 32376 KB Output is correct
2 Correct 161 ms 30328 KB Output is correct
3 Correct 190 ms 34140 KB Output is correct
4 Correct 170 ms 36340 KB Output is correct
5 Correct 177 ms 35992 KB Output is correct
6 Correct 136 ms 32504 KB Output is correct
7 Correct 135 ms 32632 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 32376 KB Output is correct
2 Correct 161 ms 30328 KB Output is correct
3 Correct 190 ms 34140 KB Output is correct
4 Correct 170 ms 36340 KB Output is correct
5 Correct 177 ms 35992 KB Output is correct
6 Correct 136 ms 32504 KB Output is correct
7 Correct 135 ms 32632 KB Output is correct
8 Correct 151 ms 33144 KB Output is correct
9 Correct 142 ms 32892 KB Output is correct
10 Correct 143 ms 35288 KB Output is correct
11 Correct 139 ms 35316 KB Output is correct
12 Correct 127 ms 33528 KB Output is correct
13 Correct 125 ms 33528 KB Output is correct
14 Correct 155 ms 31480 KB Output is correct
15 Correct 151 ms 31608 KB Output is correct
16 Correct 177 ms 37456 KB Output is correct
17 Correct 175 ms 36008 KB Output is correct
18 Correct 164 ms 35676 KB Output is correct
19 Correct 156 ms 31224 KB Output is correct
20 Correct 137 ms 33016 KB Output is correct
21 Correct 136 ms 33140 KB Output is correct
22 Correct 134 ms 33400 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 2816 KB Output is correct
3 Correct 10 ms 2816 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 11 ms 3456 KB Output is correct
7 Correct 10 ms 2944 KB Output is correct
8 Correct 10 ms 3200 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 46 ms 6648 KB Output is correct
16 Correct 45 ms 6776 KB Output is correct
17 Correct 46 ms 6776 KB Output is correct
18 Correct 11 ms 3456 KB Output is correct
19 Correct 11 ms 3072 KB Output is correct
20 Correct 54 ms 8568 KB Output is correct
21 Correct 54 ms 8568 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 10 ms 2816 KB Output is correct
24 Correct 10 ms 2816 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 11 ms 3456 KB Output is correct
28 Correct 10 ms 2944 KB Output is correct
29 Correct 10 ms 3328 KB Output is correct
30 Correct 11 ms 3328 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 202 ms 37232 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 196 ms 37108 KB Output is correct
39 Correct 204 ms 36732 KB Output is correct
40 Correct 165 ms 35608 KB Output is correct
41 Correct 147 ms 35320 KB Output is correct
42 Correct 142 ms 32376 KB Output is correct
43 Correct 161 ms 30328 KB Output is correct
44 Correct 190 ms 34140 KB Output is correct
45 Correct 170 ms 36340 KB Output is correct
46 Correct 177 ms 35992 KB Output is correct
47 Correct 136 ms 32504 KB Output is correct
48 Correct 135 ms 32632 KB Output is correct
49 Correct 151 ms 33144 KB Output is correct
50 Correct 142 ms 32892 KB Output is correct
51 Correct 143 ms 35288 KB Output is correct
52 Correct 139 ms 35316 KB Output is correct
53 Correct 127 ms 33528 KB Output is correct
54 Correct 125 ms 33528 KB Output is correct
55 Correct 155 ms 31480 KB Output is correct
56 Correct 151 ms 31608 KB Output is correct
57 Correct 177 ms 37456 KB Output is correct
58 Correct 175 ms 36008 KB Output is correct
59 Correct 164 ms 35676 KB Output is correct
60 Correct 156 ms 31224 KB Output is correct
61 Correct 137 ms 33016 KB Output is correct
62 Correct 136 ms 33140 KB Output is correct
63 Correct 134 ms 33400 KB Output is correct
64 Correct 167 ms 33016 KB Output is correct
65 Correct 241 ms 45048 KB Output is correct
66 Correct 209 ms 41208 KB Output is correct
67 Correct 189 ms 36384 KB Output is correct
68 Correct 117 ms 31480 KB Output is correct
69 Correct 114 ms 31480 KB Output is correct
70 Correct 166 ms 34164 KB Output is correct
71 Correct 145 ms 33016 KB Output is correct
72 Correct 5 ms 384 KB Output is correct
73 Correct 11 ms 2944 KB Output is correct
74 Correct 10 ms 2944 KB Output is correct
75 Correct 5 ms 512 KB Output is correct
76 Correct 4 ms 384 KB Output is correct
77 Correct 11 ms 3456 KB Output is correct
78 Correct 10 ms 2944 KB Output is correct
79 Correct 10 ms 3328 KB Output is correct
80 Correct 11 ms 3328 KB Output is correct
81 Correct 5 ms 384 KB Output is correct
82 Correct 5 ms 384 KB Output is correct
83 Correct 5 ms 384 KB Output is correct
84 Correct 4 ms 384 KB Output is correct
85 Correct 5 ms 384 KB Output is correct
86 Correct 45 ms 6904 KB Output is correct
87 Correct 47 ms 6904 KB Output is correct
88 Correct 46 ms 7040 KB Output is correct
89 Correct 12 ms 3456 KB Output is correct
90 Correct 11 ms 3072 KB Output is correct
91 Correct 57 ms 8696 KB Output is correct
92 Correct 56 ms 8696 KB Output is correct
93 Correct 4 ms 384 KB Output is correct
94 Correct 203 ms 37364 KB Output is correct
95 Correct 195 ms 37108 KB Output is correct
96 Correct 193 ms 36600 KB Output is correct
97 Correct 166 ms 35608 KB Output is correct
98 Correct 145 ms 35344 KB Output is correct
99 Correct 187 ms 40052 KB Output is correct
100 Correct 173 ms 36852 KB Output is correct
101 Correct 182 ms 37596 KB Output is correct
102 Correct 151 ms 30712 KB Output is correct
103 Correct 133 ms 32120 KB Output is correct
104 Correct 138 ms 33140 KB Output is correct
105 Correct 133 ms 32072 KB Output is correct
106 Correct 144 ms 33212 KB Output is correct
107 Correct 143 ms 33144 KB Output is correct
108 Correct 139 ms 35316 KB Output is correct
109 Correct 141 ms 35316 KB Output is correct
110 Correct 126 ms 33528 KB Output is correct
111 Correct 127 ms 33528 KB Output is correct
112 Correct 149 ms 31480 KB Output is correct
113 Correct 149 ms 31480 KB Output is correct