【hdu3635】Dragon Balls —— 并查集

原创 2016年05月31日 18:27:40

题目:

Dragon Balls

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

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

描述:

x组用例,每组用例有n个城市和q组指令,初始时每个城市有一个龙珠,指令T A B表示把A城市中的龙珠转移到B城市中,C A表示一个查询,要输出原先在A城市的龙珠现在在的城市编号,该城市中现在的龙珠总数,以及原先在A城市的龙珠被转移了多少次。

题解:

对于查询的前两部分是并查集的裸题,对每一个节点记录他的龙珠数,初始化为1,合并时将子节点的数目加到父节点上再把子节点清零。而对于转移次数的记录,如果每次都在转移时遍历子节点分别次数加1显然会超时,所以这里借鉴了线段树的lazy思想,仅在根节点上time++,当通过子节点查询父节点时,在递归过程中将父节点记录的转移次数加在子节点上。

代码:

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 5;
int fa[maxn];
struct ball
{
    int index,times;
}b[maxn];
void init(int n)
{
    for(int i = 1;i <= n;i++)
    {
        fa[i] = i;
        b[i].times = 0;
        b[i].index = 1;
    }   
}

int find(int x)
{
    if(x == fa[x])return x;
    int temp = fa[x];
    fa[x] = find(fa[x]);
    b[x].times += b[temp].times;
    return fa[x];
}

void unite(int x,int y)
{
    int xx = find(x),yy = find(y);
    if(xx != yy)
    {
        fa[xx] = yy;
        b[xx].times++;
        b[yy].index += b[xx].index;
        b[xx].index = 0;
    } 

}

int main()
{
    //freopen("in.txt","r",stdin);
    int t;
    scanf("%d",&t);
    for(int i = 1;i <= t;i++)
    {
        printf("Case %d:\n",i);
        int n,q;
        scanf("%d%d",&n,&q);
        init(n);
        while(q--)
        {
            char op;
            getchar();
            scanf("%c",&op);
            if(op == 'T')
            {
                int a,b;
                scanf("%d%d",&a,&b);
                unite(a,b);
            }
            else
            {
                int a;
                scanf("%d",&a); 
                int temp = find(a);            
                printf("%d %d %d\n",temp,b[temp].index,b[a].times);
            }
        }
    }
}
版权声明:CopyRight © 2011 - 2017, CFhM_R, All Rights Reserved

(step5.1.4)hdu 3635(Dragon Balls——并查集)

题目大意:输入一个整数t,表示测试用例数.输入两个整数n,m,分别表示节点数和对接点的操作次数。在接下来的m行中,有两种命令 T a b 。表示将a节点所在的城市中的所有节点都移到b节点所在的城市中...

HDU 3635 Dragon Balls(并查集:路径压缩)

HDU3635Dragon Balls 这里有N个龙珠,每个龙珠初始时都在本身的城市(第i个龙珠在第i个城市),然后要你回答对应的询问。 输入:首先是一个T(0 T A B(1 Q A。你需要输出X,...

hdu 3635 Dragon Balls 带权并查集

点击打开链接题目链接 Dragon Balls Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

[HDU 3635]Dragon Balls[并查集][路径压缩]

题目链接:[HDU 3635]Dragon Balls[并查集][路径压缩] 题意分析: 'T‘操作,代表将A龙珠所在城市的所有龙珠转移到B龙珠所在的城市。 ’Q‘操作,查询A龙珠所在的城市,该...

Dragon Balls HDU杭电3635 【并查集,递归的方法找根节点】

Problem Description Five hundred years later, the number of dragon balls will increase unexpectedly,...

hdu 3635 Dragon Balls (并查集,路径压缩应用)

Dragon Balls Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) T...

hdu 3635 Dragon Balls(并查集)

题目是给出N座城市,(第i个城市有ith龙珠),Q个操作:T A B :表示把Ath球在的城市的所有球搬到Bth球在的城市. Q A表示查询Ath球所在城市的编号X,以及X城市的球数Y,还有A球移动的...
  • cqlf__
  • cqlf__
  • 2012年08月29日 17:14
  • 640

hdu 3635 Dragon Balls ( 并查集路径压缩)

# include # include using namespace std; int father[10010]; int cot[10010]; int num[10010]; int fi...
  • lp_opai
  • lp_opai
  • 2014年07月18日 21:58
  • 396

HDU3635 Dragon Balls(并查集)

题意: n个城市中有n个龙珠,一开始按顺序排列,但龙珠会转移,输入T A B 代表现在龙珠A所在城市中的所有龙珠都转移到龙珠B所在的城市中,Q A 代表查询龙珠A的所在城市和城市中有多少龙珠以及龙珠...

HDU 3635--Dragon Balls【并查集,有技巧】

Dragon Balls Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) T...
  • hpuhjh
  • hpuhjh
  • 2015年07月31日 23:09
  • 553
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【hdu3635】Dragon Balls —— 并查集
举报原因:
原因补充:

(最多只允许输入30个字)