HRBUST - 1073:并查集

#include<iostream>
#include<cstdio>
using namespace std;
const int N=5e4+5;
int P[N];
void init(int n){
	for(int i=0;i<n;i++)
	{
		P[i]=i;
	}
}
int find(int x){
	if(x!=P[x]) P[x]=find(P[x]);
	return P[x];
}
void join(int x,int y){
	int a=find(x);
	int b=find(y);
	if(a!=b)P[a]=b;
}
int n,m;
int main(){
	int u,v,num=0;
	ios::sync_with_stdio(false);
	while(cin>>n>>m){
	init(n);
	for(int i=0;i<m;i++){
		cin>>u>>v;
		join(u,v);
	}
	for(int i=0;i<n;i++)
		if(find(i)==find(0)) num++;
	cout<<num<<endl;
	}
	return 0;
}

猜你喜欢

转载自blog.csdn.net/lianghudream/article/details/82924545