From 2971a83e2ffaf5a82b203fa80c53f1e60771861d Mon Sep 17 00:00:00 2001
From: Baoshuo <i@baoshuo.ren>
Date: Sat, 11 Jun 2022 09:26:11 +0800
Subject: [PATCH] P3047 [USACO12FEB]Nearby Cows G

https://www.luogu.com.cn/record/77212247
---
 Luogu/P3047/P3047.cpp | 78 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 78 insertions(+)
 create mode 100644 Luogu/P3047/P3047.cpp

diff --git a/Luogu/P3047/P3047.cpp b/Luogu/P3047/P3047.cpp
new file mode 100644
index 00000000..c0ca128f
--- /dev/null
+++ b/Luogu/P3047/P3047.cpp
@@ -0,0 +1,78 @@
+#include <iostream>
+#include <array>
+#include <vector>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+const int N = 100005;
+
+int n, k, fa[N];
+std::vector<int> g[N];
+std::array<int[25], N> f1, f2;
+
+void dfs1(int u) {
+    for (int v : g[u]) {
+        if (v == fa[u]) continue;
+
+        fa[v] = u;
+        dfs1(v);
+
+        for (int i = 1; i <= k; i++) {
+            f1[u][i] += f1[v][i - 1];
+        }
+    }
+}
+
+void dfs2(int u) {
+    for (int v : g[u]) {
+        if (v != fa[u]) dfs2(v);
+    }
+
+    for (int i = 1; i <= k; i++) {
+        int cnt = 0, t = u;
+
+        while (++cnt < i && fa[t]) {
+            f1[u][i] += (f2[fa[t]][i - cnt] - f2[t][i - cnt - 1]);
+            t = fa[t];
+        }
+        if (fa[t]) f1[u][i] += f2[fa[t]][0];
+    }
+}
+
+int main() {
+    std::ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    cin >> n >> k;
+
+    for (int i = 1, u, v; i < n; i++) {
+        cin >> u >> v;
+
+        g[u].push_back(v);
+        g[v].push_back(u);
+    }
+
+    for (int i = 1, x; i <= n; i++) {
+        cin >> x;
+
+        f1[i][0] = x;
+    }
+
+    dfs1(1);
+    f2 = f1;
+    dfs2(1);
+
+    for (int i = 1; i <= n; i++) {
+        int res = 0;
+
+        for (int j = 0; j <= k; j++) {
+            res += f1[i][j];
+        }
+
+        cout << res << endl;
+    }
+
+    return 0;
+}