[BZOJ4568] 线性基+树上倍增

[BZOJ4568]

• 对于线性基倍增维护，合并时暴力合并
• 

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
using namespace std;
const int lim=60;
const int N=2e4+100;
struct node{int y,n;}e[N<<1];
int fa[N][30],deep[N],lin[N<<1],len=0,x,y,n,q;
ll a[N][21][61],ans[N],val[N];
void read(int x,int y)
{e[++len].y=y,e[len].n=lin[x],lin[x]=len;}
void insert(ll *a,ll v){
	per(i,lim,0)if((v>>i)&1){
		if(a[i])v^=a[i];
		else{
			per(j,i-1,0)if((v>>j)&1)v^=a[j];
			rep(j,i+1,lim)if((a[j]>>i)&1)a[j]^=v;
			a[i]=v;break;
		}
	}
}
void merge(ll *a,ll *b){rep(i,0,lim)if(b[i])insert(a,b[i]);}
void dfs(int x,int f){
	rep(i,1,20)if((1<<i)<=deep[x]){
		fa[x][i]=fa[fa[x][i-1]][i-1];
		memcpy(a[x][i],a[x][i-1],sizeof(a[x][i]));
		merge(a[x][i],a[fa[x][i-1]][i-1]);
	}
	for(int i=lin[x];i;i=e[i].n){
		int y=e[i].y;
		if(y==f)continue;
		deep[y]=deep[x]+1;
		insert(a[y][0],val[x]);
		fa[y][0]=x;
		dfs(y,x);
	}
}
void lca(int x,int y){
	if(deep[x]<deep[y])swap(x,y);
	insert(ans,val[x]),insert(ans,val[y]);
	per(i,20,0)if((1<<i)<=deep[x]-deep[y]){
		merge(ans,a[x][i]); x=fa[x][i];
	}
	if(x==y)return;
	per(i,20,0)if(fa[x][i]!=fa[y][i]){
		merge(ans,a[x][i]);
		merge(ans,a[y][i]);
		x=fa[x][i],y=fa[y][i];
	}
	merge(ans,a[x][0]);
}
int main()
{
	scanf("%d%d",&n,&q);
	rep(i,1,n)scanf("%lld",&val[i]);
	rep(i,2,n)scanf("%d%d",&x,&y),read(x,y),read(y,x);
	dfs(1,0);
	while(q--){
		memset(ans,0,sizeof(ans));
		scanf("%d%d",&x,&y);
		lca(x,y); ll sum=0;
		per(i,lim,0)sum=max(sum,sum^ans[i]);
		printf("%lld\n",sum);
	}
	return 0;
}