题目描述:
John are playing with blocks. There are N blocks (1 <= N <= 30000) numbered 1…N。Initially, there are N piles, and each pile contains one block. Then John do some operations P times (1 <= P <= 1000000). There are two kinds of operation:
M X Y : Put the whole pile containing block X up to the pile containing Y. If X and Y are in the same pile, just ignore this command.
C X : Count the number of blocks under block X
You are request to find out the output for each C operation.
输入:
The first line contains integer P. Then P lines follow, each of which contain an operation describe above.
输出:
Output the count for each C operations in one line.
样例输入:
6
M 1 6
C 1
M 2 4
M 2 6
C 3
C 4
样例输出:
1
0
2
带权并查集,在带本身和不带本身之间犹豫了好久,发现怎么试都不行
最后发现组合起来就可以了
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int father[40000];
int sum[40000];//不包括他自己本身在内的砖块数量
int num[40000];//包括他自己本身在内的一下的砖块数量
int findd(int a)
{
if(father[a]==a)return a;
else
{
int t=father[a];
father[a]=findd(father[a]);
sum[a]+=sum[t];
return father[a];
}
}
void unit(int a,int b)
{
int x=findd(a);
int y=findd(b);
if(x==y)return ;
father[x]=y;
sum[x]=num[y];
num[y]+=num[x];
num[x]=0;
}
int main()
{
int n;
scanf("%d",&n);
memset(sum,0,sizeof(sum));
string bb;
for(int i=0;i<=30000;i++)
{
father[i]=i;
num[i]=1;
}
while(n--)
{
cin>>bb;
if(bb=="M")
{
int a,b;
scanf("%d%d",&a,&b);
unit(a,b);
}
else
{
int a;
scanf("%d",&a);
findd(a);
printf("%d\n",sum[a]);
}
}
return 0;
}