CodeForces 791D :Distance in Tree 树形DP

传送门

题意

分析

树上统计问题
考虑到$k$比较小，我们可以维护$num[u][i]$数组表示以$u$为跟节点的子树中，到$u$点距离模$k$为$i$的点有这么多，那么状态转移方程就是
$f[u]=f[u]+f[j]+1+num[j][0]$
应该比较好理解，因为如果模不为0，说明还能继续走一步，否则就得再走一步，多出来的1是从子节点字节走到$u$节点的
然后二次扫描换一下根就好了

代码

#pragma GCC optimize(3)
#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 = 2e5 + 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;
ll num[N][10],f[N];
int n,m;

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

void dfs(int u,int fa){
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u);
        for(int x = 0;x <= m;x++)
            num[u][x] += num[j][(x - 1 + m) % m];
        num[u][1 % m]++;
        f[u] = f[u] + f[j] + 1 + num[j][0];
    }
}

void dfs_(int u,int fa){
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        for(int x = 0;x <= m;x++)
            num[u][x] -= num[j][(x - 1 + m) % m];
        num[u][1 % m]--;
        f[j] = f[j] + (f[u] - f[j] - 1 - num[j][0]) + 1 + num[u][0];
        for(int x = 0;x <= m;x++)
            num[j][x] += num[u][(x - 1 + m) % m];
        num[j][1 % m]++;
        dfs_(j,u);
        num[j][1 % m]--;
        for(int x = 0;x <= m;x++)
            num[j][x] -= num[u][(x - 1 + m) % m];
        num[u][1 % m]++;
        for(int x = 0;x <= m;x++)
            num[u][x] += num[j][(x - 1 + m) % m];
    }
}

int main() {
    read(n),read(m);
    memset(h,-1,sizeof h);
    for(int i = 1;i < n;i++){
        int x,y;
        read(x),read(y);
        add(x,y),add(y,x);
    }
    dfs(1,0);
    dfs_(1,0);
    ll ans = 0;
    for(int i = 1;i <= n;i++) ans += f[i];
    dl(ans / 2);
    return 0;
}