题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5606
解题思路:
这题实际上是要找一些连通的节点,使得边上的权值都为0。
很明显,首先把权值为0的边都拿出来,然后利用并查集找到该点所在的连通块,并记录每个连通块的个数。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 100005;
struct Edge
{
int u,v,w;
bool operator < (const Edge &rhs) const
{
return w < rhs.w;
}
}edge[maxn];
int n,sum[maxn],fa[maxn];
int find(int x)
{
if(fa[x] == x) return x;
return fa[x] = find(fa[x]);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i = 1; i < n; i++)
scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
sort(edge+1,edge+n);
for(int i = 1; i <= n; i++) fa[i] = i,sum[i] = 1;
for(int i = 1; i < n; i++)
{
if(edge[i].w == 1) break;
int u = edge[i].u, v = edge[i].v;
int fu = find(u);
int fv = find(v);
if(fu != fv)
{
fa[fv] = fu;
sum[fu] += sum[fv];
}
}
int ans = 0;
for(int i = 1; i <= n; i++)
ans ^= sum[find(i)];
printf("%d\n",ans);
}
return 0;
}