lctlinkcuttree动态树模版题合集.pdfVIP

LCT link-cut-tree 动态树模版题合集 ——by yusitong Bzoj 2049 加边、删边、查询所在联通块 /************************************************************** Problem: 2049 User: yusitong Language: C++ Result: Accepted Time:2036 ms Memory:988 kb ****************************************************************/ #includecstdio #includecstring #includealgorithm using namespace std; const int INF=0x7fffffff; const int N = 11000; int n,m; int fa[N],ch[N][2]; bool rev[N]; int sta[N],top; bool isroot(int x){ return ch[fa[x]][0]!=xch[fa[x]][1]!=x; } void down(int x){ if(!rev[x])return; rev[ch[x][0]]^=1; rev[ch[x][1]]^=1; swap(ch[x][0],ch[x][1]); rev[x]=0; } void rotate(int x,int f){ int y=fa[x]; if(!isroot(y))ch[fa[y]][ch[fa[y]][1]==y]=x; fa[x]=fa[y]; if(ch[x][f])fa[ch[x][f]]=y; ch[y][!f]=ch[x][f]; fa[y]=x; ch[x][f]=y; } void splay(int x){ sta[++top]=x; for(int i=x;!isroot(i);i=fa[i])sta[++top]=fa[i]; while(top)down(sta[top--]); while(!isroot(x)){ if(!isroot(fa[x])){ if((ch[fa[x]][1]==x)^(ch[fa[fa[x]]][1]==fa[x])) rotate(x,ch[fa[x]][0]==x); else rotate(fa[x],ch[fa[fa[x]]][0]==fa[x]); } rotate(x,ch[fa[x]][0]==x); } } void access(int x){ int t=0; while(x){ splay(x); ch[x][1]=t; t=x; x=fa[x]; } } void makeroot(int x){ access(x); splay(x); rev[x]^=1; } void link(int x,int y){ makeroot(x); fa[x]=y; splay(x); } void cut(int x,int y){ makeroot(x); access(y); splay(y); fa[x]=0; ch[y][0]=0; } int find(int x){ access(x); splay(x); while(ch[x][0])x=ch[x][0]; return x; } int main(){ scanf(%d%d,n,m);