【LOJ】更为厉害 dfs建序 + 主席树

传送⻔

题意

分析

假设$a$是$b$的子树中的一点，那么答案为$min(k,dep[p]-1)\ast (sz[p]-1)$
假设$b$是$a$的子树中的一点，那么我们需要统计的是深度$dep[p]+1,dep[p]+k$这个区间内的答案，可以用主席树记录深度下标，因为要统计子树信息，所以可以考虑用$dfs$更新主席树

代码

#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 3e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],idx;
int sz[N],dep[N];
int in[N],out[N],cnt;
int n,q;
int root[N];

struct Node{
    int l,r;
    ll sum;
}tr[N * 80];

void add(int x,int y){
    ne[idx] =  h[x],e[idx] = y,h[x] = idx++;
}

void dfs(int u,int fa){
    in[u] = ++cnt,sz[u] = 1,dep[u] = dep[fa] + 1;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u);
        sz[u] += sz[j];
    }
    out[u] = cnt;
}

int build(int l,int r){
    int p = ++cnt;
    if(l == r) return p;
    int mid = (l + r) >> 1;
    tr[p].l = build(l,mid),tr[p].r= build(mid + 1,r);
    return p;
}

int insert(int p,int l,int r,int x,ll k){
    int q = ++cnt;
    tr[q] = tr[p];
    if(l == r){
        tr[q].sum += k;
        return q;
    }
    int mid = (l + r) >> 1;
    if(x <= mid) tr[q].l = insert(tr[p].l,l,mid,x,k);
    if(x > mid) tr[q].r = insert(tr[p].r,mid + 1,r,x,k);
    tr[q].sum = tr[tr[q].l].sum + tr[tr[q].r].sum;
    return q;
}


void dfs_(int u,int fa){
    root[in[u]] = insert(root[in[u] - 1],1,n,dep[u],sz[u] - 1);
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs_(j,u);
    }
}

ll query(int p,int q,int l,int r,int L,int R){
    if(l >= L && r <= R) return tr[p].sum - tr[q].sum;
    int mid = (l + r) >> 1;
    ll res = 0;
    if(L <= mid) res = query(tr[p].l,tr[q].l,l,mid,L,R);
    if(R > mid) res += query(tr[p].r,tr[q].r,mid + 1,r,L,R);
    return res;
}

int main() {
    memset(h,-1,sizeof h);
    read(n),read(q);
    for(int i = 1;i < n;i++){
        int x,y;
        read(x),read(y);
        add(x,y),add(y,x);
    }
    dfs(1,0);
    cnt = 0;
    root[0] = build(1,n);
    dfs_(1,0);
    while(q--){
        int p,k;
        read(p),read(k);
        ll ans = 1ll * min(k,dep[p] - 1) * (sz[p] - 1);
        ans += query(root[out[p]],root[in[p] - 1],1,n,dep[p] + 1,min(n,dep[p] + k));
        dl(ans);
    }   
    return 0;
}