BZOJ3779重组病毒弱化版
注意到染色相当于在LCT上access这个点,一个点到根路径上颜色段数就是LCT上虚边的个数
在access的时候同时在线段树上维护一下子树加减即可
2操作就算出来两个点到根的答案,再减去LCA到根的答案*2,交界的地方特殊算算
第三问就之间线段树询问区间最值就行
#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 100010
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 1000000000
struct vec{
int to;
int fro;
};
vec mp[MAXN*2];
int tai[MAXN],cnt;
int n,m;
int fa[MAXN],son[MAXN][2];
int lx[MAXN];
int FA[MAXN],SON[MAXN],siz[MAXN],dep[MAXN],tp[MAXN],dfn[MAXN],ndf[MAXN],tim;
int v[MAXN<<2],ch[MAXN<<2];
inline void be(int x,int y){
mp[++cnt].to=y;
mp[cnt].fro=tai[x];
tai[x]=cnt;
}
inline void bde(int x,int y){
be(x,y);
be(y,x);
}
void dfs1(int x){
int i,y;
dep[x]=dep[fa[x]]+1;
siz[x]=1;
for(i=tai[x];i;i=mp[i].fro){
y=mp[i].to;
if(!siz[y]){
fa[y]=FA[y]=x;
dfs1(y);
siz[x]+=siz[y];
if(siz[y]>siz[SON[x]]){
SON[x]=y;
}
}
}
}
void dfs2(int x,int z){
int i,y;
tp[x]=z;
ndf[dfn[x]=++tim]=x;
if(SON[x]){
dfs2(SON[x],z);
for(i=tai[x];i;i=mp[i].fro){
y=mp[i].to;
if(!dfn[y]){
dfs2(y,y);
}
}
}
}
int lca(int x,int y){
while(tp[x]!=tp[y]){
if(dep[tp[x]]<dep[tp[y]]){
swap(x,y);
}
x=FA[tp[x]];
}
return dep[x]<dep[y]?x:y;
}
inline void toch(int x,int y){
v[x]+=y;
ch[x]+=y;
}
inline void UD(int x){
v[x]=max(v[x<<1],v[x<<1|1]);
}
inline void PD(int x){
if(ch[x]){
toch(x<<1,ch[x]);
toch(x<<1|1,ch[x]);
ch[x]=0;
}
}
void build(int x,int y,int z){
if(y==z){
v[x]=dep[ndf[y]];
return ;
}
int mid=y+z>>1;
build(x<<1,y,mid);
build(x<<1|1,mid+1,z);
UD(x);
}
int ask(int x,int y,int z,int l,int r){
if(y==l&&z==r){
return v[x];
}
PD(x);
int mid=y+z>>1;
if(r<=mid){
return ask(x<<1,y,mid,l,r);
}else if(l>mid){
return ask(x<<1|1,mid+1,z,l,r);
}else{
return max(ask(x<<1,y,mid,l,mid),ask(x<<1|1,mid+1,z,mid+1,r));
}
}
void change(int x,int y,int z,int l,int r,int cv){
if(y==l&&z==r){
toch(x,cv);
return ;
}
PD(x);
int mid=y+z>>1;
if(r<=mid){
change(x<<1,y,mid,l,r,cv);
}else if(l>mid){
change(x<<1|1,mid+1,z,l,r,cv);
}else{
change(x<<1,y,mid,l,mid,cv);
change(x<<1|1,mid+1,z,mid+1,r,cv);
}
UD(x);
}
inline bool ir(int x){
return son[fa[x]][0]!=x&&son[fa[x]][1]!=x;
}
inline void ud(int x){
lx[x]=x;
if(son[x][0]){
lx[x]=lx[son[x][0]];
}
}
inline void cot(int x,int y,bool z){
if(x){
fa[x]=y;
}
if(y){
son[y][z]=x;
}
}
inline void rot(int x,bool z){
int xx=fa[x],xxx=fa[xx];
cot(son[x][z],xx,z^1);
if(ir(xx)){
fa[x]=xxx;
}else{
cot(x,xxx,son[xxx][1]==xx);
}
cot(xx,x,z);
ud(xx);
}
void splay(int x){
while(!ir(x)){
int xx=fa[x],xxx=fa[xx];
if(ir(xx)){
rot(x,son[xx][0]==x);
}else{
bool z=son[xxx][0]==xx;
if(son[xx][z]==x){
rot(x,z^1);
rot(x,z);
}else{
rot(xx,z);
rot(x,z);
}
}
}
ud(x);
}
void acs(int x){
int t=0;
while(x){
splay(x);
if(son[x][1]){
int y=lx[son[x][1]];
change(1,1,n,dfn[y],dfn[y]+siz[y]-1,1);
}
son[x][1]=t;
if(son[x][1]){
int y=lx[son[x][1]];
change(1,1,n,dfn[y],dfn[y]+siz[y]-1,-1);
}
ud(x);
t=x;
x=fa[x];
}
}
int col(int x){
splay(x);
return lx[x];
}
int main(){
int i,o,x,y;
scanf("%d%d",&n,&m);
for(i=1;i<n;i++){
scanf("%d%d",&x,&y);
bde(x,y);
}
dfs1(1);
dfs2(1,1);
build(1,1,n);
while(m--){
scanf("%d",&o);
if(o==1){
scanf("%d",&x);
acs(x);
}
if(o==2){
scanf("%d%d",&x,&y);
int z=lca(x,y);
int zz=FA[z];
int vx=ask(1,1,n,dfn[x],dfn[x]),vy=ask(1,1,n,dfn[y],dfn[y]),vzz=0;
if(zz){
vzz=ask(1,1,n,dfn[zz],dfn[zz]);
if(col(z)==col(zz)){
vzz--;
}
}
printf("%d\n",vx+vy-vzz*2-1);
}
if(o==3){
scanf("%d",&x);
printf("%d\n",ask(1,1,n,dfn[x],dfn[x]+siz[x]-1));
}
}
return 0;
}
/*
10 9
1 2
2 3
3 4
4 5
5 6
3 7
3 8
5 9
5 10
1 5
1 6
1 3
1 10
1 2
1 4
3 3
3 10
3 6
*/