题目名称:How Many Tables
题目链接:How Many Tables
描述
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.
输入
The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
输出
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
样例输入
2
5 3
1 2
2 3
4 5
5 1
2 5
样例输出
2
4
题目大意
今天是Ignatius的生日,他邀请了所有的朋友,晚饭时间到了,他想知道需要多少张桌子,每个桌子上只能坐相互认识的朋友
解题思路
使用并查集路径压缩,使得所有相互认识的朋友都有相同的父节点,这样只需要统计有多少个不同的父节点即可
完整代码
#include<iostream>
#include<cstring>
using namespace std;
#define N 1010
int t,n,m,a,b;
int f[N];
void init(){
for(int i=1;i<=n;i++) f[i]=i;
}
int find(int x){ //查找根节点
return x==f[x]?x:f[x]=find(f[x]);
}
int main()
{
cin>>t;
int fa,fb;
while(t--){
cin>>n>>m;
init();
for(int i=0;i<m;i++){
cin>>a>>b;
fa=find(a);
fb=find(b);
if(fa!=fb){
f[fb]=fa;
}
}
int ans=0;
for(int i=1;i<=n;i++){
if(f[i]==i){
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}