评测结果

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define int long long
#define all(x) x.begin(), x.end()
#define maxi(x) max_element(x.begin(), x.end()) - x.begin()
#define mini(x) min_element(x.begin(), x.end()) - x.begin()
const int maxn = 1e6 + 10;
vector<vector<int>> g;
int dep[maxn], sz[maxn], son[maxn], fa[maxn];
int dfn[maxn], nw[maxn], top[maxn], idx;
struct node
{
    int l, r;
    int add, sum;
} tr[maxn * 4];

void dfs1(int u, int father, int depth)
{
    dep[u] = depth, fa[u] = father, sz[u] = 1;
    for (auto v : g[u])
    {
        if (v == father)
            continue;
        dfs1(v, u, depth + 1);
        sz[u] += sz[v];
        if (sz[son[u]] < sz[v])
            son[u] = v;
    }
}

void dfs2(int u, int Top)
{
    dfn[u] = ++idx, nw[idx] = 0, top[u] = Top;
    if (!son[u])
        return;
    dfs2(son[u], Top);
    for (auto v : g[u])
    {
        if (v == fa[u] || v == son[u])
            continue;
        dfs2(v, v);
    }
}

void push_up(int u)
{
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}

void push_down(int u)
{
    node &root = tr[u], &lch = tr[u << 1], &rch = tr[u << 1 | 1];
    if (root.add)
    {
        lch.add += root.add, lch.sum += (lch.r - lch.l + 1) * root.add;
        rch.add += root.add, rch.sum += (rch.r - rch.l + 1) * root.add;
        root.add = 0;
    }
}

void build(int u, int l, int r)
{
    tr[u] = {l, r};
    if (l == r)
        tr[u].sum = nw[l];
    else
    {
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        push_up(u);
    }
}

void modify(int u, int l, int r, int k)
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        tr[u].add += k;
        tr[u].sum += (tr[u].r - tr[u].l + 1) * k;
    }
    else
    {
        push_down(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid)
            modify(u << 1, l, r, k);
        if (r > mid)
            modify(u << 1 | 1, l, r, k);
        push_up(u);
    }
}

int query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r)
        return tr[u].sum;
    push_down(u);
    int mid = tr[u].l + tr[u].r >> 1, res = 0;
    if (l <= mid)
        res += query(u << 1, l, r);
    if (r > mid)
        res += query(u << 1 | 1, l, r);
    return res;
}

void modify_path(int u, int v, int k)
{
    while (top[u] != top[v])
    {
        if (dep[top[u]] < dep[top[v]])
            swap(u, v);
        modify(1, dfn[top[u]], dfn[u], k);
        u = fa[top[u]];
    }
    if (dep[u] < dep[v])
        swap(u, v);
    modify(1, dfn[v], dfn[u], k);
}

void solve()
{
    int n, m;
    cin >> n;
    g.resize(n + 2);
    for (int i = 1; i <= n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u++, v++;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    dfs1(1, -1, 1);
    // cout << "helo" << endl;
    dfs2(1, 1);
    build(1, 1, n);
    cin >> m;
    while (m--)
    {
        string op;
        cin >> op;
        if (op == "A")
        {
            int u, v, d;
            cin >> u >> v >> d;
            u++, v++;
            modify_path(u, v, d);
        }
        if (op == "Q")
        {
            int u;
            cin >> u;
            u++;
            cout << query(1, dfn[u], dfn[u] + sz[u] - 1) << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}