标签：city balls 查集 dragon hdu3635 ball cities WuKong
hdu3635
题目链接：https://acm.dingbacode.com/showproblem.php?pid=3635
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12779 Accepted Submission(s): 4398
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 考察并查集，AC之前有过CE TLE RE。。。调了很久。。。。后来找博客解决了。。 AC代码：
1 #include<stdio.h>
2 #include<string.h>
3 const int maxn=1e4+5;
4 int s[maxn],sum[maxn],cnt[maxn];
5 void init_set(int n){//初始化
6 for(int i=1;i<=n;i++){
7 s[i]=i;
8 sum[i]=1;//城市中龙珠数
9 cnt[i]=0;//转移次数
10 }
11 }
12 int find_set(int x){//查找优化，递归
13 if(s[x]!=x){
14 int temp=s[x];
15 int root=find_set(s[x]);//定位根节点
16 cnt[x]+=cnt[temp];
17 return s[x]=root;
18 }
19 else return s[x];
20 }
21 void union_set(int x,int y){//合并优化
22 x=find_set(x);
23 y=find_set(y);
24 if(x!=y){
25 s[x]=y;
26 sum[y]+=sum[x];
27 sum[x]=0;
28 cnt[x]=1;
29 }
30 }
31 int main(){
32 int t,n,q,a,b;
33 scanf("%d",&t);
34 for(int j=1;j<=t;j++){
35 scanf("%d%d",&n,&q);
36 init_set(n);
37 printf("Case %d:\n",j);
38 while(q--){
39 char ss;
40 getchar();
41 ss=getchar();
42 if(ss=='T'){
43 scanf("%d%d",&a,&b);
44 union_set(a,b);
45 }
46 else{
47 scanf("%d",&a);
48 int root=find_set(a);
49 printf("%d %d %d\n",s[a], sum[root],cnt[a]);
50 }
51 }
52 }
53 return 0;
54 }
View Code
代码参考：https://www.cnblogs.com/lyj1/p/11892482.html
标签：city,balls,查集,dragon,hdu3635,ball,cities,WuKong 来源： https://www.cnblogs.com/ynzhang2020/p/15048536.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。