cf384e Propagating tree

http://www.elijahqi.win/archives/1102
E.

Propagating tree
time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of the tree is node 1.

This tree has a special property: when a value val is added to a value of node i, the value -val is added to values of all the children of node i. Note that when you add value -val to a child of node i, you also add -(-val) to all children of the child of node i and so on. Look an example explanation to understand better how it works.

This tree supports two types of queries:

“1 x val” — val is added to the value of node x;
“2 x” — print the current value of node x.
In order to help Iahub understand the tree better, you must answer m queries of the preceding type.

Input
The first line contains two integers n and m (1 ≤ n, m ≤ 200000). The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 1000). Each of the next n–1 lines contains two integers vi and ui (1 ≤ vi, ui ≤ n), meaning that there is an edge between nodes vi and ui.

Each of the next m lines contains a query in the format described above. It is guaranteed that the following constraints hold for all queries: 1 ≤ x ≤ n, 1 ≤ val ≤ 1000.

Output
For each query of type two (print the value of node x) you must print the answer to the query on a separate line. The queries must be answered in the order given in the input.

Examples
Input
5 5
1 2 1 1 2
1 2
1 3
2 4
2 5
1 2 3
1 1 2
2 1
2 2
2 4
Output
3
3
0
Note
The values of the nodes are [1, 2, 1, 1, 2] at the beginning.

Then value 3 is added to node 2. It propagates and value -3 is added to it’s sons, node 4 and node 5. Then it cannot propagate any more. So the values of the nodes are [1, 5, 1,  - 2,  - 1].

Then value 2 is added to node 1. It propagates and value -2 is added to it’s sons, node 2 and node 3. From node 2 it propagates again, adding value 2 to it’s sons, node 4 and node 5. Node 3 has no sons, so it cannot propagate from there. The values of the nodes are [3, 3,  - 1, 0, 1].

You can see all the definitions about the tree at the following link: http://en.wikipedia.org/wiki/Tree_(graph_theory)

有点像树链剖分 构造深搜序然后在树上做

关于这个染色其实有一个妙招 就是在一棵树上染色即可 然后分奇偶 奇数+偶数-

然后统计答案的时候奇数1偶数-1 大概画画就可以知道这样是正确的了

否则的话应该建两棵线段树的

#include<cstdio>
#define N 220000
inline int read(){
    int x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=getchar();}
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
struct node{
    int y,next;
}data[N<<1];
struct node1{
    int l,r,left,right,lazy,sum;
}tree[N<<2];
int n,m,num,root,in[N],out[N],fa[N],a[N],dep[N],h[N];
void dfs1(int x){
    in[x]=++num;
    for (int i=h[x];i;i=data[i].next){
        int y=data[i].y;if (fa[x]==y) continue;
        fa[y]=x;dep[y]=dep[x]+1;dfs1(y);
    }
    out[x]=num;
}
void build(int &x,int l,int r){
    x=++num;tree[x].l=l;tree[x].r=r;
    if (l==r) return;
    int mid=l+r>>1;
    build(tree[x].left,l,mid);build(tree[x].right,mid+1,r);
}
inline void pushdown(int x){
    if (!tree[x].lazy) return;
    int l=tree[x].left,r=tree[x].right;
    tree[l].lazy+=tree[x].lazy;tree[r].lazy+=tree[x].lazy;
    tree[l].sum=tree[l].lazy;tree[r].sum=tree[r].lazy;
    tree[x].lazy=0;
} 
void change(int x,int l,int r,int v){
    if (l<=tree[x].l&&r>=tree[x].r){tree[x].lazy+=v;tree[x].sum+=v;return;}
    int mid=tree[x].l+tree[x].r>>1;pushdown(x);
    if (l<=mid) change(tree[x].left,l,r,v);
    if (r>mid) change(tree[x].right,l,r,v);
}
int query(int x,int l){
    if (tree[x].l==tree[x].r) return tree[x].sum;
    int mid=tree[x].l+tree[x].r>>1;pushdown(x);
    if (l<=mid) return query(tree[x].left,l);else return query(tree[x].right,l);
}
int main(){
    freopen("cf.in","r",stdin);
    n=read();m=read();
    for (int i=1;i<=n;++i) a[i]=read();
    for (int i=1;i<n;++i){
        int x=read(),y=read();
        data[++num].y=y;data[num].next=h[x];h[x]=num;
        data[++num].y=x;data[num].next=h[y];h[y]=num;
    }num=0;
    dfs1(1);num=0;build(root,1,n);
    for (int i=1;i<=m;++i){
        int op=read();
        if (op==1){
            int x=read(),z=read();
            change(root,in[x],out[x],dep[x]%2==0?-z:z);continue;
        }
        int x=read();
        printf("%d\n",a[x]+query(root,in[x])*(dep[x]%2==0?-1:1));
    }
    return 0;
}