Educational Codeforces Round 6 E. New Year Tree CF620E

因为最多只有60种颜色所以用ll状压一下
对树dfs序构建一棵线段树
然后区间更新区间查询

#include <iostream>#include <algorithm>#include <sstream>#include <string>#include <queue>#include <cstdio>#include <map>#include <set>#include <utility>#include <stack>#include <cstring>#include <cmath>#include <vector>#include <ctime>#include <bitset>using namespace std;#define pb push_back#define sd(n) scanf("%d",&n)#define sdd(n,m) scanf("%d%d",&n,&m)#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)#define sld(n) scanf("%lld",&n)#define sldd(n,m) scanf("%lld%lld",&n,&m)#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)#define sf(n) scanf("%lf",&n)#define sff(n,m) scanf("%lf%lf",&n,&m)#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)#define ss(str) scanf("%s",str)#define ans() printf("%d",ans)#define ansn() printf("%d\n",ans)#define anss() printf("%d ",ans)#define lans() printf("%lld",ans)#define lanss() printf("%lld ",ans)#define lansn() printf("%lld\n",ans)#define fansn() printf("%.10f\n",ans)#define r0(i,n) for(int i=0;i<(n);++i)#define r1(i,e) for(int i=1;i<=e;++i)#define rn(i,e) for(int i=e;i>=1;--i)#define rsz(i,v) for(int i=0;i<(int)v.size();++i)#define szz(x) ((int)x.size())#define mst(abc,bca) memset(abc,bca,sizeof abc)#define lowbit(a) (a&(-a))#define all(a) a.begin(),a.end()#define pii pair<int,int>#define pli pair<ll,int>#define pll pair<ll,ll>#define mp make_pair#define lrt rt<<1#define rrt rt<<1|1#define X first#define Y second#define PI (acos(-1.0))#define sqr(a) ((a)*(a))typedef long long ll;typedef unsigned long long ull;const ll mod = 1000000000+7;const double eps=1e-9;const int inf=0x3f3f3f3f;const ll infl = 10000000000000000;const int maxn=  800000+10;const int maxm = 400000+10;//Pretests passedint in(int &ret){    char c;    int sgn ;    if(c=getchar(),c==EOF)return -1;    while(c!='-'&&(c<'0'||c>'9'))c=getchar();    sgn = (c=='-')?-1:1;    ret = (c=='-')?0:(c-'0');    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');    ret *=sgn;    return 1;}vector<int>g[maxn];int l[maxm],r[maxm];int c[maxm];ll seg[maxn<<3];int lazy[maxn<<3];int pos;void pushdown(int rt,int l,int r){    if(l!=r)    {        lazy[lrt] = lazy[rrt] = lazy[rt];        seg[lrt] = seg[rrt] = seg[rt] = 1LL<<lazy[rt];    }    lazy[rt] = 0;}void updater(int rt,int l,int r,int ql,int qr,int co){    if(ql<=l&&qr>=r)    {        lazy[rt] = co;        seg[rt] = 1LL<<co;        return;    }    int mid = (l+r)>>1;    if(lazy[rt])pushdown(rt,l,r);    if(ql<=mid)updater(lrt,l,mid,ql,qr,co);    if(qr> mid)updater(rrt,mid+1,r,ql,qr,co);    seg[rt] = seg[lrt]|seg[rrt];}void update(int rt,int l,int r,int p,int co){    if(l==r)    {        seg[rt] = 1LL<<co;        return ;    }    int mid = (l+r)>>1;    if(p<=mid)update(lrt,l,mid,p,co);    else update(rrt,mid+1,r,p,co);    seg[rt] = seg[lrt]|seg[rrt];}void dfs(int u,int f){    int sz = g[u].size();    l[u] = ++pos;    r0(i,sz)    {        int v =  g[u][i];        if(v==f)continue;        dfs(v,u);    }    r[u] = ++pos;}ll query(int rt,int l,int r,int ql,int qr){    if(lazy[rt])pushdown(rt,l,r);    if(ql<=l&&qr>=r)return seg[rt];    int mid = (l+r)>>1;    ll res = 0;    if(ql<=mid)res |= query(lrt,l,mid,ql,qr);    if(qr>mid) res |= query(rrt,mid+1,r,ql,qr);//    seg[rt] = 0;//    seg[rt] |= seg[lrt]|seg[rrt];    return res;}int main(){#ifdef LOCAL    freopen("input.txt","r",stdin);//    freopen("output.txt","w",stdout);#endif // LOCAL    int n,m;    sdd(n,m);    r1(i,n)sd(c[i]);    r1(i,n-1)    {        int u,v;        sdd(u,v);        g[u].pb(v);        g[v].pb(u);    }    dfs(1,0);    r1(i,n)    {        update(1,1,2*n,l[i],c[i]);        update(1,1,2*n,r[i],c[i]);    }    while(m--)    {        int o;        sd(o);        if(o&1)        {            int a,b;            sdd(a,b);            int x = l[a] , y = r[a];            updater(1,1,2*n,x,y,b);        }        else        {            int x;sd(x);            int a = l[x], b = r[x];            ll check = query(1,1,2*n,a,b);            int ans = 0;            r1(i,60)if((1LL<<i)&check)++ans;            ansn();        }    }    return 0;}