Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together.
His country has N cities and there are exactly N dragon balls in the world. At first, for the ith dragon ball, the sacred dragon will puts it in the ith city. Through long years, some cities' dragon ball(s) would be transported to other cities. To save physical strength WuKong plans to take Flying Nimbus Cloud, a magical flying cloud to gather dragon balls.
Every time WuKong will collect the information of one dragon ball, he will ask you the information of that ball. You must tell him which city the ball is located and how many dragon balls are there in that city, you also need to tell him how many times the ball has been transported so far.
Input
The first line of the input is a single positive integer T(0 < T <= 100).
For each case, the first line contains two integers: N and Q (2 < N <= 10000 , 2 < Q <= 10000).
Each of the following Q lines contains either a fact or a question as the follow format:
T A B : All the dragon balls which are in the same city with A have been transported to the city the Bth ball in. You can assume that the two cities are different.
Q A : WuKong want to know X (the id of the city Ath ball is in), Y (the count of balls in Xth city) and Z (the tranporting times of the Ath ball). (1 <= A, B <= N)
Output
For each test case, output the test case number formated as sample output. Then for each query, output a line with three integers X Y Z saparated by a blank space.
Sample Input
2 3 3 T 1 2 T 3 2 Q 2 3 4 T 1 2 Q 1 T 1 3 Q 1
Sample Output
Case 1: 2 3 0 Case 2: 2 2 1 3 3 2
Author
possessor WC
Source
2010 ACM-ICPC Multi-University Training Contest(19)——Host by HDU
Recommend
lcy
思路分析:带权并查集。当某点被归并到另一点二者建立父子关系之后,如果移动父节点,此时子节点其实是相对父节点“静止”的。用value表示某点到另一点的移动次数。某点到根节点的移动次数就等于某点到中间节点的移动次数加中间节点到根节点的移动次数。所以我们只需记录某一结点到其父节点的移动次数即可,路径压缩的时候再根据这种相对关系调整权值,也就是逐层相加到其祖先即可。
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <queue>
#include <algorithm>
#include <string.h>
using namespace std;
int n,t,q,x,y,ans;
int tree[10010];
int value[10010];
int num[10010];
int find(int x){
int tmp=x;
while(tmp!=tree[tmp]){
tmp=tree[tmp];
value[x]+=value[tmp];
}
return tree[x]=tmp;
}
int main()
{
scanf("%d",&t);
for(int k=1;k<=t;k++){
scanf("%d%d",&n,&q);
memset(value,0,sizeof(value));
for(int i=0;i<=n;i++){
tree[i]=i;
num[i]=1;
}
printf("Case %d:\n",k);
char ch;
while(q--){
scanf(" %c",&ch);
if(ch=='T'){
scanf("%d%d",&x,&y);
int rx=find(x);
int ry=find(y);
if(rx!=ry){
tree[rx]=ry;
value[rx]++;
num[ry]+=num[rx];
}
}
if(ch=='Q'){
scanf("%d",&x);
int rx=find(x);
printf("%d %d %d\n",rx,num[rx],value[x]);
}
}
}
return 0;
}