codeforces 764C Timofey and a tree (思维题)
来源:互联网 发布:mysql安装教程 编辑:程序博客网 时间:2024/05/22 05:44
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 don't like when many colors 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.
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.
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.
41 22 33 41 2 1 1
YES2
31 22 31 2 3
YES2
41 22 33 41 2 1 2
NO
题目大意:一个树上有n个节点,n-1条边,每个节点上有一个颜色,现要求选取其中一个节点为根,要求子树的颜色相同,问是否能够达到要求。
题目分析:两个有共同边的节点,如果颜色不一样,那么肯定会有其中一个点选为根,记录这个点的度+1,总的counts+1,最后遍历数组,找出度和counts的大小相同的点并输出。如果没有即是不能达到要求。
#include <cstdio>#include <cstring>using namespace std;int const maxn = 100005;struct node{int u,v;}a[maxn];int c[maxn];int degree[maxn];int main(){int n;scanf("%d",&n);for(int i=1;i<n;i++)scanf("%d%d",&a[i].u ,&a[i].v );for(int i=1;i<=n;i++) scanf("%d",&c[i]);int counts=0;memset(degree,0,sizeof(degree));for(int i=1;i<n;i++){if(c[a[i].u]!=c[a[i].v]){counts++;degree[a[i].u ]++;degree[a[i].v ]++;}}for(int i=1;i<=n;i++){if(counts==degree[i]){printf("YES\n%d\n",i);return 0;}}printf("NO\n");return 0;}
- codeforces 764C Timofey and a tree (思维题)
- Codeforces 764C Timofey and a tree 树+思维
- codeforces 764C Timofey and a tree(树+思维)
- 764C Timofey and a tree[思维]
- C. Timofey and a tree----思维题
- 【codeforces 764C】Timofey and a tree
- CodeForces 764C Timofey and a tree
- Codeforces 764C - Timofey and a tree(dfs)
- Codeforces 764C Timofey and a tree(思路)
- 【codeforces 764C】Timofey and a tree 题解
- Codeforces 764C或763A Timofey and a tree 【好题】
- Codeforces Round #395(Div. 2)C. Timofey and a tree【思维+并查集缩点+判定】
- C. Timofey and a tree codeforces 395 div2 C
- C. Timofey and a tree
- Codeforces Round #395 (Div. 2) C. Timofey and a tree
- Codeforces Round #395 (Div. 2) C. Timofey and a tree
- Codeforces Round 395 C Timofey and a tree 树
- 【Codeforces Round #395 (Div. 2)】Codeforces 764C Timofey and a tree
- maven项目自动编译设置
- HDU - 1421 搬寝室 解题报告
- 题目1209:最小邮票数
- eclipse编译源码慢的解决方法
- STM32f103——ILI9341
- codeforces 764C Timofey and a tree (思维题)
- Py_BuildValue()返回NULL的原因及解决方法;string在char和utf-8编码之间互转
- Android 高版本API方法在低版本系统上的兼容性处理
- WebGIS中地图恢复初始位置及状态
- Java的封装
- 【Inno Setup】Gif插件2.1
- c# checked关键字
- 初步使用EventBus (一)
- python学习笔记1——python 中 Tkinder 使用常见问题