hdu5606 Tree (并查集)

There is a tree(the tree is a connected graph which contains nn points and n−1n−1edges),the points are labeled from 1 to nn,which edge has a weight from 0 to 1,for every point i∈[1,n]i∈[1,n],you should find the number of the points which are closest to it,the clostest points can contain ii itself. 

Input

the first line contains a number T,means T test cases. 

for each test case,the first line is a nubmer nn,means the number of the points,next n-1 lines,each line contains three numbers u,v,wu,v,w,which shows an edge and its weight. 

T≤50,n≤105,u,v∈[1,n],w∈[0,1]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 ansiansi is the answer to point ii,you only need to output,ans1 xor ans2 xor ans3.. ansnans1 xor ans2 xor ans3.. ansn. 

Sample Input

1
3
1 2 0
2 3 1

Sample Output

1

in the sample.

$ans_1=2$

$ans_2=2$

$ans_3=1$

$2~xor~2~xor~1=1$,so you need to output 1.

题意：

       给定n-1条边，两点间边的权值是0或者1，默认每个点到自身的距离为0，计算每个点到最短相邻点的的个数，将最后的结果异或输出。

分析：

       每个点到自身结点的距离为0 ，所以权值为1的点可以省去，将权值为0的点连成链，同一条链上的点到最近的点的数量必定是相同的，通过查找父亲节点的次数，得出每条链上的点到最近点的数量。

 

代码：

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int fa[100008];
int ans[100008];
int findset(int x)
{
    return fa[x]==x? x: fa[x]=findset(fa[x]);
}
void bind(int x,int y)
{
    int fx=findset(x);
    int fy=findset(y);
    if(fx!=fy)
    {
        fa[fx]=fy;
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
            memset(ans,0,sizeof(ans));
            int x,y,n,w,ans2=0;
            scanf("%d",&n);
            for(int i=1;i<=n;i++)///每个点的自身也是他的父亲节点，权值为0
            {
                fa[i]=i;
            }
            for(int i=1;i<n;i++)
            {
                scanf("%d%d%d",&x,&y,&w);
                if(w==0)///每个到最近的点的距离肯定是0，则将权值为0的边连接即可
                {
                   bind(x,y);
                }
            }
            for(int i=1;i<=n;i++)
            {
              fa[i]=findset(i);///一条链上的到相邻最近的数量是相同的，代表点为整条链的父亲节点
              ans[fa[i]]++;///查找链根节点的次数，就是这条链每个点到临近节点的数量
            }
            for(int i=1;i<=n;i++)
            {
                ans2=ans[fa[i]]^ans2;///由于每个点的结果都在父亲节点存储着，然后异或即可
            }
            printf("%d\n",ans2);
    }
    return 0;
}