Dragon Ball--hdoj
2015-08-10 19:40
489 查看
Dragon Ball
[align=left]Problem Description[/align]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.
![](http://acm.hdu.edu.cn/data/images/C308_1004_1.jpg)
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 3 3 T 1 2 T 3 2 Q 2 3 4 T 1 2 Q 1 T 1 3 Q 1
[align=left]Sample Output[/align]
Case 1: 2 3 0 Case 2: 2 2 1 3 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; }
相关文章推荐
- POJ3274----Gold Balanced Lineup(黄金平衡)
- .Net 使用 GregorianCalendar 获取任意一天为一年的第几周
- Mongo操作
- 安装 Django
- UVA 10635 - Prince and Princess ( LCS 转换为LIS )
- django中的ajax实现(GET)
- GoldenGate常见问题及处理
- poj 2195 Going Home
- 获取google Map API Key方法
- nyoj30Gone Fishing
- POJ 2195 Going Home(BFS+KM求最小权值)
- Diesel Watch Womens are just good for any occasion
- Google OAuth2验证
- 【HDU4722】【Good Numbers】
- 使用脚本批量执行GOGO命令
- hdu 4722 Good Numbers( 数位dp入门)
- Google Gson 使用简介
- Go-下载网上图片
- Django访问量和页面点击数统计
- [学习笔记]Lingo超经典案例大全