bzoj 3376 [Usaco2004 Open]Cube Stacking 方块游戏——带偏移量的并查集

题目：https://www.lydsy.com/JudgeOnline/problem.php?id=3376

带偏移量的并查集。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=3e4+,M=1e5+;
int n,m,x[M],y[M],fa[N],dis[N],siz[N];
char op[M];
int rdn()
{
  int ret=;bool fx=;char ch=getchar();
  while(ch>''||ch<''){if(ch=='-')fx=;ch=getchar();}
  while(ch>=''&&ch<='') ret=(ret<<)+(ret<<)+ch-'',ch=getchar();
  return fx?ret:-ret;
}
int g[];
void wrt(int x)
{
  if(x<)putchar('-'),x=-x;
  if(!x)putchar('');
  int t=;
  while(x)g[++t]=x%,x/=;
  while(t)putchar(g[t]+''),t--;
  puts("");
}
int find(int a)
{
  if(fa[a]==a)return a;
  int x=find(fa[a]);
  dis[a]+=dis[fa[a]]; return fa[a]=x;
}
int main()
{
  m=rdn();
  for(int i=;i<=m;i++)
    {
      op[i]=getchar();
      while(op[i]!='C'&&op[i]!='M')op[i]=getchar();
      x[i]=rdn(); n=max(n,x[i]);
      if(op[i]=='M')y[i]=rdn(),n=max(n,y[i]);
    }
  for(int i=;i<=n;i++)fa[i]=i,siz[i]=;
  for(int i=;i<=m;i++)
    {
      if(op[i]=='M')
    {
      int u=find(x[i]),v=find(y[i]);
      dis[v]=siz[u]; fa[v]=u; siz[u]+=siz[v];
    }
      else
    {
      int d=find(x[i]); wrt(siz[d]--dis[x[i]]);
    }
    }
  return ;
}