[CF414E][平衡树][欧拉序]Mashmokh's Designed Problem

CF414E

dfs序上的深度是连续变化的
所以可以维护区间深度最大和最小的点
查询一个点最近的深度小于它的点就是fa
两个点之间深度最小的点就是lca
都可以用平衡树维护
对于第三个询问，直接找出最右边的深度为k的点即可

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,INF=1e9; 
namespace Splay{
	int ls[N],rs[N],fa[N];
	inline int isrs(int x){return rs[fa[x]]==x;}
	inline bool isroot(int x){
		if(!fa[x]) return 1;
		return ls[fa[x]]!=x && rs[fa[x]]!=x;
	}
	int s[N],si[N],mn[N],mx[N];
	inline void pushup(int x){
		s[x]=s[ls[x]]+s[rs[x]]+si[x];
		mx[x]=max(mx[ls[x]],s[ls[x]]+si[x]+max(mx[rs[x]],0));
		mn[x]=min(mn[ls[x]],s[ls[x]]+si[x]+min(mn[rs[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,int f){
		while(fa[x]!=f){
			if(fa[fa[x]]!=f){
				if(isrs(x)==isrs(fa[x])) rotate(fa[x]);
				else rotate(x);
			}
			rotate(x);
		}
	}
	int rt;
	int ff[N];
	inline int query(int x,int y){
		x=(x<<1)-1,y=(y<<1)-1;
		int xx,yy,lca;
		splay(x,0);xx=s[ls[x]]+si[x];
		splay(y,0);yy=s[ls[y]]+si[y];
		splay(x,0);splay(y,x);
		rt=x;
		lca=min(xx,yy);
		if(ls[x]==y) lca=min(lca,s[ls[y]]+si[y]+mn[rs[y]]);
		else lca=min(lca,s[ls[x]]+si[x]+mn[ls[y]]);
		return xx+yy-(lca<<1);
	}
	int find(int x,int rk){
		int k=rk-s[ls[x]]-si[x];
		if(mx[rs[x]]>=k && mn[rs[x]]<=k) return find(rs[x],k);
		if(s[ls[x]]+si[x]==rk) return (x&1)?((x+1)>>1):ff[x>>1];
		return find(ls[x],rk); 
	}
	inline int Pre(int x){splay(x,0);x=ls[x];while(rs[x]) x=rs[x];return x;}
	inline int Nxt(int x){splay(x,0);x=rs[x];while(ls[x]) x=ls[x];return x;}
}
using namespace Splay;
namespace Graph{
	int dfn[N],sign=0;
	int vis[N<<1],nxt[N<<1],head[N],tot=0;
	inline void add(int x,int y){vis[++tot]=y;nxt[tot]=head[x];head[x]=tot;}
	inline void dfs(int v){
		dfn[++sign]=(v<<1)-1;
		si[(v<<1)-1]=1;
		for(int i=head[v];i;i=nxt[i]){ff[vis[i]]=v;dfs(vis[i]);}
		dfn[++sign]=(v<<1);
		si[v<<1]=-1;
	}
	inline int build(int l,int r){
		int mid=l+r>>1;
		int &x=dfn[mid];
		if(l<mid) ls[x]=build(l,mid-1),fa[ls[x]]=x;
		if(mid<r) rs[x]=build(mid+1,r),fa[rs[x]]=x;
		pushup(x);return x;
	}
}
using namespace Graph;
inline void modify(int v,int nw){
	int x=(v<<1)-1,l,r,t;
	splay(x,0);
	ff[v]=find(ls[x],s[ls[x]]+si[x]-nw);
	l=Pre(x);r=Nxt(v<<1);
	splay(l,0);splay(r,l);
	t=ls[r];ls[r]=0;
	pushup(r);pushup(l);
	l=Pre(ff[v]<<1),r=(ff[v]<<1);
	splay(l,0);splay(r,l);
	ls[r]=t;fa[t]=r;
	pushup(r);pushup(l);
	rt=l; 
}
int tmp[N];
int main(){
	mx[0]=-INF,mn[0]=INF;
	int n=read(),m=read();
	for(int i=1;i<=n;i++){
		int num=read();
		for(int j=1;j<=num;j++) tmp[j]=read();
		for(int j=num;j;j--) add(i,tmp[j]);
	}
	dfs(1);rt=build(1,n<<1);
	while(m--){
		int op=read(),x=read();
		if(op==1){int y=read();cout<<query(x,y)<<"\n";}
		if(op==2){int y=read();modify(x,y);}
		if(op==3) cout<<find(rt,x+1)<<"\n";
	}
	return 0;
}