数据结构(线段树):Educational Codeforces Round 6 620E. New Year Tree
2016-08-18 16:18
429 查看
E. New Year Tree
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Examples
Input
Output
Input
Output
用DFS序与线段树维护子树信息。
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
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
用DFS序与线段树维护子树信息。
#include <iostream> #include <cstring> #include <cstdio> using namespace std; const int N=400010; int cnt,fir ,nxt[N*2],to[N*2],c ; int ID ,rID ,ED ,tag[N<<2],tot; long long t[N<<2];int n,Q; void addedge(int a,int b){ nxt[++cnt]=fir[a]; to[fir[a]=cnt]=b; } void DFS(int x,int fa){ rID[ID[x]=++tot]=x; for(int i=fir[x];i;i=nxt[i]) if(to[i]!=fa)DFS(to[i],x); ED[x]=tot; } void Push_up(int x){t[x]=t[x<<1]|t[x<<1|1];} void Mark(int x,long long d){tag[x]=1;t[x]=d;} void Push_down(int x){ if(tag[x]){ Mark(x<<1,t[x]); Mark(x<<1|1,t[x]); }tag[x]=0; } #define mid ((l+r)>>1) void Build(int x,int l,int r){ if(l==r){t[x]=1ll<<(c[rID[l]]-1);return;} Build(x<<1,l,mid);Build(x<<1|1,mid+1,r); Push_up(x); } void Update(int x,int l,int r,int a,int b,int d){ if(l>=a&&r<=b){Mark(x,1ll<<(d-1));return;}Push_down(x); if(mid>=a)Update(x<<1,l,mid,a,b,d); if(mid<b)Update(x<<1|1,mid+1,r,a,b,d); Push_up(x); } long long Query(int x,int l,int r,int a,int b){ if(l>=a&&r<=b)return t[x]; long long ret=0;Push_down(x); if(mid>=a)ret=Query(x<<1,l,mid,a,b); if(mid<b)ret|=Query(x<<1|1,mid+1,r,a,b); return ret; } int tp,x,d; int main(){ scanf("%d%d",&n,&Q); for(int i=1;i<=n;i++) scanf("%d",&c[i]); for(int i=1,a,b;i<n;i++){ scanf("%d%d",&a,&b); addedge(a,b); addedge(b,a); } DFS(1,1); Build(1,1,n); while(Q--){ scanf("%d",&tp); if(tp==1){ scanf("%d%d",&x,&d); Update(1,1,n,ID[x],ED[x],d); } else{ scanf("%d",&x);int ans=0; long long sum=Query(1,1,n,ID[x],ED[x]); for(int i=0;i<60;i++)if(sum>>i&1)ans++; printf("%d\n",ans); } } }
相关文章推荐
- Educational Codeforces Round 20 G. Periodic RMQ Problem(线段树动态开点)
- 【Codeforces Round 169 (Div 2) E】【数据结构区间维护】Little Girl and Problem on Trees 大菊花树的距离性修改查询
- Educational Codeforces Round 37 F. SUM and REPLACE 线段树区间更新及查询
- Educational Codeforces Round 37 F - SUM and REPLACE (线段树)
- (线段树)CF813 Educational Codeforces Round 22 E - Army Creation
- Educational Codeforces Round 37 (Rated for Div. 2) F. SUM and REPLACE(线段树)
- Codeforces Round #248 (Div. 2) B称号 【数据结构:树状数组】
- Educational Codeforces Round 6 E. New Year Tree(dfs序线段树)
- Educational Codeforces Round 6(E)DFS序,线段树
- Educational Codeforces Round 33 (Rated for Div. 2) F. Subtree Minimum Query (线段树)
- Educational Codeforces Round 3 E. Minimum spanning tree for each edge 最小生成树+树链剖分+线段树
- Educational Codeforces Round 23 F. MEX Queries 离散化+线段树
- Educational Codeforces Round 23 F. MEX Queries(线段树区间设值)
- Educational Codeforces Round 23 F. MEX Queries(离散化+线段树)
- Educational Codeforces Round 37 (Rated for Div. 2) 【F】【线段树】
- Educational Codeforces Round 37 (Rated for Div. 2)-F-SUM and REPLACE(线段树)
- Educational Codeforces Round 37 (Rated for Div. 2) F. SUM and REPLACE(线段树,区间更新)
- Codeforces Round #447 (Div. 2) D. Ralph And His Tour in Binary Country 二叉树、预处理、二分、数据结构
- Educational Codeforces Round 23 F. MEX Queries(线段树)
- Educational Codeforces Round 20 G. Periodic RMQ Problem(线段树+主席树)