bzoj4811

题解：

对于每一个节点，我们建立v0，v1

v0表示0进过会怎么样

v1表示1进过会怎么样

然后线段树合并

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=;
typedef unsigned long long ull;
ull a[N],zz,now,ans;
int n,m,k,op,xx,yy,Op[N],fi[N],ne[N*],v[N*],tot;
int size[N],fa[N],son[N],deep[N],rev[N],dfn[N],cnt,top[N];
struct Tree
{
    ull v0,v1;Tree(){}
    Tree(int op,ull x)
     {
         if (op==)v0=,v1=x;
        else if (op==)v0=x,v1=~;
        else v0=x,v1=(~)^x;
     }
    Tree(ull x,ull y){v0=x,v1=y;}
}trl[N*],trr[N*];
Tree operator+(Tree x,Tree y)
{
    return Tree((x.v0&y.v1)|((~x.v0)&y.v0),(x.v1&y.v1)|((~x.v1)&y.v0));
}
void jb(int x,int y)
{
    v[tot]=y;
    ne[tot]=fi[x];
    fi[x]=tot++;
}
void dfs1(int x)
{
    size[x]=;
    for (int i=fi[x];~i;i=ne[i])
     if (v[i]!=fa[x])
      {
        fa[v[i]]=x;
        deep[v[i]]=deep[x]+;
        dfs1(v[i]);
        size[x]+=size[v[i]];
        if (size[v[i]]>size[son[x]])son[x]=v[i];
      }
}
void dfs2(int x,int tp)
{
    rev[dfn[x]=++cnt]=x;
    top[x]=tp;
    if (son[x])dfs2(son[x],tp);
    for (int i=fi[x];~i;i=ne[i])
     if (v[i]!=fa[x]&&v[i]!=son[x])dfs2(v[i],v[i]);
}
void build(int l,int r,int pos)
{
    if (l==r)
     {
         trl[pos]=trr[pos]=Tree(Op[rev[l]],a[rev[l]]);
        return;
      }
    int mid=(l+r)>>;
    build(l,mid,pos*);
    build(mid+,r,pos*+);
    trl[pos]=trl[pos*]+trl[pos*+];
    trr[pos]=trr[pos*+]+trr[pos*];
}
void insert(int l,int r,int pos,int num)
{
    if (l==r)
     {
         trl[pos]=trr[pos]=Tree(Op[rev[l]],a[rev[l]]);
        return;
     }
    int mid=(l+r)>>;
    if (mid<num)insert(mid+,r,pos*+,num);
    else insert(l,mid,pos*,num);
    trl[pos]=trl[pos*]+trl[pos*+];
    trr[pos]=trr[pos*+]+trr[pos*];
}
Tree query(int l,int r,int pos,int L,int R,int f)
{
    if (l>=L&&r<=R)return f?trr[pos]:trl[pos];
    int mid=(l+r)>>,lson=pos<<,rson=pos<<|;
    if (mid<L)return query(mid+,r,pos*+,L,R,f);
    if (mid>=R)return query(l,mid,pos*,L,R,f);
    if (!f)return query(l,mid,pos*,L,R,f)+query(mid+,r,pos*+,L,R,f);
    return query(mid+,r,pos*+,L,R,f)+query(l,mid,pos*,L,R,f);
}
Tree solve(int x,int y)
{
    Tree vx=Tree((int),0ull),vy=Tree((int),0ull);
    int fx=top[x],fy=top[y];
    while (fx!=fy)
     if (deep[fx]>deep[fy])
      {
          vx=vx+query(,n,,dfn[fx],dfn[x],);
        x=fa[fx];
        fx=top[x];
      }
     else
      {
          vy=query(,n,,dfn[fy],dfn[y],)+vy;
        y=fa[fy];
        fy=top[y];
      }
    if (deep[x]>deep[y])return vx+query(,n,,dfn[y],dfn[x],)+vy;
    return vx+query(,n,,dfn[x],dfn[y],)+vy;
}
int main()
{
    memset(fi,-,sizeof(fi));
    deep[]=;
    scanf("%d%d%d",&n,&m,&k);
    for (int i=;i<=n;i++)scanf("%d%llu",&Op[i],&a[i]);
    for (int i=;i<n;i++)
     {
         scanf("%d%d",&xx,&yy);
        jb(xx,yy);jb(yy,xx);
     }
    dfs1();dfs2(,);
    build(,n,);
    while (m--)
     {
        scanf("%d%d%d%llu",&op,&xx,&yy,&zz);
        if (op==)Op[xx]=yy,a[xx]=zz,insert(,n,,dfn[xx]);
        else
         {
             Tree t=solve(xx,yy);now=ans=;
            for (int i=k-;~i;i--)
             if (t.v0&(1ull<<i))ans+=1ull<<i;
             else if (t.v1&(1ull<<i)&&now+(1ull<<i)<=zz)
              {
                  now+=1ull<<i;
                ans+=1ull<<i;
              }
            printf("%llu\n",ans);
         }
     }
    return ;
}