fzyzojP3372 -- [校内训练20171124]博弈问题

#include<bits/stdc++.h>
#define il inline
#define reg register int
#define numb (ch^‘0‘)
using namespace std;
typedef long long ll;
il void rd(int &x){
    char ch;bool fl=false;
    while(!isdigit(ch=getchar()))(ch==‘-‘)&&(fl=true);
    for(x=numb;isdigit(ch=getchar());x=x*10+numb);
    (fl==true)&&(x=-x);
}
namespace Miracle{
const int N=100000+5;
const int U=17;//sudhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
int a[N];
struct node{
    int nxt,to;
}e[2*N];
int hd[N],cnt;
int n;
void add(int x,int y){
    e[++cnt].nxt=hd[x];
    e[cnt].to=y;
    hd[x]=cnt;
}
struct tr{
    int ls,rs;
    int sz,dp;
    int val;
}t[N*40];
int tot;
int calc(int x,int d,int s){
    int ret=0;
    int now=x;
    for(reg i=d+1;i<=U;++i){
        int c=(s>>(U-i))&1;
        if(c==1){
            if(t[now].ls) now=t[now].ls;
            else now=t[now].rs,ret+=(1<<(U-i));
        }else{
            if(t[now].rs) now=t[now].rs;
            else now=t[now].ls,ret+=(1<<(U-i));
        }
    }
    return ret;
}
void pushup(int x,int d){
    t[x].sz=t[t[x].ls].sz+t[t[x].rs].sz;
    if(t[x].sz==1) t[x].val=t[t[x].ls].val+t[t[x].rs].val;
    if(t[x].sz==1){
        t[x].dp=-1;
    }
    if(!t[t[x].ls].sz){
        t[x].dp=t[t[x].rs].dp;
    }else if(!t[t[x].rs].sz){
        t[x].dp=t[t[x].ls].dp;
    }else{
        if(t[t[x].ls].sz==1){
            t[x].dp=calc(t[x].rs,d+1,t[t[x].ls].val)+(1<<(U-d-1));
        }else if(t[t[x].rs].sz==1){
            t[x].dp=calc(t[x].ls,d+1,t[t[x].rs].val)+(1<<(U-d-1));
        }else{
            t[x].dp=max(t[t[x].ls].dp,t[t[x].rs].dp);
        }
    }
}
void upda(int &x,int d,int v){
    if(!x) x=++tot;
    //cout<<" xx "<<x<<" d "<<d<<" v "<<v<<endl;
    if(d==U){
        ++t[x].sz;
        t[x].val=v;
        if(t[x].sz==1){
            t[x].dp=-1;
        }else t[x].dp=0;
        return;
    }
    if(v&(1<<(U-d-1)))// cout<<"is 1",
    upda(t[x].ls,d+1,v);
    else //cout<<"is 0 ",
    upda(t[x].rs,d+1,v);
    pushup(x,d);
}
int merge(int x,int y,int d){
    if(!x||!y) return x+y;
    if(d==U){
        t[x].sz+=t[y].sz;
        t[x].dp=0;
        return x;
    }
    t[x].ls=merge(t[x].ls,t[y].ls,d+1);
    t[x].rs=merge(t[x].rs,t[y].rs,d+1);
    pushup(x,d);
    return x;
}
int rt[N];
int ans[N];
void dfs(int x,int fa){
    for(reg i=hd[x];i;i=e[i].nxt){
        int y=e[i].to;
        if(y==fa) continue;
        dfs(y,x);
        rt[x]=merge(rt[x],rt[y],0);
    }
    //cout<<" x "<<x<<" "<<rt[x]<<" : "<<t[rt[x]].dp<<" "<<t[rt[x]].sz<<endl;
    upda(rt[x],0,a[x]);
    ans[x]=t[rt[x]].dp;
}
int main(){
    rd(n);
    for(reg i=1;i<=n;++i)rd(a[i]);
    int x,y;
    for(reg i=1;i<n;++i){
        rd(x);rd(y);
        add(x,y);add(y,x);
    }
    dfs(1,0);
    for(reg i=1;i<=n;++i){
        printf("%d\n",ans[i]);
    }
    return 0;
}

}
signed main(){
    freopen("3372.in","r",stdin);
    freopen("3372.out","w",stdout);
    Miracle::main();
    return 0;
}

/*
   Author: *Miracle*
   Date: 2019/2/3 17:19:49
*/