首页 > 代码库 > 【css基础】垂直外边距的合并

【css基础】垂直外边距的合并

2024-07-05 13:33:25   230人阅读

这个题目参考大神，链接如下：

http://www.cnblogs.com/kuangbin/archive/2012/08/30/2664419.html

还有种类并查集的详细解答,链接如下：

http://www.cnblogs.com/wuyiqi/archive/2011/08/24/come__in.html 

题目链接

题目如下:

Dragon Balls

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


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
 

Author
possessor WC
 

Source
2010 ACM-ICPC Multi-University Training Contest（19）——Host by HDU
 
这个题的思路是主要要数被移动的次数，而移动次数=自己移动的次数+父亲节点移动的次数。。。

而有多少颗龙珠直接相加就可以了 。。。

代码如下：

#include<cstdio>
const int maxn=10000+10;
int T,N,Q;
int root[maxn],count[maxn],move[maxn];
int findroot(int x)
{
    if(root[x]!=x)
    {
        int t=root[x];
        root[x]=findroot(root[x]);
        move[x]+=move[t];
    }
       return root[x];
}

void merge(int a,int b)
{
    int fx=findroot(a);
    int fy=findroot(b);
    if(fx!=fy)
    {
        root[fx]=fy;
        count[fy]+=count[fx];
        move[fx]=1;//这里表示父亲节点最多移动一次
    }
}

void FBI()
{
    for(int i=1;i<=N;i++)
    {
        root[i]=i;
        count[i]=1;
        move[i]=0;
    }
}

int main()
{
    char str[2];
    int a,b,cas;
    scanf("%d",&T);
    cas=0;
    while(scanf("%d%d",&N,&Q)!=EOF)
    {
       cas++;
       printf("Case %d:\n",cas);
       FBI();
       while(Q--)
       {
        scanf("%s",str);
        if(str[0]=='T')
        {
            scanf("%d%d",&a,&b);
            merge(a,b);
        }
        else
        {
            scanf("%d",&a);
            int t=findroot(a);
            printf("%d %d %d\n",t,count[t],move[a]);
        }
       }
    }
    return  0;
}



联系
我们