#include<cstdio>
#include<algorithm>
using namespace std;
int root[30010];
int num1[30010];
int num2[30010];
int find2(int x)
{
if(x != root[x])
{
int fx = root[x];
root[x] = find2(fx);
num1[x] += num1[fx];
}
return root[x];
}
void Union(int a,int b)
{
int fa = find2(a);
int fb = find2(b);
if(fa != fb)
{
root[fa] = fb;
num1[fa] = num2[fb] + 1;
num2[fb] += num2[fa] + 1;
}
}
int main()
{
for(int i=1;i<=30000;i++) root[i]=i;
int p;
scanf("%d",&p);
while(p--)
{
char c;
scanf("%*c%c",&c);
if(c == 'M'){
int a,b;
scanf("%d%d",&a,&b);
Union(a,b);
}
else {
int d;
scanf("%d",&d);
find2(d);
printf("%d\n",num1[d]);
// for(int i=1;i<=10;i++)
// printf("%d ",num1[i]); printf("\n");
}
}
return 0;
}
开了3个数组,要仔细想
并查集压缩hdu2818
最新推荐文章于 2017-12-02 11:14:10 发布