算法整理 & 复习：并查集、带权并查集

洛谷博客

---

一、并查集

P3367 【模板】并查集

//骞舵煡闆?
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAXN 10005

int prn[MAXN];
int n,m,p,x,y;

int find(int x){
	if(prn[x] == x)	return x;
	return prn[x] = find(prn[x]);
}

void Union(int x,int y){
	int t1,t2;
	t1 = find(x);
	t2 = find(y);
	if(t1 != t2) prn[t1] = t2;
}

void Search(int x,int y){
	int t1,t2;
	t1 = find(x);
	t2 = find(y);
	if(t1 == t2) cout << "Y" << endl;
	else cout << "N" << endl;
}

int main(){
	cin >> n >> m;
	for(int i=1;i<=n;i++) prn[i] = i;
	for(int i=1;i<=m;i++){
		cin >> p;
		switch(p){
			case 1:cin >> x >> y;	Union(x,y);	break;
			case 2:cin >> x >> y;	Search(x,y);break;
		}
	}
	return 0;
}

---

二、带权并查集

P1196 [NOI2002]银河英雄传说

#include <math.h>
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAXN 30005

int n,a,b;
char p;
int prn[MAXN],num[MAXN],len[MAXN];

int find(int x){
	if(x == prn[x]) return x;
	int t1 = find(prn[x]);
	len[x] += len[prn[x]];
	return prn[x] = t1;
}

void Union(int x, int y){
	int t1 = find(x);
	int t2 = find(y);
	prn[t1] = t2;
	len[t1] += num[t2];
	num[t2] += num[t1];
}

bool Query(int x, int y){
	int t1 = find(x);
	int t2 = find(y);
	if(t1 == t2) return 1;
	return 0;
}

int main(void){
	cin >> n;
	for(int i=1;i<=MAXN;i++){
		num[i] = 1;
		prn[i] = i;
	}
	for(int i=1;i<=n;i++){
		cin >> p >> a >> b;
		if(p == 'M'){
			Union(a,b);
		}
		if(p == 'C'){
			if(Query(a,b)) cout << abs(len[a]-len[b])-1 << endl;
			else cout << "-1" << endl;
		}
	}
	return 0;
}

---

三、并查集的优化

1. 路径压缩

非常常用的一个优化，只是一句话直接将 O(n) 的递归查找变为近乎 O(1)

int find(int x){
	if(prn[x] == x)	return x;
	return prn[x] = find(prn[x]); //路径压缩
}

2. 按秩合并

P2245 星际导航

思路很棒，可惜最后两个点 T 掉了，死活只有 80 分。。。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 300005

int n,m,q,x,y;
int prn[MAXN],dep[MAXN],val[MAXN],vis[MAXN];

struct node{
	int u,v,w;
}map[MAXN];

bool cmp(node x, node y){
	return x.w < y.w;
}

int find(int x){
	if(prn[x] == x) return x;
	return find(prn[x]);
}

void Union(int x, int y, int w){
	int t1 = find(x);
	int t2 = find(y);
	if(t1 == t2) return;
	if(dep[t1] < dep[t2]){
		prn[t1] = t2;
		val[t1] = w;
	}
	else{
		prn[t2] = t1;
		val[t2] = w;
		if(dep[t1] == dep[t2]) dep[t1]++; 
	}
}

int Query(int x, int y){
	memset(vis,0,sizeof(vis));
	int ansx=-1;
	while(1){
		vis[x] = ansx;
		if(x == prn[x]) break;
		ansx = max(ansx,val[x]);
		x = prn[x];
	}
	int ansy=-1;
	while(1){
		if(vis[y]) return max(ansy,vis[y]);
		if(y == prn[y]) break;
		ansy = max(ansy,val[y]);
		y = prn[y];
	}
	return max(ansx,ansy);
}

int main(void){
	cin >> n >> m;
	for(int i=1;i<=m;i++){
		cin >> map[i].u >> map[i].v >> map[i].w;
	}
	sort(map+1,map+m+1,cmp);
	for(int i=1;i<=n;i++) prn[i] = i;
	for(int i=1;i<=m;i++){
		Union(map[i].u,map[i].v,map[i].w); 
	}
	cin >> q;
	for(int i=1;i<=q;i++){
		cin >> x >> y;
		if(x == y){
			puts("0");
			continue;
		}
		int ix = find(x);
		int iy = find(y);
		if(ix != iy) cout << "impossible";
		else cout << Query(x,y);
		putchar('\n');
	}
	return 0;
}

3. 随机合并

void merge(int x,int y){
	int t1 = find(x);
	int t2 = find(y);
	if(t1 == t2) return;
	if(rand()%2) prn[t1] = t2;
	else prn[t2] = t1;
}

---

返回