2021ccpc网络赛

Jumping Monkey

并查集

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
//string p1="imposter",p2="crewmate";
int t,n,dep[maxn],vis[maxn],fa[maxn];
vector<int>mp[maxn],mp2[maxn];
struct node{
	int w,id;
	bool operator < (const node &x)const{
		return w<x.w;
	}
}p[maxn];
int find(int x){
	if(x==fa[x])return x;
	return fa[x]=find(fa[x]);
}
void dfs(int x,int f){
	dep[x]=dep[f]+1;
	for(auto y:mp2[x]){
		if(y==f)continue;
		dfs(y,x);
	}
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			mp[i].clear();
			mp2[i].clear();
			vis[i]=0;
			fa[i]=i;
		}
		for(int i=1,x,y;i<n;i++){
			scanf("%d%d",&x,&y);
			mp[x].push_back(y);
			mp[y].push_back(x);
		}
		for(int i=1,x;i<=n;i++){
			scanf("%d",&x);
			p[i]={x,i};
		}
		sort(p+1,p+1+n);
		for(int i=1;i<=n;i++){
			int id=p[i].id;
			for(auto x:mp[id]){
				if(!vis[x])continue;
				int d=find(x);
				fa[d]=id;
				mp2[id].push_back(d);
				mp2[d].push_back(id);
			}
			vis[id]=1;
		}
		dfs(p[n].id,0);
		for(int i=1;i<=n;i++)
		    printf("%d\n",dep[i]);
	}
}