E - New Year Tree

最新推荐文章于 2020-03-26 20:12:58 发布

傻的让人心疼

最新推荐文章于 2020-03-26 20:12:58 发布

阅读量366

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/ifeli/article/details/75201160

版权

线段树专栏收录该内容

8 篇文章 0 订阅

订阅专栏

又是一题bitset+线段树
先dfs弄一弄。让在一个子树的都在一起，然后就是线段树+bitset裸题

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <map>

#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define mem(i,a) memset(i,a,sizeof(i))
#define rson mid+1,r,rt<<1|1
#define lson l,mid,rt<<1

#define mp make_pair
#define pb push_back
#define ll long long
#define LL long long
using namespace std;
template <typename T>inline void read(T &_x_){
    _x_=0;bool f=false;char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch=='-') f=!f;ch=getchar();}
    while ('0'<=ch&&ch<='9') {_x_=_x_*10+ch-'0';ch=getchar();}
    if(f) _x_=-_x_;
}
const double eps = 0.0000001;
const int maxn = 4e5+7;
const int mod = 1e9+7;

vector<int>G[maxn];
bitset<61> tree[maxn<<2];
int stp = 0, in[maxn], out[maxn],lazy[maxn<<2];
int n,x,y,z,m,a[maxn];

void dfs(int rt, int f){
    in[rt] = ++stp;
    for(auto& v : G[rt]){
        if(v != f) dfs(v, rt);
    }
    out[rt] = stp;
}

void pushup(int rt){
    tree[rt] = tree[rt<<1]|tree[rt<<1|1];
}

void pushdown(int rt){
    if(lazy[rt]){
        lazy[rt<<1]=lazy[rt<<1|1]=lazy[rt];
        tree[rt<<1].reset();
        tree[rt<<1|1].reset();
        tree[rt<<1][lazy[rt]]=tree[rt<<1|1][lazy[rt]]=1;
        lazy[rt]=0;
    }
}

void update(int l,int r,int rt,int L,int R,int val){
    if(l>=L&&r<=R){
        tree[rt].reset();
        tree[rt][val]=1;
        lazy[rt]=val;
        return;
    }
    pushdown(rt);
    int mid=(l+r)/2;
    if(mid>=L) update(lson,L,R,val);
    if(mid<R) update(rson,L,R,val);
    pushup(rt);
}

bitset<61> query(int l,int r,int rt,int L,int R){
    if(l>=L&&r<=R){
        return tree[rt];
    }
    pushdown(rt);
    int mid=(l+r)/2;
    bitset<61> ans;ans.reset();
    if(mid>=L) ans|=query(lson,L,R);
    if(mid<R) ans|=query(rson,L,R);
    pushup(rt);
    return ans;
}

int main(){
    read(n),read(m);
    FOR(i,1,n) read(a[i]);
    FOR(i,2,n){
        read(x),read(y);
        G[x].pb(y);
        G[y].pb(x);
    }
    dfs(1,0);
    FOR(i,1,n) update(1,n,1,in[i],in[i],a[i]);
    FOR(i,1,m){
        read(x);
        if(x==1){
            read(y),read(z);
            int l=in[y],r=out[y];
            update(1,n,1,l,r,z);
        }else{
            read(y);
            int l=in[y],r=out[y];
            printf("%d\n",query(1,n,1,l,r).count());
        }
    }
    return 0;
}