uva——11987——Almost Union-Find

I hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.

The data structure you need to write is also a collection of disjoint sets, supporting 3 operations:

1 p q

Union the sets containing p and q. If p and q are already in the same set, ignore this command.

2 p q

Move p to the set containing q. If p and q are already in the same set, ignore this command

3 p

Return the number of elements and the sum of elements in the set containing p.

Initially, the collection contains n sets: {1}, {2}, {3}, ..., {n}.

Input

There are several test cases. Each test case begins with a line containing two integers n and m (1<=n,m<=100,000), the number of integers, and the number of commands. Each of the next m lines contains a command. For every operation, 1<=p,q<=n. The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

Output

For each type-3 command, output 2 integers: the number of elements and the sum of elements.

Sample Input

5 7
1 1 2
2 3 4
1 3 5
3 4
2 4 1
3 4
3 3

Output for the Sample Input

3 12
3 7
2 8

Explanation

Initially: {1}, {2}, {3}, {4}, {5}

Collection after operation 1 1 2: {1,2}, {3}, {4}, {5}

Collection after operation 2 3 4: {1,2}, {3,4}, {5} (we omit the empty set that is produced when taking out 3 from {3})

Collection after operation 1 3 5: {1,2}, {3,4,5}

Collection after operation 2 4 1: {1,2,4}, {3,5}

题意：先输入两个数n，m，数是从1到n，接下来的m行，如果第一个数是1，就输入p，q，表示把p加到q上

如果第一个数是2，输入p，q，表示把p从集合拿出来，加到q里面

如果第一个数是3，输入p，输出p所在集合的个数和总和

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int M=200005;

int father[M],num[M],id[M];
long long sum[M];
int ans,n,m;
void inio()
{
	for(int i=1;i<=n;i++)
	{
		id[i]=father[i]=sum[i]=i;
		num[i]=1;
	}
	ans=n;
}
int find(int x)
{
	if(x!=father[x])
	{
		father[x]=find(father[x]);
	}
	return father[x];
}
void unio(int x,int y)
{
	int tx=find(id[x]);
	int ty=find(id[y]);
    father[tx]=ty;
    num[ty]+=num[tx];
    sum[ty]+=sum[tx];
}
void Delete(int x)
{
	int tx=find(id[x]);
	--num[tx];//把p从所在的集合拿出来
	sum[tx]-=x;//把总和减去p
	id[x]=++ans;//把p另外分配一个空间
	father[id[x]]=id[x];
	num[id[x]]=1;
	sum[id[x]]=x;
}
int main()
{
	while(cin>>n>>m)
	{
		inio();
		for(int i=1;i<=m;i++)
		{			
			int t;
			cin>>t;
			
			if(t==1)
			{
				int p,q;
				cin>>p>>q;
				if(find(id[p])!=find(id[q]))
				unio(p,q);
			}
			else if(t==2)
			{
				int p,q;
				cin>>p>>q;
				if(find(id[p])!=find(id[q]))
				{
   	               Delete(p);
				   unio(p,q);
				}	
			}
			else if(t==3)
	    	{
			   int x;
			   cin>>x;
			   cout<<num[find(id[x])]<<" "<<sum[find(id[x])]<<endl;
		    }
		}
	}
	return 0;
}