'commit'

TangDou/Topic/HuanGenDp/P3047.cpp

@@ -3,7 +3,6 @@ using namespace std;
 #define int long long
 #define endl "\n"
 
-int n, q;
 const int N = 200010, M = N << 1, K = 21;
 
 // 链式前向星
@@ -11,6 +10,8 @@ int e[M], h[N], idx, w[M], ne[M];
 void add(int a, int b, int c = 0) {
     e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
 }
+
+int n, q;
 int dp[N][K];
 
 void dfs1(int u, int fa) {
@@ -18,8 +19,7 @@ void dfs1(int u, int fa) {
         int v = e[i];
         if (v == fa) continue;
         dfs1(v, u);
-        for (int j = 1; j <= q; j++)
-            dp[u][j] += dp[v][j - 1]; // 第一遍dp
+        for (int j = 1; j <= q; j++) dp[u][j] += dp[v][j - 1]; // 第一遍dp
     }
 }
 
@@ -55,6 +55,6 @@ signed main() {
     for (int i = 1; i <= n; i++) {
         int ans = 0;
         for (int j = 0; j <= q; j++) ans += dp[i][j]; // ans统计答案
-        printf("%lld\n", ans);
+        cout << ans << endl;
     }
 }