CodeForces - 620E New Year Tree （ 状压+线段树+DFS

New Year Tree

题目描述

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.

输入

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.

输出

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.

样例

Examples
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为根的子树的节点中有多少不同的颜色

线段树维护一下就行了

AC代码

#include <vector>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define ls st<<1
#define rs st<<1|1
const int MAXN= 1e6+10;
vector<int> G[MAXN];
int col[MAXN];
bool vis[MAXN];
int L[MAXN], R[MAXN];
int val[MAXN];
int dep = 0;
int n, m;
struct node {
    int l, r;
    int lazy;
    ll x;
}tree[MAXN*4];

void dfs(int u, int fa) {
    L[u] = ++dep;
    val[dep] = col[u];
    for(int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if(v != fa) {
            dfs(v,u);
        }
    }
    R[u] = dep;
}
void build(int l, int r, int st) {
    tree[st].lazy = 0;
    tree[st].l = l;
    tree[st].r = r;
    if(l == r) {
        tree[st].x = (1ll<<val[l]);
        return;
    }
    int mid = (l+r) >> 1;
    build(l,mid,ls);
    build(mid+1,r,rs);
    tree[st].x = tree[ls].x|tree[rs].x;
}
void push_down(int st) {
    if(tree[st].lazy) {
        tree[ls].x = tree[rs].x = (1ll<<tree[st].lazy);
        tree[ls].lazy = tree[rs].lazy = tree[st].lazy;
        tree[st].lazy = 0;
    }
}
void update(int l, int r, int xx, int st) {
    if(tree[st].l>=l && tree[st].r<=r) {
        tree[st].lazy = xx;
        tree[st].x = (1ll<<xx);
        return;
    }
    push_down(st);
    int mid = (tree[st].l+tree[st].r)>>1;
    if(r <= mid)
        update(l,r,xx,ls);
    else if(l > mid)
        update(l,r,xx,rs);
    else {
        update(l,mid,xx,ls);
        update(mid+1,r,xx,rs);
    }
    tree[st].x = tree[ls].x|tree[rs].x;
}
ll query(int l, int r, int st) {
    if(tree[st].l>=l && tree[st].r<=r) {
        return tree[st].x;
    }
    push_down(st);
    int mid = (tree[st].l+tree[st].r)>>1;
    if(r <= mid)
        return query(l,r,ls);
    else if(l > mid)
        return query(l,r,rs);
    else
        return query(l,mid,ls)|query(mid+1,r,rs);
}
int main() {
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> col[i];
    for(int i = 0; i < n-1; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1,-1);
    build(1,n,1);
    while(m--) {
        int ch;
        cin >> ch;
        if(ch == 1) {
            int x, y;
            cin >> x >> y;
            update(L[x],R[x],y,1);
        }
        else {
            int x;
            cin >> x;
            ll ans = query(L[x],R[x],1);
            int sum = 0;
            while(ans > 0) {
                ans -= ans&(-ans);
                sum++;
            }
            cout << sum << endl;
        }
    }
return 0;
}