【CF 620E 】New Year Tree 【DFS+线段树+状态压缩】

The New Year holidays are over, but Resha doesn’t want to throw away the New Year tree. He invited his best friends Kerim and Gural to help him to redecorate the New Year tree.

The New Year tree is an undirected tree with n vertices and root in the vertex 1.

You should process the queries of the two types:

Change the colours of all vertices in the subtree of the vertex v to the colour c.
Find the number of different colours in the subtree of the vertex v.
Input
The first line contains two integers n, m (1 ≤ n, m ≤ 4·105) — the number of vertices in the tree and the number of the queries.

The second line contains n integers ci (1 ≤ ci ≤ 60) — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers xj, yj (1 ≤ xj, yj ≤ n) — the vertices of the j-th edge. It is guaranteed that you are given correct undirected tree.

The last m lines contains the description of the queries. Each description starts with the integer tk (1 ≤ tk ≤ 2) — the type of the k-th query. For the queries of the first type then follows two integers vk, ck (1 ≤ vk ≤ n, 1 ≤ ck ≤ 60) — the number of the vertex whose subtree will be recoloured with the colour ck. For the queries of the second type then follows integer vk (1 ≤ vk ≤ n) — the number of the vertex for which subtree you should find the number of different colours.

Output
For each query of the second type print the integer a — the number of different colours in the subtree of the vertex given in the query.

Each of the numbers should be printed on a separate line in order of query appearing in the input.

Example
Input
7 10
1 1 1 1 1 1 1
1 2
1 3
1 4
3 5
3 6
3 7
1 3 2
2 1
1 4 3
2 1
1 2 5
2 1
1 6 4
2 1
2 2
2 3
Output
2
3
4
5
1
2
Input
23 30
1 2 2 6 5 3 2 1 1 1 2 4 5 3 4 4 3 3 3 3 3 4 6
1 2
1 3
1 4
2 5
2 6
3 7
3 8
4 9
4 10
4 11
6 12
6 13
7 14
7 15
7 16
8 17
8 18
10 19
10 20
10 21
11 22
11 23
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4
1 12 1
1 13 1
1 14 1
1 15 1
1 16 1
1 17 1
1 18 1
1 19 1
1 20 1
1 21 1
1 22 1
1 23 1
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4
Output
6
1
3
3
2
1
2
3
5
5
1
2
2
1
1
1
2
3

题意 ：给一颗树，每个节点上都有颜色，有两种操作，
1 x y 表示 将以x为根的子树的所有节点都变为y色
2 x 表示询问以x为根的子树的节点中有多少不同的颜色

分析，一开始想到树链剖分，将点权化为边权，然后加上线段树的区间修改和区间查询就可以过，在树链剖分中的对边的标号我们可知，以x为根的子树种所有边的标号是大于它的num [ x ] (以其为根节点的子树的节点个数) ，这样子查询的区间我们也可以得到，但是如何处理不同颜色问题呢，这里用了一个技巧，可以想到颜色只有60种，我们可以用(1LL < < color[ i ] )来表示每种颜色，然后只要多种颜色之间取或运算，看最后结果中有几个1就知道有几种颜色。
最后发现其实 不用树链剖分，也不用将点权化为边权，我们可以用DFS得到序号（效果是一样的）.
对于线段树种的Down操作和UpDate操作找一组数据模拟一下，看怎么填充就可以了，具体看代码。
代码

#include<bits/stdc++.h>
using namespace std;
#define  LL long long
#define fread() freopen("in.txt","r",stdin)
#define fwrite() freopen("out.txt","w",stdout)
#define CLOSE() ios_base::sync_with_stdio(false)

const int MAXN = 5*1e5;
const int MAXM = 1e6;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;

vector<int>ve[MAXN];
int color[MAXN]; // 每个节点的颜色
LL dfs_clock[MAXN];
int num[MAXN]={0}; //  
int cnt=1;
int point[MAXN];
void DFS(int now,int pre){
    num[now]=1;
    dfs_clock[cnt]=((LL)1<<color[now]);
    point[now]=cnt++;
    for(int i=0;i<ve[now].size();i++){
        int v=ve[now][i];
        if(num[v]||v==pre) continue;
        DFS(v,now);
        num[now]+=num[v]; 
    }
}
struct Tree{
    int l,r,lazy;
    LL val;
}tree[MAXN<<2];
void Up(int o){
    tree[o].val=(tree[o<<1].val|tree[o<<1|1].val);
    //printf(" %d %d %d \n",tree[o<<1].val,tree[o<<1|1].val,tree[o].val);
}
void Down(int o){
    if(tree[o].lazy){
        tree[o<<1].val=tree[o<<1|1].val=tree[o].val;
        tree[o<<1].lazy=tree[o<<1|1].lazy=1;
        tree[o].lazy=0;
    }
}
void Build(int o,int le,int ri){
    tree[o].l=le;tree[o].r=ri;
    if(le==ri) {
        tree[o].val=dfs_clock[le];
        tree[o].lazy=0;
        return ;
    }
    int mid=(tree[o].l+tree[o].r)>>1;
    Build(o<<1,le,mid);
    Build(o<<1|1,mid+1,ri);
    Up(o);
}
void UpDate(int o,int le,int ri,int val){
    if(tree[o].l>=le&&tree[o].r<=ri){
        tree[o].lazy=1;
        tree[o].val=(1LL<<val);
        return ;
    }
    Down(o);
    int mid=(tree[o].l+tree[o].r)>>1;
    if(ri<=mid) UpDate(o<<1,le,ri,val);
    else if(le>mid) UpDate(o<<1|1,le,ri,val);
    else {
        UpDate(o<<1,le,mid,val);
        UpDate(o<<1|1,mid+1,ri,val);
    }
    Up(o);
}

LL Query(int o,int le,int ri){
    if(tree[o].l>=le&&tree[o].r<=ri){
        return tree[o].val;
    }
    Down(o);
    int mid=(tree[o].l+tree[o].r)>>1;
    if(ri<=mid) return Query(o<<1,le,ri);
    else if(le>mid) return Query(o<<1|1,le,ri);
    else {
        LL a,b;
        a=Query(o<<1,le,mid);
        b=Query(o<<1|1,mid+1,ri); 
        return a|b;
    } 
} 

int main(){
    int n,m; scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) 
        scanf("%d",&color[i]);
    for(int i=1;i<=n-1;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        ve[a].push_back(b);
        ve[b].push_back(a);
    }
    DFS(1,-1);
    Build(1,1,n);
    while(m--){
        int op;scanf("%d",&op);
        if(op==1){
            int a,b;scanf("%d%d",&a,&b);
            int x=point[a];
            int y=point[a]+num[a]-1;
            UpDate(1,x,y,b);
        }else {
            int a;scanf("%d",&a);
            int x=point[a];
            int y=point[a]+num[a]-1;
            LL ans=Query(1,x,y);
            int ge=0;
            while(ans){
                if(ans&1) ge++;
                ans>>=1; 
            }
            printf("%d\n",ge);
        }
    }
    return 0;
}