/tmp/solutions/build/vertex_set_path_composite-slow.cpp:
    1|       |#include <common.h>
    2|       |#include <toy/bit.h>
    3|       |prelude;
    4|       |
    5|       |namespace {
    6|       |
    7|       |constexpr int N = 2e5;
    8|       |constexpr int P = 998244353;
    9|       |
   10|       |struct Node {
   11|       |  u32 a, b, c;
   12|      9|  auto operator+(const Node &t) const -> Node {
   13|      9|    u32 x = u64(a) * t.a % P;
   14|      9|    u32 y = (u64(a) * t.b + b) % P;
   15|      9|    u32 z = (u64(t.a) * c + t.c) % P;
   16|      9|    return {x, y, z};
   17|      9|  }
   18|       |} node[N * 2];
   19|      8|auto operator+(const Node &l, u32 r) -> u32 { return (u64(l.a) * r + l.b) % P; }
   20|     10|auto operator+(u32 l, const Node &r) -> u32 { return (u64(r.a) * l + r.c) % P; }
   21|       |u32 a[N];
   22|       |u32 b[N];
   23|       |int head[N];
   24|       |int size[N];
   25|       |int depth[N];
   26|       |int heavy[N];
   27|       |int ances[N];
   28|       |int parent[N];
   29|       |int node2id[N];
   30|       |int id;
   31|       |struct {
   32|       |  int to;
   33|       |  int next;
   34|       |} edge[N * 2];
   35|       |
   36|      7|def build_step_1(int u, int p) -> void {
   37|      7|  size[u] = 1;
   38|     19|  for (int e = head[u]; e; e = edge[e].next) {
                                         ^12
  ------------------
  |  Branch (38:25): [True: 63.16%, False: 36.84%]
  ------------------
   39|     12|    int v = edge[e].to;
   40|     12|    if (v != p) {
  ------------------
  |  Branch (40:9): [True: 50.00%, False: 50.00%]
  ------------------
   41|      6|      build_step_1(v, u);
   42|      6|      size[u] += size[v];
   43|      6|      if (heavy[u] == 0 || size[v] > size[heavy[u]]) {
                                         ^2
  ------------------
  |  Branch (43:11): [True: 66.67%, False: 33.33%]
  |  Branch (43:28): [True: 0.00%, False: 100.00%]
  ------------------
   44|      4|        heavy[u] = v;
   45|      4|      }
   46|      6|    }
   47|     12|  }
   48|      7|}
   49|       |
   50|      7|def build_step_2(int u, int w, int p, int d) -> void {
   51|      7|  int i = id++;
   52|      7|  node2id[u] = i;
   53|      7|  node[i] = {a[u], b[u], b[u]};
   54|      7|  depth[i] = d;
   55|      7|  ances[i] = node2id[w];
   56|      7|  parent[i] = node2id[p];
   57|      7|  if (int v = heavy[u]; v) {
  ------------------
  |  Branch (57:25): [True: 57.14%, False: 42.86%]
  ------------------
   58|      4|    build_step_2(v, w, u, d + 1);
   59|      4|  }
   60|     19|  for (int e = head[u]; e; e = edge[e].next) {
                                         ^12
  ------------------
  |  Branch (60:25): [True: 63.16%, False: 36.84%]
  ------------------
   61|     12|    int v = edge[e].to;
   62|     12|    if (v != p && v != heavy[u]) {
                                ^6
  ------------------
  |  Branch (62:9): [True: 50.00%, False: 50.00%]
  |  Branch (62:19): [True: 33.33%, False: 66.67%]
  ------------------
   63|      2|      build_step_2(v, v, u, d + 1);
   64|      2|    }
   65|     12|  }
   66|      7|}
   67|       |
   68|       |} // namespace
   69|       |
   70|      1|int main() {
   71|      1|  rd rd;
   72|      1|  wt wt;
   73|      1|  int n = rd.uh();
   74|      1|  int q = rd.uh();
   75|      1|#ifdef LOCAL
   76|      1|  id = 0;
   77|      1|  std::memset(head, 0, 4 * n);
   78|      1|  std::memset(heavy, 0, 4 * n);
   79|      1|#endif
   80|      8|  for (int i = 0; i < n; ++i) a[i] = rd.uw(), b[i] = rd.uw();
                                       ^7   ^7
  ------------------
  |  Branch (80:19): [True: 87.50%, False: 12.50%]
  ------------------
   81|      7|  for (int i = 1; i < n; ++i) {
                                       ^6
  ------------------
  |  Branch (81:19): [True: 85.71%, False: 14.29%]
  ------------------
   82|      6|    int u = rd.uh();
   83|      6|    int v = rd.uh();
   84|      6|    edge[i * 2 | 0] = {v, head[u]}, head[u] = i * 2 | 0;
   85|      6|    edge[i * 2 | 1] = {u, head[v]}, head[v] = i * 2 | 1;
   86|      6|  }
   87|      1|  build_step_1(0, 0);
   88|      1|  build_step_2(0, 0, 0, 0);
   89|      1|  std::memcpy(node + n, node, sizeof(Node) * n);
   90|      7|  for (int i = n - 1; i > 0; --i) node[i] = node[i * 2] + node[i * 2 + 1];
                                           ^6   ^6
  ------------------
  |  Branch (90:23): [True: 85.71%, False: 14.29%]
  ------------------
   91|      6|  let apply_1 = [&](int l, int r, u32 x) -> u32 {
                ^1
   92|      6|    l += n - 1;
   93|      6|    r += n + 1;
   94|      6|    int k = log(l ^ r);
   95|      6|    int R = r >> k;
   96|     10|    for (r = r >> __builtin_ctz(r) ^ 1; r > R; r = r >> __builtin_ctz(r) ^ 1)
                                                             ^4
  ------------------
  |  Branch (96:41): [True: 40.00%, False: 60.00%]
  ------------------
   97|      4|      x = node[r] + x;
   98|     10|    for (int t = ~l & ~(-1 << k), i; t > 0; t -= 1 << i) {
                                                          ^4
  ------------------
  |  Branch (98:38): [True: 40.00%, False: 60.00%]
  ------------------
   99|      4|      i = log(t);
  100|      4|      x = node[l >> i ^ 1] + x;
  101|      4|    }
  102|      6|    return x;
  103|      6|  };
  104|      8|  let apply_2 = [&](int l, int r, u32 x) -> u32 {
                ^1
  105|      8|    l += n - 1;
  106|      8|    r += n + 1;
  107|      8|    int k = log(l ^ r);
  108|      8|    int R = r >> k;
  109|     14|    for (l = l >> __builtin_ctz(~l) ^ 1; l > R; l = l >> __builtin_ctz(~l) ^ 1)
                                                              ^6
  ------------------
  |  Branch (109:42): [True: 42.86%, False: 57.14%]
  ------------------
  110|      6|      x = x + node[l];
  111|     12|    for (int t = r & ~(-1 << k), i; t > 0; t -= 1 << i) {
                                                         ^4
  ------------------
  |  Branch (111:37): [True: 33.33%, False: 66.67%]
  ------------------
  112|      4|      i = log(t);
  113|      4|      x = x + node[r >> i ^ 1];
  114|      4|    }
  115|      8|    return x;
  116|      8|  };
  117|      8|  while (q--) {
  ------------------
  |  Branch (117:10): [True: 87.50%, False: 12.50%]
  ------------------
  118|      7|    let t = rd.u1();
  119|      7|    if (t == 0) {
  ------------------
  |  Branch (119:9): [True: 14.29%, False: 85.71%]
  ------------------
  120|      1|      int k = n + node2id[rd.uh()];
  121|      1|      u32 c = rd.uw();
  122|      1|      u32 d = rd.uw();
  123|      1|      node[k] = {c, d, d};
  124|      4|      for (k /= 2; k > 0; k /= 2) {
                                        ^3
  ------------------
  |  Branch (124:20): [True: 75.00%, False: 25.00%]
  ------------------
  125|      3|        node[k] = node[k * 2] + node[k * 2 + 1];
  126|      3|      }
  127|      1|    }
  128|      7|    if (t == 1) {
  ------------------
  |  Branch (128:9): [True: 85.71%, False: 14.29%]
  ------------------
  129|      6|      int u = node2id[rd.uh()];
  130|      6|      int v = node2id[rd.uh()];
  131|      6|      u32 x = rd.uw();
  132|      6|      std::pair<int, int> vec[20];
  133|      6|      int c = 0;
  134|     14|      while (ances[u] != ances[v]) {
  ------------------
  |  Branch (134:14): [True: 57.14%, False: 42.86%]
  ------------------
  135|      8|        if (depth[ances[u]] > depth[ances[v]]) {
  ------------------
  |  Branch (135:13): [True: 50.00%, False: 50.00%]
  ------------------
  136|      4|          x = apply_1(ances[u], u, x);
  137|      4|          u = parent[ances[u]];
  138|      4|        } else {
  139|      4|          vec[++c] = {ances[v], v};
  140|      4|          v = parent[ances[v]];
  141|      4|        }
  142|      8|      }
  143|      6|      if (u > v) {
  ------------------
  |  Branch (143:11): [True: 33.33%, False: 66.67%]
  ------------------
  144|      2|        x = apply_1(v, u, x);
  145|      4|      } else {
  146|      4|        x = apply_2(u, v, x);
  147|      4|      }
  148|     10|      for (; c > 0; --c) {
                                  ^4
  ------------------
  |  Branch (148:14): [True: 40.00%, False: 60.00%]
  ------------------
  149|      4|        def[l, r] = vec[c];
  150|      4|        x = apply_2(l, r, x);
  151|      4|      }
  152|      6|      wt.uw(x);
  153|      6|    }
  154|      7|  }
  155|      1|  return 0;
  156|      1|}