CF Educational Codeforces Round 6 E题 dfs+线段树

E. New Year Tree
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Sample test(s)
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

题意

有一个树，这个树每一个结点初始都有一个颜色。然后有两种操作，一种对一个节点的所有子树染色。一种询问一个节点的所有子树一共有几种颜色。

题解

对于这样的求所有子树的题目。我们可以dfs一下给所有节点标号。这样一个节点的所有子树都是在一个连续区间里。然后我们就可以用线段树处理了。注意有60种颜色，得用long long 存储。并且位运算用1LL<

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
#define m0(a) memset(a,0,sizeof(a))
#define mm(a) memset(a,0x3f,sizeof(a))
#define f(i,a,b) for(i = a;i<=b;i++)
#define fi(i,a,b) for(i = a;i>=b;i--)

using namespace std;
#define SIZE 4*100000
typedef long long ll;

vector<int>G[SIZE+10];
int a0[SIZE+10];
int L[SIZE+10];
int R[SIZE+10];
int cnt;
ll T[8*SIZE+100];
ll lazy[8*SIZE+100];
ll sum;
ll NN;

void dfs(int n){
    for(auto it = G[n].begin();it!=G[n].end();it++){
        if(L[*it]==-1){
            L[*it]=cnt++;
            int tem = *it;
            dfs(tem);
        }
    }
    R[n] = cnt-1;
}

void Push_down(int t){
    lazy[t<<1] = lazy[t<<1|1] = lazy[t];
    T[t<<1] = T[t<<1|1] = lazy[t];
    T[t] = lazy[t];
    lazy[t] = 0;
}

void Push_up(int t){
    T[t] = T[t<<1]|T[t<<1|1];
}

void aP(int a,int b){
    for(T[a+=NN]=1LL<<b,a>>=1;a;a>>=1)
        Push_up(a);
}

void init(int n){
    memset(L,-1,sizeof(L));
    cnt = 1;
    L[1] = cnt++;
    dfs(1);
    int i;
    m0(T);
    NN = 1;
    while(NN<n) NN<<=1;
    NN--;
    f(i,1,n)
        aP(L[i],a0[i]);
}

void update(int L,int R,int c,int t,int l,int r){
    if(L<=l&&r<=R){
        lazy[t] = T[t] = 1LL<<c;
        return ;
    }

    if(lazy[t]) Push_down(t);

    int m = (l+r)>>1;
    if(L<=m) update(L,R,c,t<<1,l,m);
    if(m<R) update(L,R,c,t<<1|1,m+1,r);

    Push_up(t);
}

void query(int L,int R,int t,int l,int r){
    if(L<=l&&r<=R){
        sum|=T[t];
        return ;
    }

    if(lazy[t]) Push_down(t);

    int m = (l+r)>>1;
    if(L<=m) query(L,R,t<<1,l,m);
    if(m<R) query(L,R,t<<1|1,m+1,r);

    Push_up(t);
}

int Cnt(ll k){
    int Sum = 0;
    while(k){
        if(k&1)
            Sum++;
        k>>=1;
    }
    return Sum;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n,m;
    cin>>n>>m;
    int i,j;
    f(i,1,n) cin>>a0[i];
    f(i,1,n-1){
        int b,e;
        cin>>b>>e;
        G[b].push_back(e);
        G[e].push_back(b);
    }

    init(n);

    f(i,1,m){
        int a,b,c;
        cin>>a;
        if(a==1){
            cin>>b>>c;
            update(L[b],R[b],c,1,1,1+NN);
        }else{
            cin>>b;
            sum = 0;
            query(L[b],R[b],1,1,1+NN);
            cout<<Cnt(sum)<<endl;
        }
    }
    return 0;
}