more golf!!!!!!!

Author: lrvideckis

library/trees/centroid_decomp.hpp

@@ -6,7 +6,7 @@
 //! @time O(n log n)
 //! @space O(n)
 vi cd(auto& g, auto f) {
-  vi p(sz(g), -1), siz(p);
+  vi p(sz(g), -1), siz(sz(g), sz(g));
   auto ctd = [&](auto ctd, int u, int p, int n) -> int {
     siz[u] = 1;
     for (int v : g[u])
@@ -16,10 +16,10 @@ vi cd(auto& g, auto f) {
       }
     return 2 * siz[u] >= n ? siz[p] = n - siz[u], u : -1;
   };
-  auto dfs = [&](auto dfs, int u, int n) -> int {
-    f(u = ctd(ctd, u, u, n));
-    for (int v : g[u]) erase(g[v], u), p[dfs(dfs, v, siz[v])] = u;
+  auto dfs = [&](auto dfs, int u) -> int {
+    f(u = ctd(ctd, u, u, siz[u]));
+    for (int v : g[u]) erase(g[v], u), p[dfs(dfs, v)] = u;
     return u;
   };
-  return dfs(dfs, 0, sz(g)), p;
+  return dfs(dfs, 0), p;
 }

tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp

@@ -17,7 +17,7 @@
 //! which are all O(n)
 vector<ll> count_paths_per_node(vector<vi> adj, int k) {
   vector<ll> num_paths(sz(adj));
-  centroid(adj, [&](int cent, int) {
+  cd(adj, [&](int cent) {
     vector pre_d{1}, cur_d{0};
     auto dfs = [&](auto&& self, int u, int p,
                  int d) -> ll {