zoukankan      html  css  js  c++  java
  • 航电3635-Dragon balls

    Dragon Balls

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 4952    Accepted Submission(s): 1865

    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>
    #define MAX 10010
    int per[MAX];
    int num[MAX];
    int move[MAX];
    int n;
    void init()
    {
        for(int i=1;i<=n;i++)
        {
            per[i]=-1;
            num[i]=1;
            move[i]=0;
        }
    }
    int find(int x)
    {
        if(per[x]==-1)return x;
        int t=per[x];
        per[x]=find(per[x]);
        move[x]+=move[t];
        return per[x];
    }
    void join(int a,int b)
    {
        int t1=find(a);
        int t2=find(b);
        if(t1!=t2)
        {
            per[t1]=t2;
            num[t2]+=num[t1];
            move[t1]=1;
        }
    }
    int main()
    {
        char c[5];
        int a,b,T,m;
        int mark=0;
        scanf("%d",&T);
        while(T--)
        {
            mark++;
            scanf("%d%d",&n,&m);
            init();
            printf("Case %d:
    ",mark);
            while(m--)
            {
                scanf("%s",&c);
                if(c[0]=='T')
                {
                    scanf("%d%d",&a,&b);
                    join(a,b);
                }
                else
                {
                    scanf("%d",&a);
                    int t=find(a);
                    printf("%d %d %d
    ",t,num[t],move[a]);
                }
            }
        }
        return 0;
    }


  • 相关阅读:
    51nod-1462: 树据结构
    51nod-1363: 最小公倍数之和
    jar包反编译
    js表格某列多行值相同进行行合并
    JS对象转URL参数
    json数组转字符串 前端与后端交互
    element-ui 表格数据根据某一列值相同进行行合并(包括序号列)并同列相同值进行合计
    ssh框架中联合查询所取结果不在单一实体,sql写法
    ajax异步获取数据后动态向构建表格并添加数据
    关于ajax中async: false的作用
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770993.html
Copyright © 2011-2022 走看看