[BZOJ2002][LCT]HNOI2010:弹飞绵羊

BZOJ2002

LCT板题：
新建结点，如果被弹飞就把边连到这个点上
然后就是简单的模板了

Code：

#include<bits/stdc++.h>
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=2e5+5;
namespace LCT{
	int siz[N];
	int que[N];
	struct S{int ls,rs,fa,rev;}tr[N];
	#define ls(x) tr[x].ls
	#define rs(x) tr[x].rs
	#define fa(x) tr[x].fa
	#define rev(x) tr[x].rev
	inline int isrs(int x){return rs(fa(x))==x;}
	inline bool isroot(int x){
		if(!fa(x)) return true;
		return ls(fa(x))!=x && rs(fa(x))!=x;
	}
	inline void pushup(int x){
		siz[x]=1;
		if(ls(x)) siz[x]+=siz[ls(x)];
		if(rs(x)) siz[x]+=siz[rs(x)];		
	}
	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);
	}
	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)){
			if(!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);rs(x)=y;
			if(y) fa(y)=x;
			pushup(x);
		}
	}
	inline int findroot(int x){
		access(x);splay(x);
		while(pushdown(x),ls(x)) x=ls(x);
		splay(x);return x;
	}
	inline void makeroot(int x){access(x);splay(x);rev(x)^=1;}
	inline void link(int x,int y){makeroot(x);fa(x)=y;}
	inline void cut(int x,int y){makeroot(x);access(y);splay(y);ls(y)=fa(x)=0;pushup(y);}
	inline int ask(int x,int y){makeroot(x);access(y);splay(y);return siz[y]-1;}
}
using namespace LCT;
int n,m;
int a[N];
int main(){
	n=read();
	for(int i=1;i<=n+1;i++) siz[i]=1;
	for(int x,i=1;i<=n;i++){
		x=read();
		if(i+x<=n) link(i,i+x);
		else link(i,n+1);
		a[i]=x;
	}
	m=read();int op;
	while(m--){
		op=read();
		if(op==1){
			int x=read()+1;
			cout<<ask(x,n+1)<<"\n";
		}
		else{
			int x=read()+1,y=read();
			if(x+a[x]<=n) cut(x,x+a[x]);
			else cut(x,n+1);
			if(x+y<=n) link(x,x+y);
			else link(x,n+1);
			a[x]=y;
		}
	}
	return 0;
}