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}
Rujia Liu's Present 3: A Data Structure Contest Celebrating the 100th Anniversary of Tsinghua University
Special Thanks: Yiming Li
Note: Please make sure to test your program with the gift I/O files before submitting!
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;
/** Constant List .. **/ //{
const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;
char str[3];
const int maxn = 100001;
int f[maxn];
long long sum[maxn];
int cnt[maxn];
int id[maxn];
int deep;
int n;
void init(int n)
{
for(int i = 0 ; i <= n ; i ++)
{
f[i] = i;
sum[i] = i;
id[i] = i;
cnt[i] = 1;
}
deep = n;
}
int find(int x)
{
return x == f[x] ? x : (f[x] = find(f[x]));
}
void change(int x)
{
int ans = find(id[x]);
sum[ans] -= x;
cnt[ans] --;
id[x] = ++deep;
sum[id[x]] = x;
cnt[id[x]] = 1;
f[id[x]] = id[x];
}
void unin(int a , int b)
{
int x = find(a);
int y = find(b);
f[x] = y;
sum[y] += sum[x];
cnt[y] += cnt[x];
}
int main()
{
#ifdef DoubleQ
freopen("in.txt","r",stdin);
#endif
int m;
int a , b;
while(~scanf("%d%d",&n,&m))
{
init(n);
int key;
for(int i = 0 ; i < m ; i++)
{
scanf("%d",&key);
if(key == 1)
{
scanf("%d%d",&a,&b);
if(find(id[a]) != find(id[b]))
unin(id[a] , id[b]);
}
else if(key == 2)
{
scanf("%d%d",&a,&b);
if(find(id[a]) != find(id[b]))
{
change(a);
unin(id[a] , id[b]);
}
}
else if(key == 3)
{
scanf("%d",&a);
int t = find(id[a]);
printf("%d %lld\n",cnt[t] , sum[t]);
}
}
}
}