//http://ac.jobdu.com/problem.php?cid=1040&pid=68
#include <stdio.h>
int Tree[1001];
int findRoot(int x)
{
if (Tree[x]==-1)
{
return x;
}
else
{
int tmp=findRoot(Tree[x]);
Tree[x]=tmp;
return tmp;
}
}
int main()
{
int n,m,i,t;
scanf("%d",&t);
while (t--)
{
scanf("%d%d",&n,&m);
int a,b;
for (i=1;i<=n;i++)
{
Tree[i]=-1;
}
while (m--)
{
scanf("%d%d",&a,&b);
a=findRoot(a);
b=findRoot(b);
if (a!=b)
{
Tree[a]=b;
}
}
int ans=0;
for (i=1;i<=n;i++)
{
if (Tree[i]==-1)
{
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}
题目69:How Many Tables
最新推荐文章于 2019-10-15 15:54:36 发布