/tmp/solutions/build/point_set_range_composite-fast.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|   671k|  auto operator+(node t) -> node {
   13|   671k|    return {u32(u64(a) * t.a % P), u32((u64(a) * t.b + b) % P)};
   14|   671k|  }
   15|   213k|  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|   429k|  for (int i = 0; i < n; ++i) a[n + n - 1 - i] = {rd.uw(), rd.uw()};
                                       ^429k^429k
  ------------------
  |  Branch (25:19): [True: 100.00%, False: 0.00%]
  ------------------
   26|   429k|  for (int i = n - 1; i >= 1; --i) a[i] = a[i * 2] + a[i * 2 + 1];
                                            ^429k^429k
  ------------------
  |  Branch (26:23): [True: 100.00%, False: 0.00%]
  ------------------
   27|  25.8k|  while (q--) {
  ------------------
  |  Branch (27:10): [True: 100.00%, False: 0.00%]
  ------------------
   28|  25.8k|    let t = rd.u1();
   29|  25.8k|    if (t == 0) {
  ------------------
  |  Branch (29:9): [True: 49.84%, False: 50.16%]
  ------------------
   30|  12.8k|      int k = n + n - 1 - rd.uh();
   31|  12.8k|      a[k] = {rd.uw(), rd.uw()};
   32|   254k|      for (k /= 2; k > 0; k /= 2) a[k] = a[k * 2] + a[k * 2 + 1];
                                        ^241k   ^241k
  ------------------
  |  Branch (32:20): [True: 94.94%, False: 5.06%]
  ------------------
   33|  12.8k|    }
   34|  25.8k|    if (t == 1) {
  ------------------
  |  Branch (34:9): [True: 50.16%, False: 49.84%]
  ------------------
   35|  12.9k|      int r = n + n - rd.uh();
   36|  12.9k|      int l = n + n - 1 - rd.uh();
   37|  12.9k|      u32 x = rd.uw();
   38|  12.9k|      int k = log(l ^ r);
   39|  12.9k|      int R = r >> k;
   40|   120k|      for (r = r >> __builtin_ctz(r) ^ 1; r > R; r = r >> __builtin_ctz(r) ^ 1)
                                                               ^107k
  ------------------
  |  Branch (40:43): [True: 89.21%, False: 10.79%]
  ------------------
   41|   107k|        x = a[r] + x;
   42|   118k|      for (int t = ~l & ~(-1 << k), i; t > 0; t -= 1 << i) {
                                                            ^105k
  ------------------
  |  Branch (42:40): [True: 89.10%, False: 10.90%]
  ------------------
   43|   105k|        i = log(t);
   44|   105k|        x = a[l >> i ^ 1] + x;
   45|   105k|      }
   46|  12.9k|      wt.uw(x);
   47|  12.9k|    }
   48|  25.8k|  }
   49|      1|  return 0;
   50|      1|}