Cube Stacking
题意:每次第 x 堆可以放在 第 y 堆上 ,多次询问,x下有多少石头
思路:sum[x]表示以x为根连通块大小,ans[x]为x下有多少石头
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=2e18+100;
const int maxn=2e5+100;
int pre[maxn],sum[maxn],ans[maxn];
int find(int x)
{
if(x!=pre[x])
{
int root=find(pre[x]);
ans[x]+=ans[pre[x]];
pre[x]=root;
}
return pre[x];
}
signed main()
{
for(int i=0;i<maxn;i++){pre[i]=i;sum[i]=1;}
int q;
cin>>q;
while(q--)
{
char op;
int x,y;
cin>>op;
if(op=='M')
{
cin>>x>>y;
int fx=find(x);
int fy=find(y);
pre[fx]=fy;
ans[fx]+=sum[fy];
sum[fy]+=sum[fx];
}
else
{
cin>>x;
find(x);
cout<<ans[x]<<"\n";
}
}
}