oj.uz

답안 #365924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365924 2021-02-12T14:07:41 Z kshitij_sodani Min-max tree (BOI18_minmaxtree) C++14
100 / 100
 750 ms 113900 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
llo n,k;
vector<llo> pre[300001];
set<llo> cur[300001];
vector<llo> adj[300001];
vector<llo> pre2[300001];
llo ll[300001];
llo rr[300001];
llo par2[300001];
llo vis[300001];
llo vis2[300001];
set<llo> adj2[300001];
llo match[300001];

llo dfs(llo no,llo par=-1){

	llo ma=-1;
	llo ind=-1;
	par2[no]=par;
	vector<llo> ss;
	for(auto j:adj[no]){
		if(j!=par){
			llo x=dfs(j,no);
			ss.pb(x);
			//cout<<no<<":"<<j<<":"<<x<<endl;
			if((llo)cur[x].size()>ma){
				ma=cur[x].size();
				ind=x;
			}
		}
	}
	if(ma==-1){
		//cout<<no<<":"<<endl;
		ind=no;
	}

	for(auto j:ss){
		if(j!=ind){
			for(auto j:cur[j]){
				if(cur[ind].find(j)!=cur[ind].end()){
					cur[ind].erase(j);
					continue;
				}
				cur[ind].insert(j);
			}
			cur[j].clear();
		}
	}


	for(auto j:pre[no]){
		if(cur[ind].find(j)!=cur[ind].end()){
			cur[ind].erase(j);
			continue;
		}
		cur[ind].insert(j);
	}
	if(par!=-1){
		//cout<<no+1<<" "<<par+1<<" ";
		if(cur[ind].size()){
			rr[no]=(*(cur[ind].begin()));
		//	cout<<(*(cur[ind].begin()))<<endl;
		}//
		else{
			rr[no]=-1;
		//	cout<<1<<endl;
		}
	}
	return ind;

}

llo dfs2(llo no,llo par=-1){

	llo ma=-1;
	llo ind=-1;
	vector<llo> ss;
	for(auto j:adj[no]){
		if(j!=par){
			llo x=dfs2(j,no);
			ss.pb(x);
			//cout<<no<<":"<<j<<":"<<x<<endl;
			if((llo)cur[x].size()>ma){
				ma=cur[x].size();
				ind=x;
			}
		}
	}
	if(ma==-1){
		//cout<<no<<":"<<endl;
		ind=no;
	}

	for(auto j:ss){
		if(j!=ind){
			for(auto j:cur[j]){
				if(cur[ind].find(j)!=cur[ind].end()){
					cur[ind].erase(j);
					continue;
				}
				cur[ind].insert(j);
			}
			cur[j].clear();
		}
	}


	for(auto j:pre2[no]){
		if(cur[ind].find(-j)!=cur[ind].end()){
			cur[ind].erase(-j);
			continue;
		}
		cur[ind].insert(-j);
	}
	if(par!=-1){
		//cout<<no+1<<" "<<par+1<<" ";
		if(cur[ind].size()){
			ll[no]=-(*(cur[ind].begin()));
		//	cout<<(*(cur[ind].begin()))<<endl;
		}//
		else{
			ll[no]=-1;
		//	cout<<1<<endl;
		}
	}
	return ind;

}
llo co[300001];
vector<pair<llo,llo>> adj3[300001];
llo vis3[300001];
llo vis4[300001];
pair<llo,llo> mm;
llo mm2;
map<llo,llo> zz;
void dfs3(int no,int par=-1){
	vis3[no]=1;
	for(auto j:adj3[no]){
		if(vis3[j.a]==0){
			dfs3(j.a,no);
		}
		else if(j.a!=par){
			mm={j.a,no};
			mm2=j.b;
		}
	}
}
llo vis5[300001];
void dfs4(int no,int par=-1){
	vis4[no]=1;
	for(auto j:adj3[no]){
		if(j.b==mm2){
			continue;
		}
		if(vis4[j.a]==0){

			vis5[j.b]=1;	
			cout<<j.b+1<<" "<<par2[j.b]+1<<" "<<zz[j.a]<<endl;
			dfs4(j.a,no);
		}
		else if(j.a!=par){
		
		}

	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin>>n;
	for(llo i=0;i<n-1;i++){
		llo aa,bb,cc;
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
	} 
	cin>>k;
	set<llo> xx;
	//dfs3(0);
	
	llo ans=0;
 	for(llo i=0;i<k;i++){
 		char s;
 		cin>>s;
 		llo aa,bb,cc;
 		cin>>aa>>bb>>cc;
 		aa--;
 		bb--;
 		/*if(bb==par2[aa]){
 			swap(aa,bb);
 		}
 		if(aa==par2[bb]){
 			cout<<aa+1<<" "<<bb+1<<" "<<cc<<endl;
 			vis[bb]=1;
 			ans++;
 			continue;
 		}*/
 		xx.insert(cc);
 		if(s=='M'){
 			pre[aa].pb(cc);
 			pre[bb].pb(cc);
 		}
 		else{
 			pre2[aa].pb(cc);
 			pre2[bb].pb(cc);
 		}
 	}
 	dfs(0);	
 	for(llo i=0;i<n;i++){
 		cur[i].clear();
 	}

 	dfs2(0); 
 	llo ind=n;
 	map<llo,llo> yy;
 	
 	for(auto i:xx){
 		yy[i]=ind;
 		zz[ind]=i;
 		ind++;
 	}
 	
 	for(llo i=1;i<n;i++){
 		/*if(vis[i]==1){
 			continue;
 		}*/
 		if(ll[i]!=-1){
 			adj2[i].insert(yy[ll[i]]);
 			adj2[yy[ll[i]]].insert(i);
 		}
 		if(rr[i]!=-1){
 			adj2[i].insert(yy[rr[i]]);
 			adj2[yy[rr[i]]].insert(i);
 		}
 		if(ll[i]==-1 and rr[i]==-1){
 			cout<<i+1<<" "<<par2[i]+1<<" "<<1<<endl;
 			ans++;
 			vis5[i]=1;
 		}
 	//	cout<<ll[i]<<":"<<rr[i]<<endl;
 	}

 	set<pair<llo,llo>> cot;
 	set<pair<llo,llo>> cot2;
 	for(llo i=1;i<=200000;i++){
 		if(adj2[i].size()>0){
 			co[i]=adj2[i].size();
 			if(i<n){
 				cot.insert({adj2[i].size(),i});
 			}
 			else{
 				cot2.insert({adj2[i].size(),i});
 			}
 		}
 	}

 	while(true){
 		if(cot.size()==0){
 			break;
 		}
 		if(cot.size()>0){
 			pair<llo,llo> no=*(cot.begin());
 			if(no.a==1){
 				vis5[no.b]=1;
 				llo nn=*(adj2[no.b].begin());
 				cot.erase({no});
 				co[no.b]--;

 				cot2.erase({co[nn],nn});
 				adj2[nn].erase(no.b);
 				adj2[no.b].erase(nn);
 				for(auto j:adj2[nn]){
 					cot.erase({co[j],j});
 					adj2[j].erase(nn);
 					co[j]--;
 					if(co[j]>0){
 						cot.insert({co[j],j});
 					}	
 				}
 				co[nn]--;
 				cout<<no.b+1<<" "<<par2[no.b]+1<<" "<<zz[nn]<<endl;
 				continue;
 			}
 		}
 	
		break;
 	}
 	for(auto j:cot){
 		adj3[yy[ll[j.b]]].pb({yy[rr[j.b]],j.b});
 		adj3[yy[rr[j.b]]].pb({yy[ll[j.b]],j.b});
 		//cout<<yy[ll[j.b]]<<","<<yy[rr[j.b]]<<endl;
 	}
 //	cout<<(cot.size())<<endl;
 	for(int i=1;i<=2*n;i++){
 		if(vis3[i]==0){
 			if(adj3[i].size()>0){
 				dfs3(i);
 			
 				dfs4(mm.a);
 			//	cout<<11<<endl;
 				cout<<mm2+1<<" "<<par2[mm2]+1<<" "<<zz[mm.a]<<endl;
 				vis5[mm2]=1;
 			}

 		}
 	}
 	for(int i=1;i<n;i++){
 		if(vis5[i]==0){
 			cout<<i+1<<" "<<par2[i]+1<<" "<<ll[i]<<endl;
 		}
 	}




 
	return 0;
}

Compilation message

minmaxtree.cpp: In function 'int main()':
minmaxtree.cpp:181:13: warning: unused variable 'cc' [-Wunused-variable]
  181 |   llo aa,bb,cc;
      |             ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56812 KB Output is correct
2 Correct 39 ms 56812 KB Output is correct
3 Correct 39 ms 56812 KB Output is correct
4 Correct 38 ms 56812 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 499 ms 99980 KB Output is correct
2 Correct 530 ms 95388 KB Output is correct
3 Correct 494 ms 96104 KB Output is correct
4 Correct 526 ms 104044 KB Output is correct
5 Correct 473 ms 96648 KB Output is correct
6 Correct 523 ms 97256 KB Output is correct
7 Correct 484 ms 95448 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 310 ms 78400 KB Output is correct
2 Correct 300 ms 80108 KB Output is correct
3 Correct 261 ms 82284 KB Output is correct
4 Correct 258 ms 85228 KB Output is correct
5 Correct 319 ms 83052 KB Output is correct
6 Correct 329 ms 84716 KB Output is correct
7 Correct 340 ms 82284 KB Output is correct
8 Correct 353 ms 81900 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56812 KB Output is correct
2 Correct 39 ms 56812 KB Output is correct
3 Correct 39 ms 56812 KB Output is correct
4 Correct 38 ms 56812 KB Output is correct
5 Correct 499 ms 99980 KB Output is correct
6 Correct 530 ms 95388 KB Output is correct
7 Correct 494 ms 96104 KB Output is correct
8 Correct 526 ms 104044 KB Output is correct
9 Correct 473 ms 96648 KB Output is correct
10 Correct 523 ms 97256 KB Output is correct
11 Correct 484 ms 95448 KB Output is correct
12 Correct 310 ms 78400 KB Output is correct
13 Correct 300 ms 80108 KB Output is correct
14 Correct 261 ms 82284 KB Output is correct
15 Correct 258 ms 85228 KB Output is correct
16 Correct 319 ms 83052 KB Output is correct
17 Correct 329 ms 84716 KB Output is correct
18 Correct 340 ms 82284 KB Output is correct
19 Correct 353 ms 81900 KB Output is correct
20 Correct 664 ms 100460 KB Output is correct
21 Correct 536 ms 92980 KB Output is correct
22 Correct 516 ms 93420 KB Output is correct
23 Correct 564 ms 93676 KB Output is correct
24 Correct 750 ms 113900 KB Output is correct
25 Correct 711 ms 113260 KB Output is correct
26 Correct 575 ms 110796 KB Output is correct
27 Correct 620 ms 112980 KB Output is correct
28 Correct 670 ms 102660 KB Output is correct
29 Correct 632 ms 102952 KB Output is correct
30 Correct 613 ms 97900 KB Output is correct
31 Correct 613 ms 98284 KB Output is correct
32 Correct 742 ms 101996 KB Output is correct
33 Correct 662 ms 98668 KB Output is correct
34 Correct 617 ms 98880 KB Output is correct
35 Correct 620 ms 97312 KB Output is correct