2019徐州网络赛 F. Little M's attack plan(思维+树状数组+容斥）

题目大意：

给你一棵n个点的树，每个点有权值，m次查询，每次查询(v,k)，查询与结点v的距离小于等于k的结点的权值和。$n\le 1e6,m\le 5000,k\le 100$

解题思路：

感觉题解说的挺清楚了：

把原本的问题拆成k个问题后要容斥（画个图应该就明白了）。
然后可能会卡常，比较粗暴的写T了之后加了个快读1900+ms飘过去了。
ac代码：

#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) ((x)&(-(x)))
using namespace std;
int read_int(){
    int x = 0; char ch = getchar();
    while(ch < '0' || ch > '9') ch = getchar();
    while(ch >= '0' && ch <= '9') x = (x<<3) + (x<<1) + (ch ^ '0'), ch = getchar(); return x;
}
ll read_ll(){
    ll x = 0; char ch = getchar();
    while(ch < '0' || ch > '9') ch = getchar();
    while(ch >= '0' && ch <= '9') x = (x<<3) + (x<<1) + (ch ^ '0'), ch = getchar(); return x;
}
const int maxn = 1e6 + 105;
ll a[maxn], w[maxn]; int fa[maxn], dep[maxn];
void add(int i, ll x){
    while(i < maxn) a[i] += x, i += lowbit(i);
}
ll qry(int i){
    ll res = 0;
    while(i) res += a[i], i -= lowbit(i); return res;
}
vector<int> g[maxn];
void dfs1(int u, int f, int d){
    fa[u] = f; dep[u] = d; for(int i = 0; i < g[u].size(); ++i) if(g[u][i] != f) dfs1(g[u][i], u, d+1);
}
struct node{int op, id, k; node(int _op = 0, int _id = 0, int _k = 0):op(_op),id(_id),k(_k){}};
vector<node> ex[maxn];
int n, m;
ll ans[maxn];
void init()
{
    n = read_int();
    for(int i = 1; i <= n; ++i) w[i] = read_ll();
    for(int i = 1; i < n; ++i){
        int u, v;
        u = read_int(); v = read_int();
        g[u].push_back(v); g[v].push_back(u);
    }
    dfs1(1, 0, 1);
    scanf("%d", &m);
    for(int i = 0; i < m; ++i){
        int v, k;
        scanf("%d%d", &v, &k);
        ex[v].push_back(node(1, i, k));
        k--;
        while(k >= 0){
            if(fa[v] == 0) break;//到根了
            ex[fa[v]].push_back(node(1, i, k));
            if(k > 0) ex[v].push_back(node(-1, i, k-1));
            v = fa[v], k--;
        }
    }
}
void dfs(int u){
    //ll temp = qry(dep[u] - 1);//本来是想用这个优化一下常数,结果不用的时候AC，用了反而T了,求解释
    for(int i = 0; i < ex[u].size(); ++i){
        int id = ex[u][i].id, op = ex[u][i].op, k = ex[u][i].k;
        ans[id] -= op*(qry(dep[u]+k) - qry(dep[u]-1));
        //ans[id] -= op*(qry(dep[u]+k) - temp);
    }
    add(dep[u], w[u]);
    for(int i = 0; i < g[u].size(); ++i) {
        int v = g[u][i];
        if(v != fa[u]) dfs(v);
    }
    for(int i = 0; i < ex[u].size(); ++i){
        int id = ex[u][i].id, op = ex[u][i].op, k = ex[u][i].k;
        ans[id] += op*(qry(dep[u]+k) - qry(dep[u]-1));
        //ans[id] += op*(qry(dep[u]+k) - temp);
    }
}
void sol()
{
    dfs(1);
    for(int i = 0; i < m; ++i){
        printf("%lld\n", ans[i]);
    }
}
int main()
{
	init();sol();
}