并查集模版

#include
using namespace std;
#define int long long
#define endl "\n"
#define PII pair
//#define x first
//#define y second
//priority_queue, greater> pq;//小根堆
const int N=2e5+10;
int fa[N];
int n;
void init(){
	for(int i=0;i<=n;i++)fa[i]=i;
}
int get(int x){
	return fa[x]=(fa[x]==x?x:get(fa[x]));
}
void merge(int a,int b){
	fa[get(a)]=get(b);
}
signed main(){
	cin >> n;
}