How Many Tables

题目链接
并查集统计集合个数

#include<algorithm>
#include<iostream>
#include<set>
#include<cstring>
#include<cstdio>
using namespace std;
const int N=1010;
int father[N];
int n,m;
int ans=0;
void init(){
	for(int i=0;i<N;i++){
		father[i]=i;
	}
}
int find(int x){
	int a=x;
	while(x!=father[x]){
		x=father[x];
	}
	while(a!=father[a]){
		int z=a;
		a=father[a];
		father[z]=x;
	}
	return x;
}
void Union(int a,int b){
	int fa=find(a);
	int fb=find(b);
	if(fa!=fb){
		father[fa]=fb;
	}
}
int main(){
	int t;
	cin>>t;
	while(t--){
		init();
		set<int> s;
		cin>>n>>m;
		ans=0;
		for(int i=0;i<m;i++){
			int a,b;
			cin>>a>>b;
			Union(a,b);
		}
		for(int i=1;i<=n;i++){ //编号从1开始 
			s.insert(find(i));
		}
		cout<<s.size()<<endl;
	}
	return 0;
}