题意:
给一颗树,每个点有权值a[i],(u,v)合法仅当a[u]^a[v]=a[lca(u,v],这样的点对对答案的贡献为u^v,求最后的答案((u,v)和(v,u)视作相同点对
题解:
参考:https://blog.csdn.net/qq_45458915/article/details/109583484
dsu on tree
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+5;
int head[maxn],to[maxn<<1],nxt[maxn<<1],cnt;
int biv[(1<<20)+100][25][2];
int son[maxn],size[maxn],a[maxn],visit[maxn];
vector<int>tmp;
ll ans;
void add(int x,int y){
nxt[++cnt]=head[x]; head[x]=cnt; to[cnt]=y;
}
void dfs_son(int x,int f){
int y;
size[x]=1;
son[x]=-1;
for(int i=head[x];i;i=nxt[i]){
y=to[i];
if(y==f)continue;
dfs_son(y,x);
size[x]+=size[y];
if(son[x]==-1||size[y]>size[son[x]])son[x]=y;
}
}
void update(int x,int val){
for(int i=0;i<20;i++){
biv[a[x]][i][(x>>i)&1]+=val;
}
}
ll search(int x,int k){
if(k>(1<<20)+100||k==0)return 0;
ll tmpans=0;
for(int i=0;i<20;i++){
tmpans+=biv[k][i][!((x>>i)&1)]*(1<<i);
}
return tmpans;
}
void cal(int x,int f,int lca)
{
int y;
tmp.push_back(x);
ans+=search(x,a[lca]^a[x]);
for(int i=head[x];i;i=nxt[i]){
y=to[i];
if(y==f)continue;
cal(y,x,lca);
}
}
void del(int x,int f)
{
int y;
update(x,-1);
for(int i=head[x];i;i=nxt[i]){
y=to[i];
if(y==f)continue;
del(y,x);
}
}
void dfs(int x,int fa,int keep)
{
int y;
for(int i=head[x];i;i=nxt[i]){
y=to[i];
if(y==fa||y==son[x])continue;
dfs(y,x,0);
}
if(son[x]!=-1){
dfs(son[x],x,1);
}
update(x,1);
for(int i=head[x];i;i=nxt[i]){
y=to[i];
if(y==fa||son[x]==y)continue;
cal(y,x,x);
for(auto it:tmp){
update(it,1);
}
tmp.clear();
}
if(!keep){
del(x,fa);
}
}
int main()
{
int n,x,y;
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<n;i++){
scanf("%d%d",&x,&y);
add(x,y); add(y,x);
}
dfs_son(1,0);
dfs(1,0,1);
printf("%lld\n",ans);
return 0;
}