题目描述
题解
刚开始以为在树上先求出异或和了之后在线性基上搞一搞就行了,后来才知道这题牵扯到线性基的合并,YY了很久…
思路就是用倍增维护一段一段的线性基,然后求lca的过程中合并线性基就行了
这样的话时间复杂度是
O(nlog3n)
?似乎有点不科学
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define LL long long
#define N 20005
#define sz 15
struct hp{LL a[65];};
int n,q,x,y,r,cnt;
int tot,point[N],nxt[N*2],v[N*2],h[N],f[N][sz+3];
LL ans;
LL mi[N],g[N],val[N];
hp s[N][sz+3],now;
void add(int x,int y)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y;
}
hp merge(hp a,hp b)
{
for (int i=0;i<=59;++i)
{
if (!b.a[i]) continue;
for (int j=59;j>=0;--j)
if (b.a[i]&mi[j])
{
if (!a.a[j]) {a.a[j]=b.a[i];break;}
else b.a[i]^=a.a[j];
}
}
return a;
}
void build(int x,int fa)
{
h[x]=h[fa]+1;
for (int i=1;i<sz;++i)
{
f[x][i]=f[f[x][i-1]][i-1];
s[x][i]=merge(s[f[x][i-1]][i-1],s[x][i-1]);
}
for (int i=point[x];i;i=nxt[i])
if (v[i]!=fa)
{
f[v[i]][0]=x;
for (int j=59;j>=0;--j)
if (g[v[i]]&mi[j]) {s[v[i]][0].a[j]=g[v[i]];break;}
build(v[i],x);
}
}
int lca(int x,int y)
{
if (h[x]<h[y]) swap(x,y);
int k=h[x]-h[y];
for (int i=0;i<sz;++i)
if (k>>i&1)
now=merge(now,s[x][i]),x=f[x][i];
if (x==y) return x;
for (int i=sz-1;i>=0;--i)
if (f[x][i]!=f[y][i])
{
now=merge(now,s[x][i]);
now=merge(now,s[y][i]);
x=f[x][i],y=f[y][i];
}
now=merge(now,s[x][0]);
now=merge(now,s[y][0]);
return f[x][0];
}
int main()
{
mi[0]=1LL;for (int i=1;i<=59;++i) mi[i]=mi[i-1]*2LL;
scanf("%d%d",&n,&q);
for (int i=1;i<=n;++i) scanf("%lld",&g[i]);
for (int i=1;i<n;++i)
{
scanf("%d%d",&x,&y);
add(x,y);add(y,x);
}
for (int i=59;i>=0;--i)
if (g[1]&mi[i]) {s[1][0].a[i]=g[1];break;}
build(1,0);
while (q--)
{
scanf("%d%d",&x,&y);
if (x==y) {printf("%lld\n",g[x]);continue;}
memset(now.a,0,sizeof(now.a));r=lca(x,y);
now=merge(now,s[r][0]);
ans=0;
for (int i=59;i>=0;--i)
{
if (!now.a[i]) continue;
if (ans&mi[i]) continue;
ans^=now.a[i];
}
printf("%lld\n",ans);
}
}