【西安邀请赛E Tree】树链剖分+线段树

西安邀请赛E
这道题线段树版本有道升级版本
FZU2105
然后小菜鸡ljq很容易就想到线段树怎么做
然后跟队友说 这题能出
等下 他问点和点之间的最短路
woc 点和点之间的最短路是什么啊 猝
…
拆位 维护区间1的个数 奇数表示存在 偶数表示不存在

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
//#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;


#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
typedef unsigned long long ull;
const ull hash1 = 201326611;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
//ull ha[MAX_N],pp[MAX_N];

inline int read()
{
    int date = 0,m = 1; char ch = 0;
    while(ch!='-'&&(ch<'0'|ch>'9'))ch = getchar();
    if(ch=='-'){m = -1; ch = getchar();}
    while(ch>='0' && ch<='9')
    {
        date = date*10+ch-'0';
        ch = getchar();
    }return date*m;
}
const int MAX_N = 100025;
int ans,n,p[MAX_N],eid,cnt,id[MAX_N],Rank[MAX_N],arr[MAX_N],sz[MAX_N],fa[MAX_N],son[MAX_N],s[MAX_N<<2][31],col[MAX_N<<2][31],depth[MAX_N],top[MAX_N];
void init()
{
    eid = 0;
    memset(p,-1,sizeof(p));
}
struct edge
{
    int v,next;
}e[MAX_N<<1];
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
void up(int rt)
{
    for(int i = 0;i<30;++i)
    {
        s[rt][i] = s[rt<<1][i] + s[rt<<1|1][i];
    }
}
void build(int rt,int l,int r)
{
    for(int i = 0;i<30;++i) col[rt][i] = -1;
    if(l==r)
    {
        for(int i = 0;i<30;++i)
        {
            if((1<<i)&arr[Rank[l]]) s[rt][i] = 1;
            else s[rt][i] = 0;
        }
        return ;
    }
    int mid = (l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void down(int rt,int l,int r)
{
    int mid = (l+r)>>1;
    for(int i = 0;i<30;++i)
    {
        if(col[rt][i]!=-1)
        {
            col[rt<<1|1][i] = col[rt<<1][i] = col[rt][i];
            if(col[rt][i]==1)
            {
                s[rt<<1][i] = mid-l+1;
                s[rt<<1|1][i] = r-mid;
            }
            else
            {
                s[rt<<1][i] = 0;
                s[rt<<1|1][i] = 0;
            }
            col[rt][i] = -1;
        }
    }
}
void update(int rt,int l,int r,int x,int y,int v,int flag)
{
    if(x<=l&&r<=y)
    {
        if(flag==1)
        {
            for(int i = 0;i<30;++i)
            {
                if((1<<i)&v)
                {
                    col[rt][i] = 1;
                    s[rt][i] = r-l+1;
                }
            }
        }
        else
        {
            for(int i = 0;i<30;++i)
            {
                if(!((1<<i)&v))
                {
                    col[rt][i] = 0;
                    s[rt][i] = 0;
                }
            }
        }
        return;
    }
    down(rt,l,r);
    int mid = (l+r)>>1;
    if(x>mid) update(rt<<1|1,mid+1,r,x,y,v,flag);
    else if(y<=mid) update(rt<<1,l,mid,x,y,v,flag);
    else update(rt<<1,l,mid,x,y,v,flag),update(rt<<1|1,mid+1,r,x,y,v,flag);
    up(rt);
}
void query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        for(int i = 0;i<30;++i)
        {
            if(s[rt][i]&1) ans^=(1<<i);
        }
        return;
    }
    down(rt,l,r);
    int mid = (l+r)>>1;
    if(x>mid)  query(rt<<1|1,mid+1,r,x,y);
    else if(y<=mid)  query(rt<<1,l,mid,x,y);
    else  query(rt<<1,l,mid,x,y),query(rt<<1|1,mid+1,r,x,y);
}
void dfs1(int x,int fath)
{
    fa[x] = fath;
    depth[x] = depth[fath]+1;
    sz[x] = 1;
    for(int i = p[x];i+1;i=e[i].next)
    {
        int v = e[i].v;
        if(v==fath) continue;
        dfs1(v,x);
        sz[x]+=sz[v];
        if(sz[son[x]]<sz[v]) son[x] = v;
    }
}
void dfs2(int u,int t)
{
    top[u] = t;
    id[u] = ++cnt;
    Rank[cnt] = u;
    if(!son[u]) return;
    dfs2(son[u],t);
    for(int i = p[u];i+1;i=e[i].next)
    {
        int v  =e[i].v;
        if(v!=son[u]&&v!=fa[u]) dfs2(v,v);
    }
}
void sum(int x,int y)
{
    while(top[x]!=top[y])
    {
        if(depth[top[x]]<depth[top[y]]) swap(x,y);
        query(1,1,n,id[top[x]],id[x]);
        x = fa[top[x]];
    }
    if(id[x]>id[y]) swap(x,y);
    query(1,1,n,id[x],id[y]);
}
void updates(int x,int y,int c,int flag)
{
    while(top[x]!=top[y])
    {
        if(depth[top[x]]<depth[top[y]]) swap(x,y);
        update(1,1,n,id[top[x]],id[x],c,flag);
        x = fa[top[x]];
    }
    if(id[x]>id[y]) swap(x,y);
    update(1,1,n,id[x],id[y],c,flag);
}
/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/

/*int root[MAX_N],cnt,sz;
namespace hjt
{
    #define mid ((l+r)>>1)
    struct node{int l,r,maxx;}T[MAX_N*40];

    #undef mid
}*/

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int m,x,y,opt;
    n = read();m = read();
    for(int i = 1;i<=n;++i) arr[i] = read();
    init();
    for(int i = 1;i<n;++i)
    {
        x = read();y=read();
        add(x,y);add(y,x);
    }
    dfs1(1,0);
    dfs2(1,1);
    build(1,1,n);
    for(int i = 1;i<=n;++i)
    {
        opt = read();x=read();y=read();
        if(opt==1)
        {
            updates(1,x,y,1);
        }
        else if(opt==2)
        {
            updates(1,x,y,2);
        }
        else
        {
            ans = 0;
            sum(1,x);
            if(ans!=y) printf("YES\n");
            else printf("NO\n");
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}