首页 > 代码库 > Dragon Balls
Dragon Balls
Dragon Balls |
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
| Total Submission(s): 784 Accepted Submission(s): 317 |
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. |
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 23 3T 1 2T 3 2Q 23 4T 1 2Q 1T 1 3Q 1 |
Sample Output Case 1:2 3 0Case 2:2 2 13 3 2 |
Author possessor WC |
Source 2010 ACM-ICPC Multi-University Training Contest（19）——Host by HDU |
Recommend lcy |
/*靠，乱搞一发竟然水过用并查集记录龙珠的根节点（也就是龙珠所在的城市，用一个辅助数组表示城市i对应的龙珠数）然后查询的时候经过几层节点，就对应转移了几次*/#include<bits/stdc++.h>using namespace std;int bin[10005];//键并查集int val[10005];//保存每个城市的龙珠数量int t,n,m;int x,y;char op[2];void inti(){ for(int i=0;i<=n;i++) bin[i]=i,val[i]=1;}int main(){ //freopen("C:\\Users\\acer\\Desktop\\in.txt","r",stdin); scanf("%d",&t); for(int Case=1;Case<=t;Case++) { printf("Case %d:\n",Case); scanf("%d%d",&n,&m); inti(); for(int i=0;i<m;i++) { scanf("%s",&op); if(op[0]==‘T‘)//转移 { scanf("%d%d",&x,&y); while(x!=bin[x])//找根节点 x=bin[x]; while(y!=bin[y])//找根节点 y=bin[y]; val[y]+=val[x];//转移龙珠 val[x]=0; bin[x]=y;//转移龙珠x的根节点 } else//查询 { scanf("%d",&x); int step=0; while(x!=bin[x]) x=bin[x],step++; printf("%d %d %d\n",x,val[x],step); } } } return 0;}
Dragon Balls
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。