题目链接:https://cn.vjudge.net/problem/HYSBZ-4034
题目大意
有一棵点数为 N 的树,以点 1 为根,且树点有边权。然后有 M 个
操作,分为三种:
操作 1 :把某个节点 x 的点权增加 a 。
操作 2 :把某个节点 x 为根的子树中所有点的点权都增加 a 。
操作 3 :询问某个节点 x 到根的路径中所有点的点权和。
分析
树链剖分后,节点x及其子树节点会在一段连续的区间内,用线段树维护区间和就可以了。注意如果是求根节点到根节点的,及1--1的,那么直接输出根节点的值就可以了,dfs2也要注意,当s==e的时候,tmp要加上根节点的值。
代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
int n, m, cnt, tot;
int fa[N], dep[N], size[N], son[N], top[N], in[N], out[N], num[N], head[2*N];
ll value[N];
struct Edge {
int to, nxt;
}edge[2*N];
struct node {
int l, r;
ll sum, lazy;
}tr[N<<2];
void add(int a, int b)
{
edge[cnt].to = b;
edge[cnt].nxt = head[a];
head[a] = cnt++;
}
void dfs1(int d, int f, int u) // d:深度,f:父节点,u:当前节点
{
size[u] = 1;
dep[u] = d;
fa[u] = f;
son[u] = 0;
for(int i = head[u]; i != -1; i = edge[i].nxt)
{
int j = edge[i].to;
if(j == f) continue;
dfs1(d + 1, u, j);
size[u] += size[j]; // size记录子树节点总数
if(size[son[u]] < size[j]) // 找出重儿子
son[u] = j;
}
}
void dfs2(int u, int tp) // u:当前节点,tp:链的顶端节点
{
top[u] = tp;
in[u] = ++tot;
num[tot] = u;
if(son[u]) dfs2(son[u], tp); // 重儿子优先
for(int i = head[u]; i != -1; i = edge[i].nxt)
{
int j = edge[i].to;
if(j == fa[u] || j == son[u]) continue;
dfs2(j, j);
}
out[u] = tot;
}
void pushup(int m)
{
tr[m].sum = tr[m<<1].sum + tr[m<<1|1].sum;
}
void pushdown(int m)
{
if(tr[m].lazy)
{
tr[m<<1].lazy += tr[m].lazy;
tr[m<<1|1].lazy += tr[m].lazy;
tr[m<<1].sum += (ll)(tr[m<<1].r - tr[m<<1].l + 1) * tr[m].lazy;
tr[m<<1|1].sum += (ll)(tr[m<<1|1].r - tr[m<<1|1].l + 1) * tr[m].lazy;
tr[m].lazy = 0;
}
}
void build(int m, int l, int r)
{
tr[m].l = l;
tr[m].r = r;
tr[m].lazy = 0;
if(l == r)
{
tr[m].sum = value[num[l]];
return ;
}
int mid = (l + r) >> 1;
build(m<<1, l, mid);
build(m<<1|1, mid + 1, r);
pushup(m);
}
void change(int m, int id, ll val)
{
if(tr[m].l == id && tr[m].r == id)
{
tr[m].sum += val;
return ;
}
pushdown(m);
int mid = (tr[m].l + tr[m].r) >> 1;
if(id <= mid) change(m<<1, id, val);
else change(m<<1|1, id, val);
pushup(m);
}
void updata(int m, int l, int r, ll val)
{
if(tr[m].l >= l && tr[m].r <= r)
{
tr[m].sum += (ll)(tr[m].r - tr[m].l + 1) * val;
tr[m].lazy += val;
return ;
}
pushdown(m);
int mid = (tr[m].l + tr[m].r) >> 1;
if(l <= mid) updata(m<<1, l, r, val);
if(r > mid) updata(m<<1|1, l, r, val);
pushup(m);
}
ll ask(int m, int l, int r)
{
if(tr[m].l >= l && tr[m].r <= r) return tr[m].sum;
pushdown(m);
ll res = 0;
int mid = (tr[m].l + tr[m].r) >> 1;
if(l <= mid) res += ask(m<<1, l, r);
if(r > mid) res += ask(m<<1|1, l, r);
return res;
}
ll find(int s, int e)
{
int fs = top[s];
int fe = top[e];
ll tmp = 0;
while(fs != fe)
{
if(dep[fs] < dep[fe])
{
swap(fs, fe);
swap(s, e);
}
tmp += ask(1, in[fs], in[s]);
s = fa[fs];
fs = top[s];
}
if(s == e) return tmp + ask(1, in[s], in[s]); // 当s==e时,说明现在s在根节点,要加上根节点的值
if(dep[s] > dep[e]) swap(s, e);
return tmp + ask(1, in[s], in[e]);
}
int main()
{
cnt = tot = 0;
memset(head, -1, sizeof head);
memset(size, 0, sizeof size);
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++)
scanf("%lld", &value[i]);
for(int i = 1; i < n; i++)
{
int a, b;
scanf("%d %d", &a, &b);
add(a, b);
add(b, a);
}
dfs1(1, 0, 1);
dfs2(1, 1);
build(1, 1, n);
while(m--)
{
int op, x;
ll w;
scanf("%d", &op);
if(op == 1)
{
scanf("%d %lld", &x, &w);
change(1, in[x], w);
}
else if(op == 2)
{
scanf("%d %lld", &x, &w);
updata(1, in[x], out[x], w);
}
else
{
scanf("%d", &x);
if(x == 1) // x==1时,直接输出根节点的值就可以了
printf("%lld\n", ask(1, in[x], in[x]));
else
printf("%lld\n", find(x, 1));
}
}
return 0;
}