HDU-2818-Building Block

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2818

Building Block


Problem Description
John are playing with blocks. There are N blocks (1 <= N <= 30000) numbered 1...N。Initially, there are N piles, and each pile contains one block. Then John do some operations P times (1 <= P <= 1000000). There are two kinds of operation:

M X Y : Put the whole pile containing block X up to the pile containing Y. If X and Y are in the same pile, just ignore this command. 
C X : Count the number of blocks under block X 

You are request to find out the output for each C operation.
 

Input
The first line contains integer P. Then P lines follow, each of which contain an operation describe above.
 

Output
Output the count for each C operations in one line.
 

Sample Input
  
  
6 M 1 6 C 1 M 2 4 M 2 6 C 3 C 4
 

Sample Output
  
  
1 0 2
 

题目分析:带权并查集  
n块砖头,分为n堆,有两种操作M:把x堆放在y堆上面,C:求x堆的下面有多少个砖头。在普通并查集的基础上加上两个数组up[x]和down[x],分别表示x所在堆的大小以及x下面的元素。当移动时,首先确定x所在的那一堆最底部的X以及y所在那一堆最底部的Y,那么down[X]的数目就是另外一堆的up[Y],可以根据find(x)递归去一边寻找根一边更新其他未知的down[x],。

代码如下:

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio> 
using namespace std;
int city,road;
int pre[33333];
int up[33333],down[33333];
int find(int r)
{
    if(pre[r]==r)
    return r;
    else
    {
        int t=find(pre[r]);
        down[r]=down[r]+down[pre[r]];
        pre[r]=t; 
        return pre[r];
    }
}
void merge(int x,int y)
{
    int t1=find(x);
    int t2=find(y);
    if(t1!=t2)
    {
        pre[t1]=t2;
        down[t1]=up[t2];
        up[t2]+=up[t1];
    }
}
int main(){
	int n;
	while(cin>>n)
	{
		int i;
        char str[11];
        int x,y;
        for(i=0;i<=30010;i++)//否则会超时 
        {
        	pre[i]=i;
        	up[i]=1;//以上的部分包括自己 
            down[i]=0;//下面的数量 
		}
		for(i=1;i<=n;i++)
		{
			cin>>str;
			if(str[0]=='M')
			{
				scanf("%d%d",&x,&y);
				merge(x,y);
			}
			else
			{
				scanf("%d",&x);
				find(x);
				cout<<down[x]<<endl;
			}
		}
	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值