/tmp/solutions/build/vertex_add_path_sum-main.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|       |
   21|       |} // namespace
   22|       |
   23|      1|int main() {
   24|      1|  rd rd;
   25|      1|  wt wt;
   26|      1|  int n = rd.uh();
   27|      1|  int q = rd.uh();
   28|      1|#ifdef LOCAL
   29|      1|  std::memset(head, 0, 4 * n);
   30|      1|  std::memset(c, 0, 8 * n + 16);
   31|      1|#endif
   32|   499k|  for (int i = 0; i < n; ++i) a[i] = rd.uw();
                                       ^499k^499k
  ------------------
  |  Branch (32:19): [True: 100.00%, False: 0.00%]
  ------------------
   33|   499k|  for (int i = 1; i < n; ++i) {
                                       ^499k
  ------------------
  |  Branch (33:19): [True: 100.00%, False: 0.00%]
  ------------------
   34|   499k|    int u = rd.uh();
   35|   499k|    int v = rd.uh();
   36|   499k|    edge[i * 2 | 0] = {v, head[u]}, head[u] = i * 2 | 0;
   37|   499k|    edge[i * 2 | 1] = {u, head[v]}, head[v] = i * 2 | 1;
   38|   499k|  }
   39|      1|  p[0] = -1, l[0] = 1, b[1] = c[1] = a[0];
   40|  1.49M|  for (int u = 0, i = 1; u >= 0;) {
  ------------------
  |  Branch (40:26): [True: 100.00%, False: 0.00%]
  ------------------
   41|  1.49M|    if (int e = head[u]; e) {
  ------------------
  |  Branch (41:26): [True: 66.67%, False: 33.33%]
  ------------------
   42|   999k|      def[v, x] = edge[e];
   43|   999k|      head[u] = x;
   44|   999k|      if (v == p[u]) continue;
                                   ^499k
  ------------------
  |  Branch (44:11): [True: 50.00%, False: 50.00%]
  ------------------
   45|   499k|      p[v] = u;
   46|   499k|      l[v] = ++i;
   47|   499k|      c[i] += b[i] = a[v];
   48|   499k|      u = v;
   49|   499k|    } else {
   50|   499k|      c[r[u] = i + 1] -= a[u];
   51|   499k|      u = p[u];
   52|   499k|    }
   53|  1.49M|  }
   54|      1|  u64 sum = 0;
   55|   499k|  for (int i = 1; i <= n; ++i) c[i] = sum += c[i];
                                        ^499k^499k
  ------------------
  |  Branch (55:19): [True: 100.00%, False: 0.00%]
  ------------------
   56|   499k|  for (int i = n; i >= 1; --i) c[i] -= c[i - (i & -i)];
                                        ^499k^499k
  ------------------
  |  Branch (56:19): [True: 100.00%, False: 0.00%]
  ------------------
   57|      1|  int val[n + 1];
   58|   499k|  for (int i = 1; i < n; ++i) val[l[i]] = l[p[i]];
                                       ^499k^499k
  ------------------
  |  Branch (58:19): [True: 100.00%, False: 0.00%]
  ------------------
   59|      1|  ++n;
   60|      1|  int m = n / 64 + 1;
   61|      1|  int len = log(m) + 1;
   62|      1|  int table[len][m];
   63|      1|  int suf[n];
   64|      1|  int pre[n];
   65|   499k|  for (int min, i = 0; i < n; ++i) {
                                            ^499k
  ------------------
  |  Branch (65:24): [True: 100.00%, False: 0.00%]
  ------------------
   66|   499k|    int id = i & 63;
   67|   499k|    int value = pre[i] = val[i];
   68|   499k|    suf[i] = min = id ? std::min(min, value) : value;
                                      ^492k                  ^7.81k
  ------------------
  |  Branch (68:20): [True: 98.44%, False: 1.56%]
  ------------------
   69|   499k|    if (id == 63) table[0][i / 64] = suf[i];
                                ^7.81k
  ------------------
  |  Branch (69:9): [True: 1.56%, False: 98.44%]
  ------------------
   70|   499k|  }
   71|   499k|  for (int min, i = n - 2; i >= 0; --i) {
                                                 ^499k
  ------------------
  |  Branch (71:28): [True: 100.00%, False: 0.00%]
  ------------------
   72|   499k|    int id = ~i & 63;
   73|   499k|    int value = pre[i];
   74|   499k|    pre[i] = min = id ? std::min(min, value) : value;
                                      ^492k                  ^7.81k
  ------------------
  |  Branch (74:20): [True: 98.44%, False: 1.56%]
  ------------------
   75|   499k|  }
   76|     13|  for (int i = 1; i < len; ++i) {
                                         ^12
  ------------------
  |  Branch (76:19): [True: 92.31%, False: 7.69%]
  ------------------
   77|  89.6k|    for (int j = 0, k = 1 << (i - 1); k < m; ++j, ++k) {
                                                           ^89.6k
  ------------------
  |  Branch (77:39): [True: 99.99%, False: 0.01%]
  ------------------
   78|  89.6k|      table[i][j] = std::min(table[i - 1][j], table[i - 1][k]);
   79|  89.6k|    }
   80|     12|  }
   81|   500k|  while (q--) {
  ------------------
  |  Branch (81:10): [True: 100.00%, False: 0.00%]
  ------------------
   82|   500k|    let t = rd.u1();
   83|   500k|    if (t == 0) {
  ------------------
  |  Branch (83:9): [True: 0.00%, False: 100.00%]
  ------------------
   84|      0|      int k = rd.uh();
   85|      0|      int x = rd.uw();
   86|      0|      int u = l[k];
   87|      0|      int v = r[k];
   88|      0|      b[u] += x;
   89|      0|      for (; u <= n; u += u & -u) c[u] += x;
  ------------------
  |  Branch (89:14): [True: 0.00%, False: 0.00%]
  ------------------
   90|      0|      for (; v <= n; v += v & -v) c[v] -= x;
  ------------------
  |  Branch (90:14): [True: 0.00%, False: 0.00%]
  ------------------
   91|      0|    }
   92|   500k|    if (t == 1) {
  ------------------
  |  Branch (92:9): [True: 100.00%, False: 0.00%]
  ------------------
   93|   500k|      int u = l[rd.uh()];
   94|   500k|      int v = l[rd.uh()];
   95|   500k|      if (u == v) {
  ------------------
  |  Branch (95:11): [True: 0.00%, False: 100.00%]
  ------------------
   96|      0|        wt.ud(b[u]);
   97|      0|        continue;
   98|      0|      }
   99|   500k|      int l = std::min(u, v) + 1;
  100|   500k|      int r = std::max(u, v);
  101|   500k|      int L = l / 64;
  102|   500k|      int R = r / 64;
  103|   500k|      int w;
  104|   500k|      if (L < R - 1) {
  ------------------
  |  Branch (104:11): [True: 100.00%, False: 0.00%]
  ------------------
  105|   500k|        int p = pre[l];
  106|   500k|        int s = suf[r];
  107|   500k|        w = std::min(p, s);
  108|   500k|        int k = log(R - L - 1);
  109|   500k|        int a = table[k][L + 1];
  110|   500k|        int b = table[k][R - (1 << k)];
  111|   500k|        int tmp = std::min(a, b);
  112|   500k|        w = std::min(w, tmp);
  113|   500k|      } else if (L == R - 1) {
                           ^0  ^0
  ------------------
  |  Branch (113:18): [True: 0.00%, False: 0.00%]
  ------------------
  114|      0|        int p = pre[l];
  115|      0|        int s = suf[r];
  116|      0|        w = std::min(p, s);
  117|      0|      } else {
  118|      0|        w = val[l];
  119|      0|        for (int i = l + 1; i <= r; ++i) w = std::min(w, val[i]);
  ------------------
  |  Branch (119:29): [True: 0.00%, False: 0.00%]
  ------------------
  120|      0|      }
  121|   500k|      u64 sum = b[w];
  122|   500k|      --l;
  123|  1.00M|      for (; l; l -= l & -l) sum += c[l];
                              ^500k        ^500k
  ------------------
  |  Branch (123:14): [True: 50.00%, False: 50.00%]
  ------------------
  124|  4.50M|      for (; r; r -= r & -r) sum += c[r];
                              ^4.00M       ^4.00M
  ------------------
  |  Branch (124:14): [True: 88.89%, False: 11.11%]
  ------------------
  125|  1.00M|      for (; w; w -= w & -w) sum -= c[w] * 2;
                              ^500k        ^500k
  ------------------
  |  Branch (125:14): [True: 50.00%, False: 50.00%]
  ------------------
  126|   500k|      wt.ud(sum);
  127|   500k|    }
  128|   500k|  }
  129|      1|  return 0;
  130|      1|}