Timofey and a tree CodeForces - 764C（dfs+思维）

Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color c i.

Now it’s time for Timofey birthday, and his mother asked him to remove the tree. Timofey removes the tree in the following way: he takes some vertex in hands, while all the other vertices move down so that the tree becomes rooted at the chosen vertex. After that Timofey brings the tree to a trash can.

Timofey doesn’t like it when many colors are mixing together. A subtree annoys him if there are vertices of different color in it. Timofey wants to find a vertex which he should take in hands so that there are no subtrees that annoy him. He doesn’t consider the whole tree as a subtree since he can’t see the color of the root vertex.

A subtree of some vertex is a subgraph containing that vertex and all its descendants.

Your task is to determine if there is a vertex, taking which in hands Timofey wouldn’t be annoyed.

Input
The first line contains single integer n (2 ≤ n ≤ 105) — the number of vertices in the tree.

Each of the next n - 1 lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v), denoting there is an edge between vertices u and v. It is guaranteed that the given graph is a tree.

The next line contains n integers c 1, c 2, …, c n (1 ≤ c i ≤ 105), denoting the colors of the vertices.

Output
Print “NO” in a single line, if Timofey can’t take the tree in such a way that it doesn’t annoy him.

Otherwise print “YES” in the first line. In the second line print the index of the vertex which Timofey should take in hands. If there are multiple answers, print any of them.

Examples
Input
4
1 2
2 3
3 4
1 2 1 1
Output
YES
2
Input
3
1 2
2 3
1 2 3
Output
YES
2
Input
4
1 2
2 3
3 4
1 2 1 2
Output
NO
思路：建好树之后，我们先以1为根节点，dfs看看能分成几个部分，每个部分的节点颜色都相同。若想符合题意，假设分成了x个部分，那么与答案节点相连接的，必定是x个部分，否则就不符合题意。可以用反证法证明一下。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxx=1e5+100;
struct edge{
	int to,next;
}e[maxx<<1];
int head[maxx<<1];
int cor[maxx],vis[maxx];
int n,tot;

inline void init()
{
	tot=0;
	memset(head,-1,sizeof(head));
	memset(vis,0,sizeof(vis));
}
inline void add(int u,int v)
{
	e[tot].next=head[u],e[tot].to=v,head[u]=tot++;
}
inline void dfs(int u,int f,int c,int C)
{
	vis[u]=C;
	for(int i=head[u];i!=-1;i=e[i].next)
	{
		int to=e[i].to;
		if(to==f||cor[to]!=c) continue;
		dfs(to,u,c,C);
	}
}
int main()
{
	scanf("%d",&n);
	init();
	int x,y;
	for(int i=1;i<n;i++)
	{
		scanf("%d%d",&x,&y);
		add(x,y);
		add(y,x);
	}
	for(int i=1;i<=n;i++) scanf("%d",&cor[i]);
	int cnt=0;
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			cnt++;
			dfs(i,0,cor[i],cnt);
		}
	}
	map<int,int> mp;
	int num=0,ans,flag=0;
	for(int u=1;u<=n;u++)
	{
		mp.clear();
		num=0;
		mp[vis[u]]=1,num++;
		for(int i=head[u];i!=-1;i=e[i].next)
		{
			int to=e[i].to;
			if(mp[vis[to]]==0) mp[vis[to]]=1,num++;
		}
		if(num==cnt)
		{
			flag=1;
			ans=u;
			break;
		}
	}
	if(flag) cout<<"YES"<<endl<<ans<<endl;
	else cout<<"NO"<<endl;
	return 0;
}

努力加油a啊，(^o)/~