bzoj2819: Nim

链剖维护路径异或值。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int read()
{
    char ch=getchar();int f=0;
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9'){f=(f<<1)+(f<<3)+ch-'0';ch=getchar();}
    return f;
}
struct node
{
    int from;
    int to;
    int next;
}edge[1000005];
int tot,head[500005],n,m,a[500005],fa[500005],pos[500005],npos[500005],top[500005],size[500005],son[500005],num;
struct segtree
{
    int ls;
    int rs;
    int sum;
}tree[2000005];
int cnt=1,dep[500005];
void add(int u,int v)
{
    edge[tot].from=u;
    edge[tot].to=v;
    edge[tot].next=head[u];
    head[u]=tot++;
}
void dfs1(int x)
{
    dep[x]=dep[fa[x]]+1;
    size[x]=1;
    for(int i=head[x];i!=-1;i=edge[i].next)
    {
        if(edge[i].to!=fa[x])
        {
            fa[edge[i].to]=x;
            dfs1(edge[i].to);
            if(size[edge[i].to]>size[son[x]])
            {
                son[x]=edge[i].to;
            }
            size[x]+=size[edge[i].to];
        }
    }
}
void dfs2(int x)
{
    pos[x]=++num;
    npos[num]=x;
    if(son[fa[x]]==x) top[x]=top[fa[x]];
    else top[x]=x;
    if(son[x])
    dfs2(son[x]);
    for(int i=head[x];i!=-1;i=edge[i].next)
    {
        if(edge[i].to!=fa[x]&&edge[i].to!=son[x])
        dfs2(edge[i].to);
    }
}
void build(int p,int l,int r)
{
    int mid=l+r>>1;
    if(l==r)
    {
        tree[p].sum=a[npos[l]];
        return;
    }
    tree[p].ls=++cnt;
    tree[p].rs=++cnt;
    build(tree[p].ls,l,mid);
    build(tree[p].rs,mid+1,r);
    tree[p].sum=tree[tree[p].ls].sum^tree[tree[p].rs].sum;
}
void modify(int p,int l,int r,int x,int y)
{
    if(l==r)
    {
        tree[p].sum=y;
        return;
    }
    int mid=l+r>>1;
    if(x<=mid)
    modify(tree[p].ls,l,mid,x,y);
    else modify(tree[p].rs,mid+1,r,x,y);
    tree[p].sum=tree[tree[p].ls].sum^tree[tree[p].rs].sum;
}
int query(int p,int l,int r,int x,int y)
{
    int mid=l+r>>1;
    if(l==x&&r==y)
    {
        return tree[p].sum;
    }
    if(y<=mid)
    return query(tree[p].ls,l,mid,x,y);
    else if(x>mid)
    return query(tree[p].rs,mid+1,r,x,y);
    else return query(tree[p].ls,l,mid,x,mid)^query(tree[p].rs,mid+1,r,mid+1,y);
}
int query(int x,int y)
{
    int fx=top[x],fy=top[y],sum=0;
    while(fx!=fy)
    {
        if(dep[fx]<dep[fy]) swap(x,y),swap(fx,fy);
        sum^=query(1,1,n,pos[fx],pos[x]);
        x=fa[fx],fx=top[x];
    }
    if(dep[x]<dep[y]) swap(x,y);
    sum^=query(1,1,n,pos[y],pos[x]);
    return sum;
}
int main()
{
    memset(head,-1,sizeof(head));
    n=read();
    for(int i=1;i<=n;i++)
    a[i]=read();
    for(int i=1;i<n;i++)
    {
        int u=read(),v=read();
        add(u,v);
        add(v,u);
    }
    dfs1(1);
    dfs2(1);
    build(1,1,n);
    m=read();
    for(int i=1;i<=m;i++)
    {
        char ch[5];int x,y;
        scanf("%s",ch);
        x=read();y=read();
        if(ch[0]=='C')
        {
            modify(1,1,n,pos[x],y);
        }
        else
        {
            int ans=query(x,y);
            if(ans)
            puts("Yes");
            else puts("No");
        }
    }
    return 0;
}