Codeforces633G(SummerTrainingDay06-I dfs序+线段树+bitset)

G. Yash And Trees

time limit per test：4 seconds

memory limit per test：512 megabytes

input：standard input

output：standard output

Yash loves playing with trees and gets especially excited when they have something to do with prime numbers. On his 20th birthday he was granted with a rooted tree of n nodes to answer queries on. Hearing of prime numbers on trees, Yash gets too intoxicated with excitement and asks you to help out and answer queries on trees for him. Tree is rooted at node 1. Each node i has some value ai associated with it. Also, integer m is given.

There are queries of two types:

1. for given node v and integer value x, increase all ai in the subtree of node v by value x
2. for given node v, find the number of prime numbers p less than m, for which there exists a node u in the subtree of v and a non-negative integer value k, such that au = p + m·k.

Input

The first of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ 1000) — the number of nodes in the tree and value m from the problem statement, respectively.

The second line consists of n integers ai (0 ≤ ai ≤ 109) — initial values of the nodes.

Then follow n - 1 lines that describe the tree. Each of them contains two integers ui and vi (1 ≤ ui, vi ≤ n) — indices of nodes connected by the i-th edge.

Next line contains a single integer q (1 ≤ q ≤ 100 000) — the number of queries to proceed.

Each of the last q lines is either 1 v x or 2 v (1 ≤ v ≤ n, 0 ≤ x ≤ 109), giving the query of the first or the second type, respectively. It's guaranteed that there will be at least one query of the second type.

Output

For each of the queries of the second type print the number of suitable prime numbers.

Examples

input

8 20
3 7 9 8 4 11 7 3
1 2
1 3
3 4
4 5
4 6
4 7
5 8
4
2 1
1 1 1
2 5
2 4

output

3
1
1

input

5 10
8 7 5 1 0
1 2
2 3
1 5
2 4
3
1 1 0
1 1 2
2 2

output

2

题意：给你一棵树，根节点为1

　　　有2种操作，第一种是给u节点所在的子树的所有节点的权值+x

　　　第二种是询问，假设v是子树u中的节点，有多少种质数满足av = p + m·k，其中p<m

思路：首先用DFS序，把树转换为线性问题，使用线段树维护区间

　　　因为m<=1000,我们用bitset保存av%m的值

　　　每次对子树增加权值的时候，只需要修改懒惰标记，来记录增加的大小

　　　然后直接把bitset利用位运算来完成循环移动就行了。

 //2017-09-05
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <bitset>
 #define lson (id<<1)
 #define rson ((id<<1)|1)
 #define mid ((tree[id].l+tree[id].r)>>1)
 using namespace std;

 const int N  = ;
 const int M = ;
 int n, m;
 int head[N], tot;
 struct Edge{
     int to, next;
 }edge[N<<];

 void init(){
     tot = ;
     memset(head, -, sizeof(head));
 }

 void add_edge(int u, int v){
     edge[tot].to = v;
     edge[tot].next = head[u];
     head[u] = tot++;
 }

 //dfn记录dfs序，in[u]~out[u]的区间表示以u为根的子树。
 int in[N], out[N], idx, dfn[N];
 void dfs(int u, int fa){
     in[u] = ++idx;
     dfn[idx] = u;
     for(int i = head[u]; i != -; i = edge[i].next){
         int v = edge[i].to;
         if(v != fa)
               dfs(v, u);
     }
     out[u] = idx;
 }

 int arr[N];
 bitset<M> prime;
 bool is_prime(int x){
     for(int i = ; i*i <= x; i++)
           if(x%i == )return false;
     return true;
 }

 void init_prime(){
     prime.reset();
     for(int i = ; i < m; i++)
           if(is_prime(i))
               prime.set(i);
 }

 struct Node{
     int l, r, lazy;
     bitset<M> value;//value记录该区间内%m的余数的集合
 }tree[N<<];

 void push_up(int id){
     tree[id].value = tree[lson].value | tree[rson].value;
 }

 //循环移位，即value集合的每个数都加上了x。
 void cyclic_shift(int id, int x){
     tree[id].value = (tree[id].value<<x) | (tree[id].value>>(m-x));
 }

 void push_down(int id){
     if(tree[id].lazy){
         tree[lson].lazy += tree[id].lazy;
         tree[lson].lazy %= m;
         tree[rson].lazy += tree[id].lazy;
         tree[rson].lazy %= m;
         cyclic_shift(lson, tree[id].lazy);
         cyclic_shift(rson, tree[id].lazy);
         tree[id].lazy = ;
     }
 }

 void build(int id, int l, int r){
     tree[id].l = l;
     tree[id].r = r;
     tree[id].lazy = ;
     if(l == r){
         tree[id].value.reset();
         tree[id].value.set(arr[dfn[l]]%m);
         return;
     }
     build(lson, l, mid);
     build(rson, mid+, r);
     push_up(id);
 }

 void update(int id, int l, int r, int x){
     if(l <= tree[id].l && tree[id].r <= r){
         tree[id].lazy += x;
         tree[id].lazy %= m;
         cyclic_shift(id, x);
         return;
     }
     push_down(id);
     if(l <= mid)update(lson, l, r, x);
     if(r > mid)update(rson, l, r, x);
     push_up(id);
 }

 bitset<M> query(int id, int l, int r){
     if(l <= tree[id].l && tree[id].r <= r){
         return tree[id].value;
     }
     push_down(id);
     bitset<M> ans;
     if(l <= mid) ans |= query(lson, l, r);
     if(r > mid)ans |= query(rson, l, r);
     return ans;
 }

 int main()
 {
     //freopen("inputI.txt", "r", stdin);
     while(scanf("%d%d", &n, &m) != EOF){
         //由于循环移位会将1移除m的范围，所以每次只求[1,m)之间的素数。
         init_prime();
         for(int i = ; i <= n; i++)
             scanf("%d", &arr[i]);
         int u, v;
         init();
         for(int i = ; i < n; i++){
             scanf("%d%d", &u, &v);
             add_edge(u, v);
             add_edge(v, u);
         }
         idx = ;
         dfs(, );
         build(, , n);
         int q, t, x;
         scanf("%d", &q);
         while(q--){
             scanf("%d%d", &t, &v);
             if(t == ){
                 scanf("%d", &x);
                 update(, in[v], out[v], x%m);
             }else if(t == ){
                 bitset<M> ans = query(, in[v], out[v]);
                 printf("%d\n", (int)((ans&prime).count()));
             }
         }
     }

     return ;
 }