hdoj--3635--Dragon Balls(并查集记录深度)
2016-02-01 15:33
519 查看
Dragon Balls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4927 Accepted Submission(s): 1855
[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.
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
[align=left]Author[/align]
possessor WC
[align=left]Source[/align]
2010 ACM-ICPC Multi-University Training Contest(19)——Host
by HDU
很早以前做的一道题,回头再做一次
#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=find(x); int 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); printf("Case %d:\n",++cot); for(i=1;i<=n;i++) { pre[i]=i; num[i]=1; time[i]=0; } while(m--) { char op[2]; int u,v; scanf("%s %d",op,&u); if(op[0]=='T') { scanf("%d",&v); mem(u,v); } else { v=find(u); printf("%d %d %d\n",v,num[v],time[u]); } } } }
相关文章推荐
- 解决 Google Chrome 读取 favicon.ico 错误
- Take good care of your eyes
- Golang语言特性
- Gergovia的酒交易(Uva11054,Wine trading in Gergovia)
- djangocms安装技巧
- <19> go random string
- django_cms安装技巧
- 开始使用Google Analytics 示例
- 有用的 Google Analytics Chrome 插件推荐
- 使用DreamHost当GoDaddy域名的服务器 步骤
- redigo长连接/复用
- Go将统治下一个十年
- paper4—Multi-MPE_Trigger_Algorithm—temp
- AlphaGo:黑色方碑?
- paper4—Multi-MPE_Trigger_Algorithm—testing
- paper3—Algorithm1-Engine-Trigger-on-FCD—temp
- paper3—Algorithm2-Engine-Trigger-on-SMD—temp
- Google Guava 类库简介
- 114DNS Public DNS+ 阿里DNS 百度DNS 360 DNS派 Google DNS
- pymongo简单用法