[luogu4219][LCT]BJOI2014：大融合

luogu4219

简单的LCT，连边直接连，维护siz，查询就把两个端点的siz乘起来

（luogu数据水了，BZOJ比较强，我被卡常了，准备看一下zxy推荐的小常数LCT改一下）

Code：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=1e5+5;
namespace LCT{
	int ls[N],rs[N],rev[N],fa[N],siz[N],ss[N];
	inline int isrs(int x){return rs[fa[x]]==x;}
	inline bool isroot(int x){
		if(!x) return true;
		return ls[fa[x]]!=x && rs[fa[x]]!=x;
	}
	inline void pushup(int x){siz[x]=siz[ls[x]]+siz[rs[x]]+ss[x]+1;}
	inline void pushdown(int x){
		if(rev[x]){
			swap(ls[x],rs[x]);
			if(ls[x]) rev[ls[x]]^=1;
			if(rs[x]) rev[rs[x]]^=1;
			rev[x]=0;
		}
	}
	inline void rotate(int x){
		int y=fa[x],z=fa[y],b=(ls[y]==x?rs[x]:ls[x]);
		if(z && !isroot(y)) (ls[z]==y?ls[z]:rs[z])=x;
		fa[x]=z,fa[y]=x,b?fa[b]=y:0;
		if(ls[y]==x) rs[x]=y,ls[y]=b;
		else ls[x]=y,rs[y]=b;
		pushup(y);pushup(x);
	}
	int que[N];
	inline void splay(int x){
		que[que[0]=1]=x;
		for(int y=x;!isroot(y);y=fa[y]) que[++que[0]]=fa[y];
		for(int i=que[0];i;i--) pushdown(que[i]);
		while(!isroot(x)){
			while(!isroot(fa[x])){
				if(isrs(x)==isrs(fa[x])) rotate(fa[x]);
				else rotate(x);
			}
			rotate(x);
		}
		pushup(x);
	}
	inline void access(int x){
		for(int y=0;x;y=x,x=fa[x]){
			splay(x);
			ss[x]+=siz[rs[x]];
			ss[x]-=siz[rs[x]=y];
			pushup(x);
		}
	}
	inline void makeroot(int x){access(x);splay(x);rev[x]^=1;}
	inline void split(int x,int y){makeroot(x);access(y);splay(y);}
	inline void link(int x,int y){split(x,y);ss[fa[x]=y]+=siz[x];pushup(y);}
}
using namespace LCT;
char op;
ll ans=0;
int main(){
	int n=read(),m=read();
	for(int i=1;i<=n;i++) siz[i]=1;
	while(m--){
		cin>>op;int x=read(),y=read();
		if(op=='A') link(x,y);
		else{
			split(x,y);
			cout<<1ll*(ss[x]+1)*(ss[y]+1)<<"\n";
		}
	}
	return 0;
}