bzoj5338 [TJOI2018]xor 可持久化trie+树链剖分

Description

---

现在有一颗以1为根节点的由n个节点组成的树，树上每个节点上都有一个权值vi。
现在有Q 次操作，操作如下:
1 x y 查询节点x的子树中与y异或结果的最大值
2 x y z 查询路径x到y上点与z异或结果最大值

Solution

---

无聊题，第一问的话dfs序建可持久化trie就行了，第二问可以树上建可持久化trie也可以树链剖分，1e5随便写嘛

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (register int i=st;i<=ed;++i)
#define drp(i,st,ed) for (register int i=st;i>=ed;--i)
#define copy(x,t) memcpy(x,t,sizeof(x))

const int N=100005;
const int E=5000005;

struct edge {int y,next;} e[N*2];

int bl[N],dep[N],size[N],pos[N],fa[N];
int rt[N],rec[E][2],siz[E],w[N];
int ls[N],edCnt,tot;

int read() {
	int x=0,v=1; char ch=getchar();
	for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
	for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
	return x*v;
}

void add_edge(int x,int y) {
	e[++edCnt]=(edge) {y,ls[x]}; ls[x]=edCnt;
	e[++edCnt]=(edge) {x,ls[y]}; ls[y]=edCnt;
}

void ins(int pre,int &now,int v) {
	int x=now=++tot,y=pre;
	drp(i,29,0) {
		copy(rec[x],rec[y]);
		int tar=(v>>i)&1;
		rec[x][tar]=++tot;
		x=rec[x][tar],y=rec[y][tar];
		siz[x]=siz[y]+1;
	}
}

int ask(int pre,int now,int v) {
	int x=now,y=pre,res=0;
	drp(i,29,0) {
		int tar=(v>>i)&1;
		if (siz[rec[x][!tar]]-siz[rec[y][!tar]]>0) {
			tar=!tar; res+=(1<<i);
		}
		x=rec[x][tar],y=rec[y][tar];
	}
	return res;
}

void dfs1(int x) {
	size[x]=1;
	for (int i=ls[x];i;i=e[i].next) {
		if (e[i].y==fa[x]) continue;
		fa[e[i].y]=x; dep[e[i].y]=dep[x]+1;
		dfs1(e[i].y); size[x]+=size[e[i].y];
	}
}

void dfs2(int x,int up) {
	bl[x]=up; pos[x]=++pos[0]; int mx=0;
	ins(rt[pos[x]-1],rt[pos[x]],w[x]);
	for (int i=ls[x];i;i=e[i].next) {
		if (e[i].y!=fa[x]&&size[e[i].y]>size[mx]) mx=e[i].y;
	}
	if (!mx) return ;
	dfs2(mx,up);
	for (int i=ls[x];i;i=e[i].next) {
		if (e[i].y!=fa[x]&&e[i].y!=mx) dfs2(e[i].y,e[i].y);
	}
}

void solve(int x,int y,int z) {
	int res=0;
	for (;bl[x]!=bl[y];x=fa[bl[x]]) {
		if (dep[bl[x]]<dep[bl[y]]) std:: swap(x,y);
		res=std:: max(res,ask(rt[pos[bl[x]]-1],rt[pos[x]],z));
	}
	if (pos[x]>pos[y]) std:: swap(x,y);
	res=std:: max(res,ask(rt[pos[x]-1],rt[pos[y]],z));
	printf("%d\n", res);
}

int main(void) {
	freopen("data.in","r",stdin);
	int n=read(),m=read();
	rep(i,1,n) w[i]=read();
	rep(i,2,n) add_edge(read(),read());
	dfs1(dep[1]=1); dfs2(1,1);
	for (int opt,x,y;m--;) {
		opt=read(),x=read(),y=read();
		if (opt==1) printf("%d\n", ask(rt[pos[x]-1],rt[pos[x]+size[x]-1],y));
		else solve(x,y,read());
	}
	return 0;
}