PKU 1988 并查集

Cube Stacking

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 10123		Accepted: 3365
Case Time Limit: 1000MS

Description

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.

Input

* 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.

Output

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

Sample Input

6
M 1 6
C 1
M 2 4
M 2 6
C 3
C 4

Sample Output

1
0
2

#include<stdio.h>
int set[3000];
int up[3000];
int sum[3000];
void init()
{
	int i;
	for(i=1;i<3000;i++)
	{
		set[i]=i; // 父节点
		up[i]=0;  // 表示i点的上面有几个
		sum[i]=1; // 表示根节点i所在堆的元素个数
	}
}
int getfather(int x)
{
	int r;
	if(set[x]!=x)  // 这里注意是if
	{
		r=set[x];
		set[x]=getfather(set[x]);
		up[x]+=up[r];//该节点x头上的节点个数等于其父节点头上的加上自己原本头上的
	}
	return set[x];
}
void merge(int x,int y)
{
	int a=getfather(x);
	int b=getfather(y);
	set[b]=a;
	up[b]=sum[a];
	sum[a]+=sum[b];
}
int main()
{
	int p;
	while(scanf("%d%*c",&p)!=EOF)
	{
		init();
		int i,a,b;
		char ch;
		int t;
		for(i=0;i<p;i++)
		{
	//		getchar();
			scanf("%c",&ch);
			if(ch=='M')
			{
				scanf("%d%d%*c",&a,&b);
				merge(a,b);
			}
			else if(ch=='C')
			{
				scanf("%d%*c",&a);
				t=getfather(a);
				printf("%d/n",sum[t]-up[a]-1);
			}
		}
	}
	return 0;
}