zoukankan      html  css  js  c++  java
  • Dragon Ball--hdoj

                                               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.
     

    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
    2 3 3 T 1 2 T 3 2 Q 2 3 4 T 1 2 Q 1 T 1 3 Q 1
     

    Sample Output
    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:
    ",Case++);
    				printf("%d %d %d
    ",v,num[v],time[u]);
    			}
    		}
    	}
    	return 0;
    }

  • 相关阅读:
    cloudemanager安装时出现8475 MainThread agent ERROR Heartbeating to 192.168.30.1:7182 failed问题解决方法(图文详解)
    cloudemanager安装时出现ProtocolError: <ProtocolError for 127.0.0.1/RPC2: 401 Unauthorized>问题解决方法(图文详解)
    青年的第一要务是自立
    [转]Sql Server 主从数据库配置
    [转]SQL Server表分区
    [转]WCF体系结构-一张图就是好
    Bootstrap
    [转]在WIN7下安装运行mongodb
    [转]使用Node.js完成的第一个项目的实践总结
    [转]win系统下nodejs安装及环境配置
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273850.html
Copyright © 2011-2022 走看看