Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
2 5 3 1 2 2 3 4 5 5 1 2 5
2 4
题解:
并查集炒鸡入门题,很水
#include<stdio.h>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<map>
using namespace std;
int pre[1005];
int find(int x)//寻找根节点+更新一路的节点
{
if(x!=pre[x])
{
int t=find(pre[x]);
pre[x]=t;
return t;
}
else
return x;
}
int a[1005];
int main()
{
int i,j,n,m,ans,t,x,y,d1,d2;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)//并查集基本操作初始化
{
pre[i]=i;
}
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
if(x>y)
swap(x,y);
d1=find(x);
d2=find(y);
if(d1!=d2)
{
pre[d2]=d1;
}
}
ans=0;
for(i=1;i<=n;i++)
if(i==pre[i])
ans++;
printf("%d\n",ans);
}
return 0;
}