HDOJ3635 并查集简单运用
来源:互联网 发布:大数据风控总监 编辑:程序博客网 时间:2024/06/08 06:52
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6653 Accepted Submission(s): 2492
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: 3172 3234 3639 3633 3638
路径压缩时候加入更新转移次数操作
#include <iostream>#include <ctime>#include <cstring>#include <cmath>using namespace std;const int maxn = 1e4+5;int f[maxn],ans[maxn],times[maxn];int i,j,k,n,q,root,a,b;int Find(int x) { int y; if (f[x]==x) return x; y = f[x]; f[x] = Find(f[x]); times[x] += times[y]; return f[x];}void Union(int x, int y) { int fx = Find(x), fy = Find(y); if (fx!=fy) { f[fx] = fy; ans[fy] += ans[fx]; times[fx] = 1; }}void init(){ char cc; cin >> n >> q; for (i=1; i<=n; i++) { f[i] = i; ans[i] = 1; times[i] = 0; } for (i=1; i<=q; i++) { cin >> cc; if (cc=='T') { cin >> a >> b; Union(a,b); } else { cin >> a; root = Find(a); cout << root << " " << ans[root] << " " << times[a] << endl; } }}int main(){ std::ios::sync_with_stdio(false); int T; cin >> T; for (j=1; j<=T; j++) { cout << "Case " << j << ":" << endl; init(); } return 0;}
阅读全文
0 0
- HDOJ3635 并查集简单运用
- poj1661 并查集简单运用
- 并查集:HDU5326-Work(并查集比较简单灵活的运用)
- 并查集的运用
- 简单并查集
- 简单并查集
- 简单并查集
- 简单并查集
- 简单并查集
- 简单并查集
- uva 10129 并查集的运用
- hdu1272(并查集的运用)
- 【算法】并查集的运用
- hdu 1829 带权并查集的运用类似于食物链但是更简单些
- 并查集简单应用
- zoj1789-简单并查集
- zoj2740-简单并查集
- 并查集简单模板
- 写给自己的话
- 将n个数分为m个数[动态规划][两种思路]
- 拼上物联网最后拼图 IBM启动LoRa平台
- 是时候对RxLifecycle来篇详解了
- 物联网专用网络商用在即:LoRa离我们不远了
- HDOJ3635 并查集简单运用
- Laravel入门及实践,快速上手社交系统ThinkSNS+二次开发
- hadoop java API(二)
- Actility公司及其物联网专用低功耗广域网络方案
- 经典的启发
- 关于使用Delphi XE10 进行android开发的一些总结
- 旁路与串接
- C#Windows7任务栏开发Thumbnail Toolbars(缩略图、工具栏按钮)
- SWT常用组件