poj 1988 Cube Stacking（并查集）

Cube Stacking

Time Limit: 2000MS

Memory Limit: 30000K

Total Submissions: 14901

Accepted: 5037

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

Sample Output

Source

逾時代嗎，雖然功能是實作了但卻是一直到逾時，因為沒有真正的掌握并查集使用方法：

<a></a>

并查集AC代碼

本文轉自NewPanderKing51CTO部落格，原文連結：http://www.cnblogs.com/newpanderking/archive/2012/09/06/2673678.html ，如需轉載請自行聯系原作者