/tmp/solutions/build/point_set_range_composite-slow.cpp:
    1|       |#include <common.h>
    2|       |#include <toy/bit.h>
    3|       |prelude;
    4|       |
    5|       |namespace {
    6|       |
    7|       |constexpr int N = 1e6;
    8|       |constexpr int P = 998244353;
    9|       |
   10|       |struct node {
   11|       |  u32 a, b;
   12|    499|  auto operator+(node t) -> node {
   13|    499|    return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
   14|    499|  }
   15|  1.09k|  auto operator+(u32 x) -> u32 { return (u64(a) * x + b) % P; }
   16|       |} a[N];
   17|       |
   18|       |} // namespace
   19|       |
   20|      1|int main() {
   21|      1|  rd rd;
   22|      1|  wt wt;
   23|      1|  int n = rd.uh();
   24|      1|  int q = rd.uh();
   25|      4|  for (int i = 0; i < n; ++i) {
                                       ^3
  ------------------
  |  Branch (25:19): [True: 75.00%, False: 25.00%]
  ------------------
   26|      3|    int k = i * 2 + 1;
   27|      3|    a[k] = {rd.uw(), rd.uw()};
   28|      4|    for (int j = 1; k & (j * 2); k -= j, j *= 2) {
                                               ^1
  ------------------
  |  Branch (28:21): [True: 25.00%, False: 75.00%]
  ------------------
   29|      1|      a[k - j] = a[k - j * 2] + a[k];
   30|      1|    }
   31|      3|  }
   32|  1.00k|  while (q--) {
  ------------------
  |  Branch (32:10): [True: 99.90%, False: 0.10%]
  ------------------
   33|  1.00k|    let t = rd.u1();
   34|  1.00k|    if (t == 0) {
  ------------------
  |  Branch (34:9): [True: 52.50%, False: 47.50%]
  ------------------
   35|    525|      int k = rd.uh() * 2 + 1;
   36|    525|      a[k] = {rd.uw(), rd.uw()};
   37|    875|      for (int j = 1;; j *= 2) {
                                     ^350
   38|    875|        if (k & (j * 2)) {
  ------------------
  |  Branch (38:13): [True: 19.77%, False: 80.23%]
  ------------------
   39|    173|          a[k - j] = a[k - j * 2] + a[k];
   40|    173|          k -= j;
   41|    702|        } else {
   42|    702|          if (k + j * 3 > n * 2) break;
                                               ^525
  ------------------
  |  Branch (42:15): [True: 74.79%, False: 25.21%]
  ------------------
   43|    177|          a[k + j] = a[k] + a[k + j * 2];
   44|    177|          k += j;
   45|    177|        }
   46|    875|      }
   47|    525|    }
   48|  1.00k|    if (t == 1) {
  ------------------
  |  Branch (48:9): [True: 47.50%, False: 52.50%]
  ------------------
   49|    475|      int l = rd.uh() * 2 + 1;
   50|    475|      int r = rd.uh() * 2 + 1;
   51|    475|      u32 x = a[l] + rd.uw();
   52|    475|      node f = {1, 0};
   53|    475|      int k = (-1 << log(l ^ r)) & r;
   54|    624|      for (++l; l < k; l += l & -l) {
                                     ^149
  ------------------
  |  Branch (54:17): [True: 23.88%, False: 76.12%]
  ------------------
   55|    149|        x = a[l + (l & -l) / 2] + x;
   56|    149|      }
   57|    623|      for (--r; r > k; r -= r & -r) {
                                     ^148
  ------------------
  |  Branch (57:17): [True: 23.76%, False: 76.24%]
  ------------------
   58|    148|        f = a[r - (r & -r) / 2] + f;
   59|    148|      }
   60|    475|      x = f + x;
   61|    475|      wt.uw(x);
   62|    475|    }
   63|  1.00k|  }
   64|      1|  return 0;
   65|      1|}