强化阶段 Day 20 算法笔记 9.6 并查集

目录

1.基本操作

2.好朋友

3.Social Clusters

---

1.基本操作

const int maxn=1000;

int father[maxn];

//初始化
for(int i=1;i<=maxn;i++){
	father[i]=i;
}

int findfather(int x){
	while(x!=father[x]){
		x=father[x];
	}
	return x;
}

int findfather(int x){
	if(x==father[x]) return x;
	else return findfather(father[x]);
}

void union(int a,int b){
	int fa=findfather(a);
	int fb=findfather(b);
	if(fa!=fb){
		father[fa]=fb;
	}
}

int findfather(int x){
	int a=x;
	while(x!=father[x]){
		x=father[x];
	}
	while(a!=father[a]){
		int fa=father[a];
		father[a]=x;
		a=fa;
	}
	return x;
}

int findfahter(int v){
	if(v==father[v]) return v;
	else{
		int f=findfather(father[v]);
		father[v]=f;
		return f;
	}
}

2.好朋友

#include<cstdio>
#include<vector>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<queue>
#include<math.h>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;

const int maxn=100;
int father[maxn];
bool root[maxn]={false};

void init(int x){
	for(int i=1;i<=n;i++){
		father[i]=i;
		root[i]=false;
	}
}

void unions(int a,int b){
	int fa=father[a];
	int fb=father[b];
	if(fa!=fb){
		father[fa]=fb;
	}
}

int findfather(int x){
	int a=x;
	while(x!=father[x]){
		x=father[x];
	}
	while(a!=father[a]){
		int fa=father[a];
		father[a]=x;
		a=fa;
	}
	return x;
}
int main(){
	
	int n,m;
	scanf("%d%d",&n,&m);
	init(n);
	int a,b;
	for(int i=0;i<m;i++){
		scanf("%d %d",&a,&b);
		unions(a,b);
	}
	for(int i=1;i<=n;i++){
		root[findfather(i)]=true;
	}
	
	int ans=0;
	for(int i=1;i<=n;i++){
		ans+=root[i];
	}
	printf("%d\n",ans);
	
	return 0;
}

3.Social Clusters

#include<cstdio>
#include<vector>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<queue>
#include<math.h>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;

const int maxn=1005;
int father[maxn];
int isroot[maxn]={0};
int hobby[maxn]={0};

void init(int n){
	for(int i=1;i<=n;i++){
		father[i]=i;
		isroot[i]=false;
	}
}

int findfather(int x){
	int a=x;
	while(x!=father[x]){
		x=father[x];
	}
	while(a!=father[x]){
		int z=a;
		a=father[a];
		father[z]=x;
	}
	return x;
}

void unions(int a,int b){
	int fa=findfather(a);
	int fb=findfather(b);
	if(fa!=fb){
		father[fa]=fb;
	}
}

bool cmp(int x,int y){
	return x>y;
}


int main(){
	
	int n;
	scanf("%d",&n);
	init(n);
	int num,h;
	for(int i=1;i<=n;i++){
		scanf("%d:",&num);
		for(int j=0;j<num;j++){
			scanf("%d",&h);
			if(hobby[h]==0){
				hobby[h]=i;
			}
			unions(i,findfather(hobby[h]));
		}
	}
	for(int i=1;i<=n;i++){
		isroot[findfather(i)]++;
	}

	int ans=0;
	for(int i=1;i<=n;i++){
		if(isroot[i]!=0){
			ans++;
		}
	}
	printf("%d\n",ans);
	sort(isroot+1,isroot+1+n,cmp);
	for(int i=1;i<=ans;i++){
		printf("%d",isroot[i]);
		if(i!=ans) printf(" ");
	}

	return 0;
}