Submission #1083641

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083641		Rawlat_vanak	Race (IOI11_race)	C++17	0 / 100	1 ms	348 KiB

race

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speedIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ff first
#define ss second
#define pii pair<ll,ll>
#define pb push_back

vector<vector<pii>> graph;
vector<ll> sz,dist,rep,depth;
vector<bool> removed;
ll n,k,final;

void subtreesize(ll u, ll p){
	sz[u]=1;
	for(pii v:graph[u]){
		if(v.ff==p) continue;
		subtreesize(v.ff,u);
		sz[u]+=sz[v.ff];
	}
}

ll findcentroid(ll u, ll p, ll m){
	for(pii v:graph[u]){
		if(removed[v.ff]) continue;
		if(v.ff==p) continue;
		if(2*sz[v.ff]>m){
			return findcentroid(v.ff,u,m);
		}
	}
	return u;
}


void dfs(ll u, ll p, ll cen){
	for(pii x:graph[u]){
		ll v=x.ff,w=x.ss;
		if(v==p) continue;
		if(removed[v]) continue;
		if(u!=cen) rep[v]=rep[u];
		depth[v]=depth[u]+1;
		dist[v]=dist[u]+w;
		dfs(v,u,cen);
		

	}
}


void centroid_decomp(ll u, ll p){

	
	ll ctrd=findcentroid(u,p,sz[u]);
	//cout<<"hi "<<u<<' '<<p<<' '<<ctrd<<'\n';
	dist.clear();
	dist.resize(n,0);
	rep.clear();
	rep.resize(n);
	depth.clear();
	depth.resize(n,0);
	
	for(pii v:graph[ctrd]){
		if(removed[v.ff]) continue;
		rep[v.ff]=v.ff;
	}
	dfs(ctrd,-1,ctrd);

	vector<ll> values(k+1,1e7);
	for(ll i=0;i<n;i++){
		if(removed[i]) continue;
		if(dist[i]==0 or depth[i]==0 or dist[i]>k) continue;
		values[dist[i]]=min(values[dist[i]],depth[i]);
	}

	/*for(int i:dist){
		cout<<i<<' ';
	}
	cout<<'\n';
			
	for(int i:depth){
		cout<<i<<' ';
	}
	cout<<'\n';

	for(int i:rep){
		cout<<i<<' ';
	}
	cout<<'\n';*/

	ll ans=1e7;
	values[0]=0;
	for(ll i=0;i<=k;i++){
		if(values[i]==1e7) continue;
		if(values[k-i]!=1e7){
			if(rep[i]==rep[k-i]) continue;
			ans=min(ans,values[i]+values[k-i]);
			//cout<<ans<<' '<<ctrd<<' '<<i<<'\n';
		}
	}
	final=min(final,ans);




	removed[ctrd]=true;
	for(pii v:graph[ctrd]){
		if(removed[v.ff]) continue;
		centroid_decomp(v.ff,ctrd);
	}

	
}



int best_path(int N, int K, int h[][2], int l[]){
	n=N,k=K;
	graph.clear();
	graph.resize(n);
	sz.clear();
	sz.resize(n);
	removed.clear();
	removed.resize(n);
	dist.clear();
	dist.resize(n);
	for(ll i=0;i<n-1;i++){
		graph[h[i][0]].pb({h[i][1],l[i]});
		graph[h[i][1]].pb({h[i][0],l[i]});
	}
	final=1e7;
	subtreesize(0,-1);
	centroid_decomp(0,-1);
	if(final==1e7){
		return -1;
	}else{
		return final;
	}


}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57