树上操作 HYSBZ - 4034 树链剖分

 和去年新生赛类似的题

 

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<cstring>
#include<set>
#include<iterator>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<iomanip>
//#include<unordered_set>
using namespace std;
#define lowbit(x) x&(-x)
typedef long long ll;
typedef pair<int, int> P;
const int N = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
vector<int> g[N];
int deep[N], num[N], p[N], fp[N], son[N], fa[N], top[N];
int pos = 0;
int a[N];
struct Segmenttree
{
	int l, r;
	ll val, flag;
}t[N << 2];
void pushup(int p)
{
	t[p].val = t[p << 1].val + t[p << 1 | 1].val;
}
void build(int root, int l, int r)
{
	t[root].l = l, t[root].r = r;
	if (l == r)
	{
		t[root].val = a[fp[l]];
		return;
	}
	int mid = (l + r) >> 1;
	build(root << 1, l, mid);
	build(root << 1 | 1, mid + 1, r);
	pushup(root);
}
void pushdown(int p)
{
	if (t[p].flag)
	{
		t[p << 1].val += (t[p << 1].r - t[p << 1].l + 1)*t[p].flag;
		t[p << 1].flag += t[p].flag;
		t[p << 1 | 1].val += (t[p << 1 | 1].r - t[p << 1 | 1].l + 1)*t[p].flag;
		t[p << 1 | 1].flag += t[p].flag;
		t[p].flag = 0;
	}
}
void change(int p, int l, int r, int d)
{
	if (l <= t[p].l&&r >= t[p].r)
	{
		t[p].val += (ll)d*(t[p].r - t[p].l + 1);
		t[p].flag += d;
		return;
	}
	pushdown(p);
	int mid = (t[p].l + t[p].r) >> 1;
	if (l <= mid)
		change(p << 1, l, r, d);
	if (r > mid)
		change(p << 1 | 1, l, r, d);
	pushup(p);
}
ll ask(int p, int l, int r)
{
	if (l <= t[p].l&&t[p].r <= r)
	{
		return t[p].val;
	}
	pushdown(p);
	int mid = (t[p].l + t[p].r) >> 1;
	ll val = 0;
	if (l <= mid)
		val += ask(p << 1, l, r);
	if (r > mid)
		val += ask(p << 1 | 1, l, r);
	return val;
}
void dfs(int x, int pre,int d)
{
	deep[x] = d;
	fa[x] = pre;
	num[x] = 1;
	for (int i = 0; i < g[x].size(); i++)
	{
		if (g[x][i] == pre)
			continue;
		dfs(g[x][i], x, d + 1);
		num[x] += num[g[x][i]];
		if (!son[x] || num[g[x][i]] > num[son[x]])
		{
			son[x] = g[x][i];
		}
	}
}
void getpos(int u, int sp)
{
	top[u] = sp;
	p[u] = ++pos;
	fp[p[u]] = u;
	if (!son[u])
		return;
	getpos(son[u], sp);
	for (int i = 0; i < g[u].size(); i++)
	{
		if (g[u][i] != son[u] && g[u][i] != fa[u])
		{
			getpos(g[u][i], g[u][i]);
		}
	}
}
int n, m;
ll query(int u, int v)
{
	int f1 = top[u], f2 = top[v];
	ll ans = 0;
	while (f1 != f2)
	{
		if (deep[f1] < deep[f2])
		{
			swap(f1, f2);
			swap(u, v);
		}
		ans += ask(1, p[f1], p[u]);
		u = fa[f1];
		f1 = top[u];
	}
	if (deep[u] > deep[v])
		swap(u, v);
	ans += ask(1, p[u], p[v]);
	return ans;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	int u, v;
	for (int i = 1; i < n; i++)
	{
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1, 0, 0);
	getpos(1, 1);
	build(1, 1, n);
	while (m--)
	{
		int q, x;
		cin >> q >> x;
		if (q == 1)
		{
			int val;
			cin >> val;
			change(1, p[x], p[x], val);
		}
		else if (q == 2)
		{
			int val;
			cin >> val;
			change(1, p[x], p[x] + num[x] - 1, val);
		}
		else
		{
			cout << query(1, x) << endl;
		}
	}
	return 0;
}