CodeForces 383C :Propagating tree 树状树组 + 差分

传送门

题意

分析

这道题很巧妙啊
首先因为要对整个子树做操作，所以很容易想到可能会跟$dfs$序有关
但是仔细看一下，这里的$modify$又跟节点深度奇偶有关，怎么处理呢
我们维护两个树状数组，一个表示深度为奇，一个表示偶，这样，我们在进行$modify$操作的时候，只需要对对应奇偶的树状数组进行查分操作即可，在查询中，减去奇偶属性相反的和即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int tr[2][N];
int h[N],ne[M],e[M],idx;
int a[N];
int n,m;
int in[N],out[N],st[N],cnt;

int lowbit(int x){
    return x & -x;
}

void add(int x,int y){
    ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void add(int x,int p,int c){
    for(int i = x;i < n;i += lowbit(i)) tr[p][i] += c;
}

int sum(int x,int p){
    int res = 0;
    for(int i = x;i;i -= lowbit(i)) res += tr[p][i];
    return res;
}

void dfs(int u,int fa,int t){
    in[u] = ++cnt;
    st[u] = t;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u,t ^ 1);
    }
    out[u] = cnt;
}

int main() {
	read(n),read(m);
    memset(h,-1,sizeof h);
    for(int i = 1;i <= n;i++) read(a[i]);
    for(int i = 1;i < n;i++){
        int x,y;
        read(x),read(y);
        add(x,y),add(y,x);
    }
    dfs(1,0,1);
    while(m--){
        int op;
        read(op);
        if(op ==1){
            int x,val;
            read(x),read(val);
            add(in[x],st[x],val);
            add(out[x] + 1,st[x],-val);
        }
        else{
            int x;
            read(x);
            di(a[x] + sum(in[x],st[x]) - sum(in[x],st[x] ^ 1));
        }
    }
    return 0;
}