HDU 5606 tree(并查集的应用)
来源:互联网 发布:绝世唐门升坐骑数据 编辑:程序博客网 时间:2024/03/28 22:31
Problem Description
There is a tree(the tree is a connected graph which contains n points and n−1 edges),the points are labeled from 1 to n,which edge has a weight from 0 to 1,for every point i∈[1,n],you should find the number of the points which are closest to it,the clostest points can contain i itself.
Input
the first line contains a number T,means T test cases.
for each test case,the first line is a nubmer n,means the number of the points,next n-1 lines,each line contains three numbers u,v,w,which shows an edge and its weight.
T≤50,n≤105,u,v∈[1,n],w∈[0,1]
Output
for each test case,you need to print the answer to each point.
in consideration of the large output,imagine ansi is the answer to point i,you only need to output,ans1 xor ans2 xor ans3.. ansn.
Sample Input
1
3
1 2 0
2 3 1
Sample Output
1
in the sample.
城会玩题目,感觉挺有意思的,,,,水一发题解吧。。。
本题的题意:让你找出离每个点最近的点的个数,然后把这些个数异或。
找点的个数这块用到了并查集的有关知识。
下面是AC代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int pre[100005];int fin(int x){ if(pre[x]==x) { return x; } else { return pre[x]=fin(pre[x]); }}void join(int x,int y){ int t1=fin(x); int t2=fin(y); if(t1!=t2) { pre[t1]=t2; }}int cnt[100005];int main(){ int n,t; scanf("%d",&t); while(t--) { scanf("%d",&n); int a,b,c; for(int i=1;i<=n;i++) { pre[i]=i; } for(int i=1;i<=n-1;i++) { scanf("%d%d%d",&a,&b,&c); if(c==0)//因为每个点的最近距离肯定为0,为1的话就不需要考虑了 join(a,b); cnt[i]=0; } cnt[n]=0; for(int i=1;i<=n;i++) { cnt[fin(i)]++;//找到祖先后,加一 } int re=0; for(int i=1;i<=n;i++) { re=re^cnt[fin(i)]; } printf("%d\n",re); } return 0;}
- HDU 5606 tree(并查集的应用)
- HDU 5606 tree(并查集)
- HDU 5606 tree 并查集
- hdu 5606 tree(并查集)
- HDU 5606 tree(并查集)
- hdu 5606 tree 并查集
- hdu 5441 并查集的应用
- hdu 1272 并查集的应用
- 并查集的应用:hdu 1213
- HDU 5200 Tree (离线并查集)
- hdu 4786 Fibonacci Tree(并查集)
- hdu 3635 Dragon Balls(并查集的各种应用)
- 并查集的简单应用——HDU
- hdu 1232 畅通工程(并查集的应用)
- hdu 3635(并查集的应用)
- hdu 1198 并查集应用
- hdu 1232 经典并查集应用
- hdu 2860(并查集应用)
- HDU 4747 线段树+思维
- linux命令英文缩写的含义(方便记忆)
- Git学习9:Git远程版本库
- 剑指offer(58):链表中环的入口节点
- Linux熟悉命令之路----find命令
- HDU 5606 tree(并查集的应用)
- mybatis自动生成器
- 北京好玩的博物馆
- 一个电商项目的Web服务化改造3:改进方案の规范和约定、单表、单一职责
- ZOJ_1016
- 项目经理多年的经验之谈
- MySQL 入门教程
- 天嵌TQ_E9卡片电脑移植飞思卡尔yocto L4.1.15_1.0.0_ga 第一篇 yocto项目建立
- 定位