fix

Author: lrvideckis

tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree.test.cpp renamed to tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp

@@ -16,27 +16,23 @@ int main() {
     adj[par].push_back(i);
     adj[i].push_back(par);
   }
-  HLD<0> hld_nodes(adj);
-  HLD<1> hld_edges(adj);
+  HLD<1> hld(adj);
   BIT bit(n);
-  for (int i = 0; i < n; i++)
-    bit.update(hld_nodes.tin[i], a[i]);
+  for (int i = 0; i < n; i++) bit.update(hld.tin[i], a[i]);
   while (q--) {
     int type;
     cin >> type;
     if (type == 0) {
       int v, x;
       cin >> v >> x;
-      bit.update(hld_nodes.tin[v], x);
+      bit.update(hld.tin[v], x);
       a[v] += x;
     } else {
       int v;
       cin >> v;
-      auto [l, r] = hld_nodes.subtree(v);
+      auto [l, r] = hld.subtree(v);
       ll res = bit.query(l, r);
-      auto [l_edges, r_edges] = hld_edges.subtree(v);
-      assert(res == bit.query(l_edges, r_edges) + a[v]);
-      cout << res << '\n';
+      cout << bit.query(l, r) + a[v] << '\n';
     }
   }
 }

tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp

@@ -0,0 +1,36 @@
+#define PROBLEM \
+  "https://judge.yosupo.jp/problem/vertex_add_subtree_sum"
+#include "../template.hpp"
+#include "../../../library/trees/hld.hpp"
+#include "../../../library/data_structures/bit.hpp"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, q;
+  cin >> n >> q;
+  vector<ll> a(n);
+  for (int i = 0; i < n; i++) cin >> a[i];
+  vector<vector<int>> adj(n);
+  for (int i = 1; i < n; i++) {
+    int par;
+    cin >> par;
+    adj[par].push_back(i);
+    adj[i].push_back(par);
+  }
+  HLD<0> hld(adj);
+  BIT bit(n);
+  for (int i = 0; i < n; i++) bit.update(hld.tin[i], a[i]);
+  while (q--) {
+    int type;
+    cin >> type;
+    if (type == 0) {
+      int v, x;
+      cin >> v >> x;
+      bit.update(hld.tin[v], x);
+    } else {
+      int v;
+      cin >> v;
+      auto [l, r] = hld.subtree(v);
+      cout << bit.query(l, r) << '\n';
+    }
+  }
+}