|
||||||||||
Building BlockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8138 Accepted Submission(s): 2509 Problem Description 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. Input The first line contains integer P. Then P lines follow, each of which contain an operation describe above. Output Output the count for each C operations in one line. Sample Input
Sample Output
Source | ||||||||||
|