zoukankan      html  css  js  c++  java
  • HDU 3635 Dragon Balls(并查集)

                 Dragon Balls




     

    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
     
     1 #include<cstdio>
     2 using namespace std;
     3 
     4 const int maxn=10005;
     5 
     6 int bin[maxn],rank[maxn],cnt[maxn];
     7 
     8 int find(int x)
     9 {  
    10     if(x==bin[x]) return x;  
    11     int t=bin[x];  
    12     bin[x] = find(bin[x]);  
    13        cnt[x] += cnt[t];  
    14     return bin[x];   
    15 }
    16 
    17 
    18 void merge(int x,int y)
    19 {
    20     int fx=find(x);
    21     int fy=find(y);
    22     if(fx!=fy)
    23     {
    24         bin[fx]=fy;
    25         rank[fy]+=rank[fx];
    26         cnt[fx]=1;
    27     }
    28 }
    29 
    30 int main()
    31 {
    32     //freopen("in.txt","r",stdin);
    33     char c;
    34     int t,kase,n,q,i,a,b;
    35     scanf("%d",&t);
    36     kase=1;
    37     while(t--)
    38     {
    39         printf("Case %d:
    ",kase++); 
    40         scanf("%d%d",&n,&q);
    41         for(i=1;i<=n;i++)
    42         {
    43             bin[i]=i;
    44             cnt[i]=0;
    45             rank[i]=1;
    46         }
    47         while(q--)
    48         {
    49             getchar();
    50             scanf("%c%d",&c,&a);
    51             if(c=='T')
    52             {
    53                 scanf("%d",&b);
    54                 merge(a,b);
    55             }
    56             else
    57             {
    58                 int temp=find(a);
    59                 printf("%d %d %d
    ",bin[temp],rank[temp],cnt[a]);
    60             }
    61         }
    62     }
    63     return 0;
    64 }
  • 相关阅读:
    统计学_筛选试验
    ROC、PR 曲线/准确率、覆盖率(召回)、命中率、Specificity(负例的覆盖率)、F1 score
    阳/阴性预测值Positive/negative Predictive Value(推荐AA)
    统计学_样本量估计_python代码实现
    统计学_效应量Effect Size
    统计学_二型错误和功效(Type II Errors and Test Power)
    统计学的P值解释和误区
    【线性代数的几何意义】向量的基本几何意义
    【线性代数的几何意义】什么是线性代数
    【Eclipse】如何在Eclipse中使用命令行?
  • 原文地址:https://www.cnblogs.com/homura/p/4694303.html
Copyright © 2011-2022 走看看