hdu5571 tree

很显然用到动态点分治，但是异或比较难处理。逐位考虑，这个问题就相当于询问两种不同颜色的结点彼此之间的距离和。在每个分支结构中维护两种颜色的节点的个数和它们到上层分治结构的距离和，以及它的下一层的这些东西的和。不难维护。
好像hdu也可以用lld？

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=200010;
#define LL long long
int fir[maxn],ne[maxn],to[maxn],w[maxn],a[maxn],
size[maxn],fa[maxn],vis[maxn],val[maxn],
n1[maxn][20],n2[maxn][20],n3[maxn][20],n4[maxn][20],
mn[maxn][25],pos[maxn],dep[maxn],lg[maxn],
n,clo;
LL s1[maxn][20],s2[maxn][20],s3[maxn][20],s4[maxn][20],ans;
void add(int num,int u,int v,int x)
{
    ne[num]=fir[u];
    fir[u]=num;
    to[num]=v;
    w[num]=x;
}
void dfs0(int u,int fa)
{
    pos[u]=++clo;
    mn[clo][0]=dep[u];
    for (int i=fir[u];i;i=ne[i])
        if (to[i]!=fa)
        {
            dep[to[i]]=dep[u]+w[i];
            dfs0(to[i],u);
            mn[++clo][0]=dep[u];
        }
}
int dis(int u,int v)
{
    int x=pos[u],y=pos[v],k;
    if (x>y) swap(x,y);
    k=lg[y-x+1];
    return dep[u]+dep[v]-2*min(mn[x][k],mn[y-(1<<k)+1][k]);
}
int dfs2(int u,int fa,int S)
{
    size[u]=1;
    val[u]=0;
    int v,ret=-1;
    for (int i=fir[u];i;i=ne[i])
        if (!vis[to[i]]&&to[i]!=fa)
        {
            v=dfs2(to[i],u,S);
            val[u]=max(val[u],size[to[i]]);
            size[u]+=size[to[i]];
            if (ret==-1||val[v]<val[ret]) ret=v;
        }
    val[u]=max(val[u],S-size[u]);
    if (ret==-1||val[u]<val[ret]) ret=u;
    return ret;
}
void dfs3(int u,int fa)
{
    size[u]=1;
    for (int i=fir[u];i;i=ne[i])
        if (to[i]!=fa&&!vis[to[i]])
        {
            dfs3(to[i],u);
            size[u]+=size[to[i]];
        }
}
void dfs4(int u,int fa,int l,int v)
{
    for (int j=0;j<14;j++)
        if (a[u]&(1<<j))
        {
            s1[v][j]+=l;
            n1[v][j]++;
        }
        else
        {
            s2[v][j]+=l;
            n2[v][j]++;
        }
    for (int i=fir[u];i;i=ne[i])
        if (!vis[to[i]]&&to[i]!=fa)
            dfs4(to[i],u,l+w[i],v);
}
int dfs1(int u,int S)
{
    int rt=dfs2(u,-1,S),v;
    vis[rt]=1;
    dfs3(rt,-1);
    for (int j=0;j<14;j++)
        if (a[rt]&(1<<j)) n3[rt][j]++;
        else n4[rt][j]++;
    for (int i=fir[rt];i;i=ne[i])
        if (!vis[to[i]])
        {
            v=dfs1(to[i],size[to[i]]);
            fa[v]=rt;
            dfs4(to[i],-1,w[i],v);
            for (int j=0;j<14;j++)
            {
                ans+=(s3[rt][j]*n2[v][j]+s4[rt][j]*n1[v][j]+s1[v][j]*n4[rt][j]+s2[v][j]*n3[rt][j])<<j;
                s3[rt][j]+=s1[v][j];
                s4[rt][j]+=s2[v][j];
                n3[rt][j]+=n1[v][j];
                n4[rt][j]+=n2[v][j];
            }
        }
    vis[rt]=0;
    return rt;
}
void modify(int u,int x)
{
    LL y;
    for (int j=0;j<14;j++)
        if ((a[u]&(1<<j))!=(x&(1<<j)))
        {
            if (a[u]&(1<<j))
            {
                n3[u][j]--;
                n4[u][j]++;
                ans+=(s3[u][j]-s4[u][j])<<j;
                for (int i=u;fa[i];i=fa[i])
                {
                    y=dis(u,fa[i]);
                    ans-=(y*(n4[fa[i]][j]-n2[i][j])+s4[fa[i]][j]-s2[i][j])<<j;
                    n1[i][j]--;
                    n3[fa[i]][j]--;
                    s1[i][j]-=y;
                    s3[fa[i]][j]-=y;
                    ans+=(y*(n3[fa[i]][j]-n1[i][j])+s3[fa[i]][j]-s1[i][j])<<j;
                    n2[i][j]++;
                    n4[fa[i]][j]++;
                    s2[i][j]+=y;
                    s4[fa[i]][j]+=y;
                }
            }
            else
            {
                n4[u][j]--;
                n3[u][j]++;
                ans+=(s4[u][j]-s3[u][j])<<j;
                for (int i=u;fa[i];i=fa[i])
                {
                    y=dis(u,fa[i]);
                    ans-=(y*(n3[fa[i]][j]-n1[i][j])+s3[fa[i]][j]-s1[i][j])<<j;
                    n2[i][j]--;
                    n4[fa[i]][j]--;
                    s2[i][j]-=y;
                    s4[fa[i]][j]-=y;
                    ans+=(y*(n4[fa[i]][j]-n2[i][j])+s4[fa[i]][j]-s2[i][j])<<j;
                    n1[i][j]++;
                    n3[fa[i]][j]++;
                    s1[i][j]+=y;
                    s3[fa[i]][j]+=y;
                }
            }
        }
    a[u]=x;
}
void solve()
{
    int u,v,x,q;
    for (int i=1;i<=n;i++) fir[i]=fa[i]=0;
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    for (int i=1;i<n;i++)
    {
        scanf("%d%d%d",&u,&v,&x);
        add(i*2,u,v,x);
        add(i*2+1,v,u,x);
    }
    ans=0;
    dfs0(1,-1);
    for (int k=1;(1<<k)<=clo;k++) lg[1<<k]=k;
    for (int i=3;i<=clo;i++)
        if (!lg[i]) lg[i]=lg[i-1];
    for (int k=1;k<=lg[clo];k++)
        for (int i=1;i+(1<<k)<=clo;i++)
            mn[i][k]=min(mn[i][k-1],mn[i+(1<<(k-1))][k-1]);
    for (int i=1;i<=n;i++)
        for (int j=0;j<14;j++)
            s1[i][j]=s2[i][j]=s3[i][j]=s4[i][j]=n1[i][j]=n2[i][j]=n3[i][j]=n4[i][j]=0;
    clo=0;
    dfs1(1,n);
    scanf("%d",&q);
    while (q--)
    {
        scanf("%d%d",&u,&x);
        modify(u,x);
        printf("%lld\n",ans);
    }
}
int main()
{
    //freopen("in","r",stdin);
    //freopen("out","w",stdout);
    while (scanf("%d",&n)==1) solve();
}