Dragon Ball--hdoj
来源:互联网 发布:python 迭代器使用 编辑:程序博客网 时间:2024/04/30 13:39
Dragon Ball
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)
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>#include<string.h>int pre[1010],num[1010],time[1010],Case=1;int find(int x){if(x==pre[x])return x;int p=pre[x];time[x]+=time[p];return pre[x];}void join(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){pre[fx]=fy;num[fy]+=num[fx];time[fx]++;}}int main(){int t;scanf("%d",&t);while(t--){int i,u,v,m,n;char ch;scanf("%d%d",&m,&n);for(i=0;i<=m;i++){pre[i]=i;time[i]=0;num[i]=1;}while(n--){getchar();scanf("%c%d",&ch,&u);if(ch=='T'){scanf("%d",&v);join(u,v);}else{v=find(u);printf("Case %d:\n",Case++);printf("%d %d %d\n",v,num[v],time[u]);}}}return 0;}
0 0
- Dragon Ball--hdoj
- HDU 3872 Dragon Ball
- hdu 3872 Dragon Ball
- HDU_3872 Dragon Ball dp
- HDU 4362 - Dragon Ball
- 【DP】 hdu4362 Dragon Ball
- HDU-4363-Dragon Ball
- hdu 4362 Dragon Ball
- hdu 4362 Dragon Ball(dp)
- hdoj 3635 Dragon Balls
- Hdoj 2635 Dragon Balls
- hdu_4362 Dragon Ball (DP+单调栈)
- MUTC7 C - Dragon Ball 单调队列dp
- hdu 4362 Dragon Ball(优先队列+dp)
- HDU 4362 Dragon Ball 线段树
- hdu4326 Dragon Ball 单调队列优化Dp
- HDOJ Color the ball
- hdoj Color the ball
- 【UESTC】【windy数】
- C++标准程序库笔记(1)
- 杭电 1711 Number Sequence kmp
- 数据结构(13)线性表
- 数学之最美公式
- Dragon Ball--hdoj
- Android的MediaPlayer架构介绍
- UI09_多种tableView
- 癌症晚期的妻子被丈夫威胁离婚后,居然有一位“备胎”站了出来
- mysql 创建用户
- 【笔试】15、输入三个整数x,y,z,请把这三个数由小到大输出。
- ubuntu 安装后要做的事情
- Map Labeler (poj 2296 二分+2-SAT)
- leetcode 118 —— Pascal's Triangle