oj.uz

Submission #230879

# Submission time Handle Problem Language Result Execution time Memory
230879 2020-05-11T23:05:58 Z eohomegrownapps Railway (BOI17_railway) C++14
23 / 100
 1000 ms 35704 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==largestset){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 2944 KB Output is correct
3 Correct 11 ms 2816 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 51 ms 3416 KB Output is correct
7 Correct 11 ms 2944 KB Output is correct
8 Correct 10 ms 3328 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 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 2944 KB Output is correct
3 Correct 11 ms 2816 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 51 ms 3416 KB Output is correct
7 Correct 11 ms 2944 KB Output is correct
8 Correct 10 ms 3328 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 52 ms 7160 KB Output is correct
16 Correct 51 ms 7160 KB Output is correct
17 Correct 53 ms 7160 KB Output is correct
18 Correct 206 ms 3552 KB Output is correct
19 Correct 26 ms 3072 KB Output is correct
20 Correct 56 ms 9080 KB Output is correct
21 Correct 60 ms 8980 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 11 ms 2816 KB Output is correct
24 Correct 11 ms 2816 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 52 ms 3448 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 4 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 5 ms 384 KB Output is correct
35 Correct 4 ms 384 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1097 ms 35704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 29432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 29432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 2944 KB Output is correct
3 Correct 11 ms 2816 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 51 ms 3416 KB Output is correct
7 Correct 11 ms 2944 KB Output is correct
8 Correct 10 ms 3328 KB Output is correct
9 Correct 11 ms 3328 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 52 ms 7160 KB Output is correct
16 Correct 51 ms 7160 KB Output is correct
17 Correct 53 ms 7160 KB Output is correct
18 Correct 206 ms 3552 KB Output is correct
19 Correct 26 ms 3072 KB Output is correct
20 Correct 56 ms 9080 KB Output is correct
21 Correct 60 ms 8980 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 11 ms 2816 KB Output is correct
24 Correct 11 ms 2816 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 52 ms 3448 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 4 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 5 ms 384 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Execution timed out 1097 ms 35704 KB Time limit exceeded
37 Halted 0 ms 0 KB -