【模板】并查集

#include<bits/stdc++.h>
using namespace std;
const int z = 1024;
int parent[z];
void initial(const int key) {
	for(int i = 1;i <= key;++i) parent[i] = i;
	return;
}
int find(int x) {
	while(x != parent[x]) x = parent[x];
	return x;
}
int find_press(const int x) {
	if(x != parent[x])
		fa[x] = find_press(parent[x]);
	return parent[x];
}
int dunion(int x,int y) {
	x = find_press(x);
	y = find_press(y);
	parent[x] = y;
}
int main() {
	//to do;
}

@bikuhiku