poj 1988 Cube Stacking

Cube Stacking

Time Limit: 2000MS Memory Limit: 30000K
Total Submissions: 24167 Accepted: 8479
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
Source

USACO 2004 U S Open

题意：有N个小立方体，标号从1到N，现在有两种操作：

1.move 操作：输入两个数据：x和y,将含有标号x的那一组立方体放到含有标号y的那一组立方体的上面（顺序不要反了）

2,.count操作：输入一个数据：x，找到编号x的那个立方体，输出在其下面的立方体的个数。

首先这是一个并查集题目，并且是一个关系型并查集

那就顺便提一下并查集三步骤：1.初始化：init()   2.查找根节点（路径压缩）：find()    3.合并：merge()

这道题目思路是这样的：定义一个status []数组存根节点的下面的元素个数，再定义一个dis[]数组存每一个元素与根节点之间的距离（这就要求在根节点发生变化和“”合并“”操作时及时更新这两个数组），详情见代码

PS:这道题建议自己画一画

//种类并查集 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> using namespace std; int f[30005]; int status[30005];//根节点以下的元素个数（可能有好几组，所以可能有好几个根节点） int dis[30005];//每一个元素到它的根节点的距离 void init() { int i; for(i=1;i<=30005;i++) { f[i]=i; status[i]=0; dis[i]=0; } } int getf(int x) { if(f[x]==x) return x; else { int temp=f[x]; f[x]=getf(f[x]); dis[x]+=dis[temp];//递归时，每一次元素根节点的改变就意味着到根节点距离的改变 } return f[x]; } void merge(int x,int y) { int tx=getf(x); int ty=getf(y); if(tx!=ty) { f[ty]=tx; dis[ty]=status[tx]+1;//因为ty的根节点变成了tx，所以ty就不是根节点了，这是要改变ty到根节点的距离，这里只将ty的dis[]值改变就可以啦，剩余的在getf()中改变（注意：：：千万不要和下面那句搞反了，一定是在status[tx]之前执行） status[tx]+=status[ty]+1;//将根节点以下的元素个数改变 } } int main() { int P,i,x,y; char str[2]; while(~scanf("%d",&P)) { init(); for(i=0;i<P;i++) { scanf("%s",str); if(str[0]=='M') { scanf("%d%d",&x,&y); merge(x,y); } else { scanf("%d",&x); int tx=getf(x); printf("%d\n",status[tx]-dis[x]); } } } return 0; } </cstring></cstdlib></cstdio></iostream>