HDOJ 题目3635Dragon Balls(带权值的并查集,模板)
来源:互联网 发布:淘宝详情页怎么收费 编辑:程序博客网 时间:2024/05/29 19:16
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3069 Accepted Submission(s): 1198
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
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 | We have carefully selected several similar problems for you: 1856 3234 3639 3633 3638
ac代码
#include<stdio.h>#include<string.h>int pre[20000],num[20000],time[20000];int find(int x){int p;if(x==pre[x])return x;p=pre[x];pre[x]=find(pre[x]);time[x]+=time[p];return pre[x];}void mem(int x,int y){int fx,fy;fx=find(x);fy=find(y);if(fx!=fy){pre[fx]=fy;num[fy]+=num[fx];time[fx]++;}}int main(){int t,cot=0;scanf("%d",&t);while(t--){int n,m,i;scanf("%d%d",&n,&m);//getchar();printf("Case %d:\n",++cot);for(i=1;i<=n;i++){pre[i]=i;num[i]=1;time[i]=0;}while(m--){char c;int u,v;getchar();scanf("%c %d",&c,&u);if(c=='T'){scanf("%d",&v);mem(u,v);}else{v=find(u);printf("%d %d %d\n",v,num[v],time[u]);}}}}
0 0
- HDOJ 题目3635Dragon Balls(带权值的并查集,模板)
- HDOJ-3635 Dragon Balls (并查集的查找)
- HDOJ 3635 Dragon Balls 并查集
- hdoj 3635 Dragon Balls【并查集】
- HDOJ 3635 Dragon Balls(并查集)
- hdoj 3635 Dragon Balls 并查集的基本特征
- hdoj--3635--Dragon Balls(并查集记录深度)
- HDOJ 3635 Dragon Balls(并查集)
- (并查集+记录到根的距离)Dragon Balls--HDOJ
- HDU 3635 Dragon Balls(并查集)
- hdu 3635 Dragon Balls(并查集)
- HDU 3635 Dragon Balls - 并查集
- hdu 3635 Dragon Balls 并查集
- HDU 3635 Dragon Balls(并查集)
- hdu-3635 Dragon Balls(并查集)
- HDU 3635 Dragon balls -并查集
- hdu Dragon Balls 3635【并查集】
- HDU 3635 Dragon Balls(并查集)
- for循环的注意点
- 稀疏矩阵——行逻辑连接的顺序三元组表
- python抽象
- Linux高级进程间通信:UNIX域套接字
- 漫步云中网络
- HDOJ 题目3635Dragon Balls(带权值的并查集,模板)
- jQuery学习之六-----DOM节点操作
- csu1065_Scientific Conference
- Android中使用selector动态改变imageView或ImageButton的背景和在GridView中应用
- 『IOS』Property with 'retain (or strong)' attribute must be of object type
- ffmpeg logo处理
- 字符集相关的小结【收集中】
- 项目开发过程中的经验
- LeetCode-N-Queens II