Cube Stacking

Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perform P (1<= P <= 100,000) operation. There are two types of operations:
moves and counts.

• In a move operation, Farmer John asks Bessie to move the stack containing cube X on top of the stack containing cube Y.
• In a count operation, Farmer John asks Bessie to count the number of cubes on the stack with cube X that are under the cube X and report that value.

Write a program that can verify the results of the game.

输入描述:

• Line 1: A single integer, P

• Lines 2…P+1: Each of these lines describes a legal operation. Line 2 describes the first operation, etc. Each line begins with a ‘M’ for a move operation or a ‘C’ for a count operation. For move operations, the line also contains two integers: X and Y.For count operations, the line also contains a single integer: X.

Note that the value for N does not appear in the input file. No move operation will request a move a stack onto itself.

输出描述:

Print the output from each of the count operations in the same order as the input file.

示例1
输入
6
M 1 6
C 1
M 2 4
M 2 6
C 3
C 4
输出
1
0
2

#include <iostream>
#include <stdio.h>
using namespace std;
struct node
{
	int pre;
	int size;
	int dis;
}a[30010];
void init()
{
	for(int i=1;i<=30000;++i){
		a[i].pre=i;
		a[i].size=1;
		a[i].dis=0;
	}
}
int find(int x)
{
	if(a[x].pre==x)return x;
	
	int k=a[x].pre;
	int z=find(k);
	a[x].dis+=a[k].dis;
	a[x].pre=z;
	
	return z;
}
void merge(int x,int y)
{
	int fx=find(x),fy=find(y);
	if(fx!=fy){
		a[fx].pre=fy;
		a[fx].dis+=a[fy].size;
		a[fy].size+=a[fx].size;
	}
}
int main()
{
	init();
	int p,x,y;
	scanf("%d",&p);
	char s;
	while(p--)
	{
		scanf(" %c",&s);
		if(s=='M')
		{
			scanf("%d%d",&x,&y);
			merge(x,y);
		}
		else
		{
			scanf("%d",&x);
			find(x);
			printf("%d\n",a[x].dis);
		}
	}
	return 0;
}