/tmp/solutions/build/vertex_add_path_sum-slow.cpp:
    1|       |#include <common.h>
    2|       |#include <toy/bit.h>
    3|       |prelude;
    4|       |
    5|       |namespace {
    6|       |
    7|       |constexpr int N = 5e5;
    8|       |
    9|       |int head[N];
   10|       |struct {
   11|       |  int to;
   12|       |  int next;
   13|       |} edge[N * 2];
   14|       |int p[N];
   15|       |int l[N];
   16|       |int r[N];
   17|       |int a[N];
   18|       |u64 b[N + 1];
   19|       |u64 c[N + 2];
   20|       |int id;
   21|       |
   22|   500k|void dfs(int u, int w) {
   23|   500k|  p[u] = w;
   24|   500k|  l[u] = ++id;
   25|   500k|  c[id] += b[id] = a[u];
   26|  1.49M|  for (int e = head[u]; e; e = edge[e].next) {
                                         ^999k
  ------------------
  |  Branch (26:25): [True: 66.67%, False: 33.33%]
  ------------------
   27|   999k|    int v = edge[e].to;
   28|   999k|    if (v != w) {
  ------------------
  |  Branch (28:9): [True: 50.00%, False: 50.00%]
  ------------------
   29|   499k|      dfs(v, u);
   30|   499k|    }
   31|   999k|  }
   32|   500k|  c[r[u] = id + 1] -= a[u];
   33|   500k|}
   34|       |
   35|       |} // namespace
   36|       |
   37|      1|int main() {
   38|      1|  rd rd;
   39|      1|  wt wt;
   40|      1|  int n = rd.uh();
   41|      1|  int q = rd.uh();
   42|      1|#ifdef LOCAL
   43|      1|  id = 0;
   44|      1|  std::memset(head, 0, 4 * n);
   45|      1|  std::memset(c, 0, 8 * n + 16);
   46|      1|#endif
   47|   500k|  for (int i = 0; i < n; ++i) a[i] = rd.uw();
                                       ^500k^500k
  ------------------
  |  Branch (47:19): [True: 100.00%, False: 0.00%]
  ------------------
   48|   500k|  for (int i = 1; i < n; ++i) {
                                       ^499k
  ------------------
  |  Branch (48:19): [True: 100.00%, False: 0.00%]
  ------------------
   49|   499k|    int u = rd.uh();
   50|   499k|    int v = rd.uh();
   51|   499k|    edge[i * 2 | 0] = {v, head[u]}, head[u] = i * 2 | 0;
   52|   499k|    edge[i * 2 | 1] = {u, head[v]}, head[v] = i * 2 | 1;
   53|   499k|  }
   54|      1|  dfs(0, -1);
   55|      1|  u64 sum = 0;
   56|   500k|  for (int i = 1; i <= n; ++i) c[i] = sum += c[i];
                                        ^500k^500k
  ------------------
  |  Branch (56:19): [True: 100.00%, False: 0.00%]
  ------------------
   57|   500k|  for (int i = n; i >= 1; --i) c[i] -= c[i - (i & -i)];
                                        ^500k^500k
  ------------------
  |  Branch (57:19): [True: 100.00%, False: 0.00%]
  ------------------
   58|      1|  int val[n + 1];
   59|   500k|  for (int i = 1; i < n; ++i) val[l[i]] = l[p[i]];
                                       ^499k^499k
  ------------------
  |  Branch (59:19): [True: 100.00%, False: 0.00%]
  ------------------
   60|      1|  ++n;
   61|      1|  int m = n / 64 + 1;
   62|      1|  int len = log(m) + 1;
   63|      1|  int table[len][m];
   64|      1|  int suf[n];
   65|      1|  int pre[n];
   66|   500k|  for (int min, i = 0; i < n; ++i) {
                                            ^500k
  ------------------
  |  Branch (66:24): [True: 100.00%, False: 0.00%]
  ------------------
   67|   500k|    int id = i & 63;
   68|   500k|    int value = pre[i] = val[i];
   69|   500k|    suf[i] = min = id ? std::min(min, value) : value;
                                      ^492k                  ^7.81k
  ------------------
  |  Branch (69:20): [True: 98.44%, False: 1.56%]
  ------------------
   70|   500k|    if (id == 63) table[0][i / 64] = suf[i];
                                ^7.81k
  ------------------
  |  Branch (70:9): [True: 1.56%, False: 98.44%]
  ------------------
   71|   500k|  }
   72|   500k|  for (int min, i = n - 2; i >= 0; --i) {
                                                 ^500k
  ------------------
  |  Branch (72:28): [True: 100.00%, False: 0.00%]
  ------------------
   73|   500k|    int id = ~i & 63;
   74|   500k|    int value = pre[i];
   75|   500k|    pre[i] = min = id ? std::min(min, value) : value;
                                      ^492k                  ^7.81k
  ------------------
  |  Branch (75:20): [True: 98.44%, False: 1.56%]
  ------------------
   76|   500k|  }
   77|     13|  for (int i = 1; i < len; ++i) {
                                         ^12
  ------------------
  |  Branch (77:19): [True: 92.31%, False: 7.69%]
  ------------------
   78|  89.6k|    for (int j = 0, k = 1 << (i - 1); k < m; ++j, ++k) {
                                                           ^89.6k
  ------------------
  |  Branch (78:39): [True: 99.99%, False: 0.01%]
  ------------------
   79|  89.6k|      table[i][j] = std::min(table[i - 1][j], table[i - 1][k]);
   80|  89.6k|    }
   81|     12|  }
   82|   500k|  while (q--) {
  ------------------
  |  Branch (82:10): [True: 100.00%, False: 0.00%]
  ------------------
   83|   500k|    let t = rd.u1();
   84|   500k|    if (t == 0) {
  ------------------
  |  Branch (84:9): [True: 49.98%, False: 50.02%]
  ------------------
   85|   249k|      int k = rd.uh();
   86|   249k|      int x = rd.uw();
   87|   249k|      int u = l[k];
   88|   249k|      int v = r[k];
   89|   249k|      b[u] += x;
   90|  2.64M|      for (; u <= n; u += u & -u) c[u] += x;
                                   ^2.39M       ^2.39M
  ------------------
  |  Branch (90:14): [True: 90.57%, False: 9.43%]
  ------------------
   91|  1.50M|      for (; v <= n; v += v & -v) c[v] -= x;
                                   ^1.25M       ^1.25M
  ------------------
  |  Branch (91:14): [True: 83.39%, False: 16.61%]
  ------------------
   92|   249k|    }
   93|   500k|    if (t == 1) {
  ------------------
  |  Branch (93:9): [True: 50.02%, False: 49.98%]
  ------------------
   94|   250k|      int u = l[rd.uh()];
   95|   250k|      int v = l[rd.uh()];
   96|   250k|      if (u == v) {
  ------------------
  |  Branch (96:11): [True: 0.00%, False: 100.00%]
  ------------------
   97|      0|        wt.ud(b[u]);
   98|      0|        continue;
   99|      0|      }
  100|   250k|      int l = std::min(u, v) + 1;
  101|   250k|      int r = std::max(u, v);
  102|   250k|      int L = l / 64;
  103|   250k|      int R = r / 64;
  104|   250k|      int w;
  105|   250k|      if (L < R - 1) {
  ------------------
  |  Branch (105:11): [True: 99.97%, False: 0.03%]
  ------------------
  106|   250k|        int p = pre[l];
  107|   250k|        int s = suf[r];
  108|   250k|        w = std::min(p, s);
  109|   250k|        int k = log(R - L - 1);
  110|   250k|        int a = table[k][L + 1];
  111|   250k|        int b = table[k][R - (1 << k)];
  112|   250k|        int tmp = std::min(a, b);
  113|   250k|        w = std::min(w, tmp);
  114|   250k|      } else if (L == R - 1) {
                           ^85 ^85
  ------------------
  |  Branch (114:18): [True: 70.59%, False: 29.41%]
  ------------------
  115|     60|        int p = pre[l];
  116|     60|        int s = suf[r];
  117|     60|        w = std::min(p, s);
  118|     60|      } else {
  119|     25|        w = val[l];
  120|    404|        for (int i = l + 1; i <= r; ++i) w = std::min(w, val[i]);
                                                  ^379 ^379
  ------------------
  |  Branch (120:29): [True: 93.81%, False: 6.19%]
  ------------------
  121|     25|      }
  122|   250k|      u64 sum = b[w];
  123|   250k|      --l;
  124|  2.49M|      for (; l; l -= l & -l) sum += c[l];
                              ^2.24M       ^2.24M
  ------------------
  |  Branch (124:14): [True: 89.96%, False: 10.04%]
  ------------------
  125|  2.70M|      for (; r; r -= r & -r) sum += c[r];
                              ^2.45M       ^2.45M
  ------------------
  |  Branch (125:14): [True: 90.76%, False: 9.24%]
  ------------------
  126|  1.56M|      for (; w; w -= w & -w) sum -= c[w] * 2;
                              ^1.31M       ^1.31M
  ------------------
  |  Branch (126:14): [True: 84.06%, False: 15.94%]
  ------------------
  127|   250k|      wt.ud(sum);
  128|   250k|    }
  129|   500k|  }
  130|      1|  return 0;
  131|      1|}