HDU 3635 Dragon Balls
来源:互联网 发布:iphone 163 smtp端口 编辑:程序博客网 时间:2024/05/16 08:05
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
并查集,记录转移次数和总数即可。
#include<stdio.h>const int maxn = 10005;int n, m, T, x, y, fa[maxn], num[maxn], dis[maxn];char c[2];int find(int x){ if (fa[x] == x) return x; int t = fa[x]; fa[x] = find(t); dis[x] += dis[t]; return fa[x];}void merge(){ scanf("%d%d", &x, &y); int fx = find(x), fy = find(y); if (fx == fy) return; fa[fx] = fy; num[fy] += num[fx]; dis[fx]++;}void begin(){ for (int i = 0; i <= n; i++) { fa[i] = i; dis[i] = 0; num[i] = 1; }}int main(){ scanf("%d", &T); for (int i = 1; i <= T; i++) { scanf("%d%d", &n, &m); begin(); printf("Case %d:\n", i); while (m--) { scanf("%s", c); switch (c[0]) { case 'T':merge(); break; case 'Q':{ scanf("%d", &x); int fx = find(x); printf("%d %d %d\n", fx, num[fx], dis[x]); } } } } return 0;}
0 0
- 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 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
- 3635 HDU Dragon Balls
- hdu 3635 Dragon Balls
- hdu-3635 Dragon Balls
- HDU 3635 Dragon Balls
- 优先队列
- 为什么在函数的声明后面还有一个 const?
- C#读取EXCEL中工作表不是Sheet1等默认名称
- 调用Jackson一行解析海量复杂结构的json数据
- java中多线程的实现方式以及区别(1)
- HDU 3635 Dragon Balls
- STUN和TURN技术浅析
- maven打包 含src下的xml文件
- JAVA 单播、多播(组播)、广播
- 因特网的IP协议是不可靠无连接的,那为什么当初不直接把它设计为可靠的?
- Codeforces Round #296 (Div. 1) (A B)
- 办公系统中经常遇到的权限管理问题 (一)
- JAVA 多线程下载及断点续传
- GUI和网络编程