记录编号	224498	评测结果	AAAAAAAAAA
题目名称	[NOI 2002]银河英雄传说	最终得分	100
用户昵称	SOBER GOOD BOY	是否通过	通过
代码语言	C++	运行时间	4.261 s
提交时间	2016-02-16 12:06:50	内存使用	0.66 MiB

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=30010;
int n,father[maxn]={0},before[maxn]={0};
int Count[maxn]={1};bool panduan(int,int);
void hebing(int,int);
int Findroot(int);
int main()
{
	freopen("galaxy.in","r",stdin);
	freopen("galaxy.out","w",stdout);
	int n;
	cin>>n;
	for(int i=1;i<=maxn;i++)
	{
		Count[i]=1;
		father[i]=i;
	}
	for(int i=1;i<=n;i++)
   {
   	char ch;int x,y;
   	cin>>ch>>x>>y;
   	if(ch=='M')
   	{
   		if(panduan(x,y)) continue;
   		else
   		{
   			//cout<<"+++++++++++======+++++++++++"<<endl;
   			hebing(x,y);
   			continue;
   		}
   	}
   	if(ch=='C')
   	{
   		if(panduan(x,y))
   		{
   			cout<<abs(before[x]-before[y])-1<<endl;
   			continue;
   		}
   		else
		   {
   			
   			cout<<-1<<endl;
		   	continue;
		   }
   	}
   }
}
void hebing(int a,int b)
{	
	a=Findroot(a);
	b=Findroot(b);
	father[a]=b;
	before[a]=Count[b];
	Count[b]=Count[a]+Count[b];
}
int Findroot( int x)
{
	if(father[x]!=x)
	{
		int re=Findroot(father[x]);
		before[x]+=before[father[x]];
		father[x]=re;
	}
	return father[x];
}
bool panduan(int x,int y)
{
	return Findroot(x)==Findroot(y);
}