CodeForces - 1076E Vasya and a Tree 树剖？nono dfs+树状数组

题目链接：https://cn.vjudge.net/problem/CodeForces-1076E

题解：树状数组维护下深度，到达每个节点，对于每次更新容斥一下，对于直接查询即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lowbit(x) (x & (-x))
const int N = 3e5 + 10;

struct edge {
	int to, nex;
}e[N * 2];
int head[N], len;
int n, m;
ll dep[N], ans[N];
vector<pair<int, int> > v[N];
void Addedge(int x, int y) {
	e[len].to = y;
	e[len].nex = head[x];
	head[x] = len++;
}
void update(int pos, ll val) {
	while(pos < N) {
		dep[pos] += val;
		pos += lowbit(pos);
	}
}
ll query(int x) {
	ll res = 0;
	while(x) {
		res += dep[x];
		x -= lowbit(x);
	}
	return res;
}
void dfs(int u, int fa, int deep) {
	for(int i = 0; i < v[u].size(); i++) {
		update(deep, v[u][i].second);
		update(deep + v[u][i].first + 1, -v[u][i].second);
	}
	ans[u] = query(deep);
	int to;
	for(int i = head[u]; i != -1; i = e[i].nex) {
		to = e[i].to;
		if(to == fa) continue;
		dfs(to, u, deep + 1);
	}
	for(int i = 0; i < v[u].size(); i++) {
		update(deep, -v[u][i].second);
		update(deep + v[u][i].first + 1, v[u][i].second);
	}
}
int main() {
	memset(head, -1, sizeof(head));
	int x, y, z;
	scanf("%d", &n);
	for(int i = 1; i < n; i++) {
		scanf("%d %d", &x, &y);
		Addedge(x, y);
		Addedge(y, x);
	}
	scanf("%d", &m);
	for(int i = 1; i <= m; i++) {
		scanf("%d %d %d", &x, &y, &z);
		v[x].push_back(make_pair(y, z));
	}
	dfs(1, 0, 1);
	for(int i = 1; i <= n; i++)
		printf("%lld%c", ans[i], " \n"[i == n]);
	return 0;
}