数据结构（线段树）：Educational Codeforces Round 6 620E. 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.
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
2
3
4
5
1
2
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
6
1
3
3
2
1
2
3
5
5
1
2
2
1
1
1
2
3
用DFS序与线段树维护子树信息。
1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 using namespace std; 5 const int N=400010; 6 int cnt,fir[N],nxt[N*2],to[N*2],c[N]; 7 int ID[N],rID[N],ED[N],tag[N<<2],tot; 8 long long t[N<<2];int n,Q; 9 void addedge(int a,int b){ 10 nxt[++cnt]=fir[a]; 11 to[fir[a]=cnt]=b; 12 } 13 14 void DFS(int x,int fa){ 15 rID[ID[x]=++tot]=x; 16 for(int i=fir[x];i;i=nxt[i]) 17 if(to[i]!=fa)DFS(to[i],x); 18 ED[x]=tot; 19 } 20 21 void Push_up(int x){t[x]=t[x<<1]|t[x<<1|1];} 22 void Mark(int x,long long d){tag[x]=1;t[x]=d;} 23 void Push_down(int x){ 24 if(tag[x]){ 25 Mark(x<<1,t[x]); 26 Mark(x<<1|1,t[x]); 27 }tag[x]=0; 28 } 29 #define mid ((l+r)>>1) 30 void Build(int x,int l,int r){ 31 if(l==r){t[x]=1ll<<(c[rID[l]]-1);return;} 32 Build(x<<1,l,mid);Build(x<<1|1,mid+1,r); 33 Push_up(x); 34 } 35 void Update(int x,int l,int r,int a,int b,int d){ 36 if(l>=a&&r<=b){Mark(x,1ll<<(d-1));return;}Push_down(x); 37 if(mid>=a)Update(x<<1,l,mid,a,b,d); 38 if(mid<b)Update(x<<1|1,mid+1,r,a,b,d); 39 Push_up(x); 40 } 41 42 long long Query(int x,int l,int r,int a,int b){ 43 if(l>=a&&r<=b)return t[x]; 44 long long ret=0;Push_down(x); 45 if(mid>=a)ret=Query(x<<1,l,mid,a,b); 46 if(mid<b)ret|=Query(x<<1|1,mid+1,r,a,b); 47 return ret; 48 } 49 50 int tp,x,d; 51 int main(){ 52 scanf("%d%d",&n,&Q); 53 for(int i=1;i<=n;i++) 54 scanf("%d",&c[i]); 55 for(int i=1,a,b;i<n;i++){ 56 scanf("%d%d",&a,&b); 57 addedge(a,b); 58 addedge(b,a); 59 } 60 DFS(1,1); 61 Build(1,1,n); 62 while(Q--){ 63 scanf("%d",&tp); 64 if(tp==1){ 65 scanf("%d%d",&x,&d); 66 Update(1,1,n,ID[x],ED[x],d); 67 } 68 else{ 69 scanf("%d",&x);int ans=0; 70 long long sum=Query(1,1,n,ID[x],ED[x]); 71 for(int i=0;i<60;i++)if(sum>>i&1)ans++; 72 printf("%d\n",ans); 73 } 74 } 75 }
