E - 树上操作 黑暗爆炸 - 4034（欧拉 序+线段树区间和）

题意

有一棵点数为 N 的树，以点 1 为根，且树点有边权。然后有 M 个
操作，分为三种：
操作 1 ：把某个节点 x 的点权增加 a 。
操作 2 ：把某个节点 x 为根的子树中所有点的点权都增加 a 。
操作 3 ：询问某个节点 x 到根的路径中所有点的点权和。

思路

代码

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <vector>
using namespace std;
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {     
#ifdef ACM  //宏定义免注释 freopen
    if (! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) sc("%lld", &a)
#define ss(a) sc("%s", a)
#define __  pr( "------------------------\n" );
#define ___ pr("\n------------------------\n");
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
/*=========================ACMer===========================*/
const ll mxn = 200005;
ll w[mxn];
vector<ll> e[mxn];
ll tot;
Pir idx[mxn << 1];
Pir pos[mxn << 1];

struct Tree
{
    ll l, r;
    ll up, dn;
    ll sum, lazy;
} tree[mxn << 2];

void dfs(ll u, ll p)
{
    idx[u].fi = ++ tot;
    pos[tot].fi = u;
    pos[tot].se = 1;

    for_(i, 0, e[u].size() - 1)
    {
        ll v = e[u][i];
        if(v == p) continue;
        dfs(v, u);
    }

    idx[u].se = ++ tot;
    pos[tot].fi = u;
    pos[tot].se = -1;
}

void push_up(ll rt)
{
    tree[rt].sum = tree[rt << 1].sum + tree[rt << 1 | 1].sum;
}

void push_dn(ll rt)
{
    if(tree[rt].lazy)
    {
        tree[rt << 1].lazy += tree[rt].lazy;
        tree[rt << 1 | 1].lazy += tree[rt].lazy;
        tree[rt << 1].sum += (tree[rt << 1].up - tree[rt << 1].dn) * tree[rt].lazy;
        tree[rt << 1 | 1].sum += (tree[rt << 1 | 1].up - tree[rt << 1 | 1].dn) * tree[rt].lazy;
        tree[rt].lazy = 0;
    }
}

void build(ll rt, ll l, ll r)
{
    tree[rt].l = l, tree[rt].r = r;
    tree[rt].up = tree[rt].dn = 0;
    tree[rt].sum = tree[rt].lazy = 0;
    if(l == r)
    {
        if(pos[l].se == 1)
        {
            tree[rt].sum = w[pos[l].fi];
            tree[rt].up ++;
        }
        else
        {
            tree[rt].sum = -w[pos[l].fi];
            tree[rt].dn ++;
        }
        return;
    }
    ll md = (l + r) >> 1;
    build(rt << 1, l, md);
    build(rt << 1 | 1, md + 1, r);
    push_up(rt);
    tree[rt].up = tree[rt << 1].up + tree[rt << 1 | 1].up;
    tree[rt].dn = tree[rt << 1].dn + tree[rt << 1 | 1].dn;
}

void update(ll rt, ll l, ll r, ll k)
{
    if(tree[rt].l > r || tree[rt].r < l) return;
    if(tree[rt].l >= l && tree[rt].r <= r) 
    {
        tree[rt].sum += (tree[rt].up - tree[rt].dn) * k;
        tree[rt].lazy += k;
        return;
    }

    push_dn(rt);
    update(rt << 1, l, r, k);
    update(rt << 1 | 1, l, r, k);
    push_up(rt);
}
ll query(ll rt, ll l, ll r)
{
    if(tree[rt].l > r || tree[rt].r < l) return 0;
    if(tree[rt].l >= l && tree[rt].r <= r) 
    {
        return tree[rt].sum;
    }
    push_dn(rt);
    return query(rt << 1, l, r) + query(rt << 1 | 1, l, r);
}

int main()
{
    Run();
    ll n, m, u, v;
    sc("%lld %lld", &n, &m);
    for_(i, 1, n) sd(w[i]);
    for_(i, 1, n - 1)
    {
        sc("%lld %lld", &u, &v);
        e[u].pb(v);
        e[v].pb(u);
    }

    dfs(1, -1);
    build(1, 1, 2 * n);

    ll op, x, y;
    while(m --)
    {
        sd(op);
        if(op == 1)
        {
            sc("%lld %lld", &x, &y);
            update(1, idx[x].fi, idx[x].fi, y);
            update(1, idx[x].se, idx[x].se, y);
        }
        else if(op == 2)
        {
            sc("%lld %lld", &x, &y);
            update(1, idx[x].fi, idx[x].se, y);
        }
        else
        {
            sd(x);
            pr("%lld\n", query(1, 1, idx[x].fi));
        }

    }

    return 0;
}