银河英雄传说（带边权并查集）

#include<bits/stdc++.h>
using namespace std;
const int N=3e4+100;
const int M=5e5+100;
int siz[N];
int d[N];
int fa[N];
int find(int x){
	if(fa[x]==x) return x;
	int root=find(fa[x]);
	d[x]+=d[fa[x]];
	return fa[x]=root;
}
int main(){
	for(int i=1;i<=N;i++){
		fa[i]=i;
		siz[i]=1;
	}
	int T;scanf("%d",&T);
	while(T--){
		char c;cin>>c;//scanf("%c",&c);
		int a,b;scanf("%d%d",&a,&b);
		if(c=='M'){
			int pa=find(a),pb=find(b);
			if(pa==pb) continue;
			else{
				d[pa]+=siz[pb];
				fa[pa]=pb;
				siz[pb]+=siz[pa];
			}
		}
		else{
			int pa=find(a),pb=find(b);
			if(pa!=pb) puts("-1");
			else{
				printf("%d\n",abs(d[a]-d[b])-1);
			}
		}
	}
	return 0;
}