【codeforces 764C】Timofey and a tree
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 ci.
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 c1, c2, …, cn (1 ≤ ci ≤ 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
【题目链接】:http://codeforces.com/contest/764/problem/C
【题解】
题意:
一棵树中各个节点被染上了c[i]颜色;
让你在一棵树中随便选一个节点作为根节点,然后把整棵树抬起来;
问你是否存在一个根节点,这个根节点的直系儿子节点的子树里面的所有节点的颜色都一样;
做法:
考虑最后整张图;
那些边的两端端点颜色不一样的边(设为特殊边,这样的边总数为m)肯定是有和根节点连在一起的;
(如果没有和根节点相连的话,肯定会造成子树里面有两个颜色不一样的);
所以就看看哪个节点和m条特殊边都相连,如果有的话肯定就是它作为根节点了,且如果没有这样的点的话肯定无解了)
【完整代码】
#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%I64d",&x)
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};
const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};
const double pi = acos(-1.0);
const int MAXN = 1e5+10;
int n,m;
int h[100010],c[MAXN];
pii bian[MAXN];
int main()
{
//freopen("F:\\rush.txt","r",stdin);
rei(n);
rep1(i,1,n-1)
rei(bian[i].fi),rei(bian[i].se);
rep1(i,1,n)
rei(c[i]);
rep1(i,1,n-1)
{
int x = bian[i].fi,y = bian[i].se;
if (c[x]!=c[y])
{
m++;
h[x]++,h[y]++;
}
}
rep1(i,1,n)
if (h[i]==m)
{
puts("YES");
printf("%d\n",i);
return 0;
}
puts("NO");
return 0;
}
相关文章
- No result defined for action com.lk.IndexAction and result success
- codeforces——Little Pony and Sort by Shift
- codeforces Soldier and Number Game(dp+素数筛选)
- [Spring boot] Configuring and Accessing a Data Source
- [Recompose] Compose Streams of React Props with Recompose’s compose and RxJS
- [Angular] Http Custom Headers and RequestOptions
- [Kotlin] Destructuring and ComponentN functions
- [AngularJS] Default Child state and nav between child state
- different behavior in AG3 and P8I about Territory management - popup window display
- Atitit..组件化事件化的编程模型--(2)---------Web datagridview 服务器端控件的实现原理and总结
- 【Codeforces 682C】Alyona and the Tree
- 【Codeforces 442B】Andrey and Problem
- 【ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) D】Tree
- 【Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined) A】 Perfect Squares
- 【Codeforces Round #442 (Div. 2) C】Slava and tanks
- 【81.37%】【codeforces 734B】Anton and Digits
- 【17.00%】【codeforces 621D】Rat Kwesh and Cheese
- 【38.24%】【codeforces 621E】 Wet Shark and Blocks
- 【34.54%】【codeforces 675E】Trains and Statistic
- 【27.91%】【codeforces 734E】Anton and Tree
- 【20.23%】【codeforces 740A】Alyona and copybooks
- 【codeforces 785E】Anton and Permutation
- 【codeforces 791D】 Bear and Tree Jumps
- 【codeforces 791A】Bear and Big Brother
- 【codeforces 785B】Anton and Classes
- 【codeforces 766A】Mahmoud and Longest Uncommon Subsequence
- 【codeforces 755B】PolandBall and Game
- 【codeforces 755D】PolandBall and Polygon
- 【codeforces 548D】Mike and Feet
- 【codeforces 548A】Mike and Fax
- 【Codeforces Round #431 (Div. 2) A】Odds and Ends
- 【Codeforces Round #430 (Div. 2) C】Ilya And The Tree
- Codeforces Round #250 (Div. 2)—A. The Child and Homework
- C. Arthur and Table(Codeforces Round #311 (Div. 2) 贪心)
- Codeforces #250 (Div. 2) C.The Child and Toy