每次移动都是一个群龙珠移动到另一群龙珠所在的城市里面。所以这两个城市之间都不会空。
用并查集表示,每一个祖先节点的序号和他们所在城市的序号相同。
无论路径如何压缩,子结点的移动次数=父节点的移动次数+1;
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4943 Accepted Submission(s): 1864
Problem Description
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.
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)
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
/**==========================================
* This is a solution for ACM/ICPC problem
*
* @source£o
* @type:
* @author: wust_ysk
* @blog: http://blog.csdn.net/yskyskyer123
* @email: 2530094312@qq.com
*===========================================*/
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF =0x3f3f3f3f;
const int maxn= 10000 ;
int n,q,pre[maxn+4],cnt[maxn+4],num[maxn+4];
//const int maxV=12 ;
int find(int x,int &s)
{
if(pre[x]==x)
{
s=x;
return x;
}
pre[x]=find(pre[x],s);
cnt[x]+=cnt[s];
s=x;
return pre[x];
}
void init()
{
for(int i=1;i<=n;i++)
{
pre[i]=i;
cnt[i]=0;
num[i]=1;
}
}
void addto()
{
int ball1,ball2;int s;
scanf("%d%d",&ball1,&ball2);
int root1=find(ball1,s);
int root2=find(ball2,s);
pre[root1]=root2;
num[root2]+=num[root1];
num[root1]=0;
cnt[root1]++;
}
void query()
{
int x,s;
scanf("%d",&x);
int root=find(x,s);
printf("%d %d %d\n",root,num[root],cnt[x]);
}
void work()
{
char ch;
scanf(" %c",&ch);
if(ch=='T') addto();
else query();
}
int main()
{
int T,kase=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&q);
printf("Case %d:\n",++kase);
init();
for(int i=1;i<=q;i++)
{
work();
}
}
return 0;
}
不用子结点的移动次数=父节点的移动次数+1 而用比较暴力的方法似乎也可以过。