关键词：
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10628 Accepted Submission(s): 3802
Problem Description
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
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
Sample Input
Sample Output
题目大意与分析
n个龙珠，q次操作 T操作是将a所在的堆移到b堆上 Q操作是问a所在的堆是哪一个、堆上有多少龙珠以及a目前为止移动了多少次
带权并查集，在find函数压缩路径的时候修改step值，子节点的移动次数等于子节点移动次数+父节点移动次数（因为在合并的时候修改的是根节点的次数，所以在find函数中要修正子节点的移动次数）
#include<bits/stdc++.h> using namespace std; int s[10005],n,m,sum[10005],step[10005],t,k=0; char C[2]; int findf(int x) if(s[x]==x) return x; else int temp=s[x]; s[x]=findf(s[x]); step[x]+=step[temp]; //修正步数 return s[x]; void hebing(int x,int y) int fx=findf(x); int fy=findf(y); if(fx!=fy) s[fx]=fy; //x移到y上 所以修改s[fx] step[fx]++; sum[fy]+=sum[fx]; int main() scanf("%d",&t); ios::sync_with_stdio(false); while(t--) scanf("%d%d",&n,&m); k++; printf("Case %d: ",k); for(int i=1;i<=n;i++) s[i]=i; sum[i]=1; step[i]=0; while(m--) scanf("%s",&C); if(C[0]==‘T‘) int a,b; scanf("%d%d",&a,&b); hebing(a,b); else int a; scanf("%d",&a); int fa=findf(a); printf("%d %d %d ",fa,sum[fa],step[a]);
hdu3635dragonballs（带权并查集）(代码片段)
DragonBallsTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):10628 AcceptedSubmission(s):3802ProblemDescriptionFivehundredyearslater,thenumberofdragonballswillincreaseunexpectedly,soit‘stoodifficultforMonkeyKing... 查看详情
hdu3635dragonballs(并查集)
DragonBallsTimeLimit:2000/1000ms(Java/Other) MemoryLimit:32768/32768K(Java/Other)TotalSubmission(s):64 AcceptedSubmission(s):26Font: TimesNewRoman | Ve 查看详情
hdu-3635dragonballs并查集(代码片段)
题意：1~N个龙珠，放在1~N个城市，有两种操作：TAB将A所再城市的所有球转移到B所在的城市。QX询问X所在的城市pls，该城市中龙珠数量nm，以及龙珠转移次数trs题解：并查集模板题，顺带更新一些数据。pls不必更新，因为X所在的... 查看详情
hdu1289abug'slife（带权并查集）(代码片段)
HDU1289带权并查集ProblemDescriptionBackgroundProfessorHopperisresearchingthesexualbehaviorofararespeciesofbugs.Heassumesthattheyfeaturetwodifferentgendersandthattheyonlyinteractwithbugsoftheoppositegender. 查看详情
hdu3038howmanyanswersarewrong（带权并查集）
HowManyAnswersAreWrongProblemDescriptionTTandFFare...friends.Uh...veryverygoodfriends-________-bFFisabadboy,heisalwayswooingTTtoplaythefollowinggamewithhim.Thisisaveryhumdrumgame.Tobeginwith,TTshouldw 查看详情
hdu3038howmanyanswersarewrong（带权并查集）
传送门DescriptionTTandFFare...friends.Uh...veryverygoodfriends-________-bFFisabadboy,heisalwayswooingTTtoplaythefollowinggamewithhim.Thisisaveryhumdrumgame.Tobeginwith,TTshouldwritedownasequenceofinteger 查看详情
带权并查集复习-hdu3038
TTandFFare...friends.Uh...veryverygoodfriends-________-bFFisabadboy,heisalwayswooingTTtoplaythefollowinggamewithhim.Thisisaveryhumdrumgame.Tobeginwith,TTshouldwritedownasequenceofintegers-_-!!(bored). 查看详情
hdu3038howmanyanswersarewrong[带权并查集]
HowManyAnswersAreWrongTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):6336 AcceptedSubmission(s):2391ProblemDes 查看详情
hdu_3172_带权并查集
VirtualFriendsTimeLimit:4000/2000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):8229 AcceptedSubmission(s):2363ProblemDescription 查看详情
hdu2818（带权并查集）
题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=2818还是不熟练。。。1#include<cstdio>2#include<cstring>3constintmaxn=30005;4intf[maxn],under[maxn],sum[maxn];56voidinit()7{8for(inti=0;i<=maxn;i++ 查看详情
hdu3038howmanyanswersarewrong——带权并查集
题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=3038 HowManyAnswersAreWrongTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1 查看详情
hdu-3038带权并查集
这道题我拖了有8个月...今天放假拉出来研究一下带权的正确性,还有半开半闭的处理还有ab指向的一系列细节问题#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>usingnamespacestd;constintmaxn=200010;intp[maxn],r[m 查看详情
带权并查集hdu3047zjnustadium
http://acm.hdu.edu.cn/showproblem.php?pid=3047【题意】http://blog.csdn.net/hj1107402232/article/details/9921311【Accepted】1#include<iostream>2#include<cstdio>3#include<cstring>4#include&l 查看详情
hdu3038howmanyanswersarewrong(带权并查集)(代码片段)
HowManyAnswersAreWrongTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):14876 AcceptedSubmission(s):5237ProblemDe 查看详情
hdu3038：howmanyanswersarewrong(带权并查集)(代码片段)
HowManyAnswersAreWrongTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):16338 AcceptedSubmission(s):5724题目链接：http 查看详情
hdu-3038/3048（带权并查集）（待补）
题目链接：点我点我题意：题解：两题代码差不多，放个3047的。1#include<cstdio>2#include<iostream>3#include<algorithm>4usingnamespacestd;56constintN=200010;7intFather[N],value[N];89intfind(intx){10if(x==Father[x]) 查看详情
hdu3047zjnustadium（带权并查集，难想到）(代码片段)
M-ZjnuStadiumTimeLimit:1000MS MemoryLimit:32768KB 64bitIOFormat:%I64d&%I64uSubmitStatusDescriptionIn12thZhejiangCollegeStudentsGames2007,therewasanews 查看详情
hdu3038howmanyanswersarewrong（带权并查集）
题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=1272题目大意：有n条信息，每条信息都给出区间l到r的值，如果后面出现的信息与前面的矛盾，那么就算是一个错误信息，问一共给出多少错误信息。比如1给出三条信息1410，125，346... 查看详情