/tmp/solutions/build/range_affine_range_sum-main.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 affine {
   11|       |  u32 a, b;
   12|  4.60k|  auto operator+(affine t) -> affine {
   13|  4.60k|    return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
   14|  4.60k|  }
   15|  4.60k|  auto operator+=(affine t) -> void { *this = *this + t; }
   16|       |};
   17|       |
   18|       |struct node {
   19|       |  u32 siz;
   20|       |  u32 sum;
   21|       |  affine aff;
   22|  4.60k|  auto operator+=(affine t) -> void {
   23|  4.60k|    aff += t;
   24|  4.60k|    sum = (u64(t.a) * sum + u64(t.b) * siz) % P;
   25|  4.60k|  }
   26|       |} a[N];
   27|       |
   28|    992|void pushdown(int k) {
   29|  2.97k|  for (int i = log(k) - 1; i >= 0; --i) {
                                                 ^1.98k
  ------------------
  |  Branch (29:28): [True: 66.67%, False: 33.33%]
  ------------------
   30|  1.98k|    affine t = a[k >> i >> 1].aff;
   31|  1.98k|    a[k >> i >> 1].aff = affine{1, 0};
   32|  1.98k|    a[k >> i ^ 0] += t;
   33|  1.98k|    a[k >> i ^ 1] += t;
   34|  1.98k|  }
   35|    992|}
   36|       |
   37|  1.36k|u32 mod(u32 x) { return x < P ? x : x - P; }
                                              ^922^440
  ------------------
  |  Branch (37:25): [True: 67.69%, False: 32.31%]
  ------------------
   38|       |
   39|    992|void pushup(int k) {
   40|  1.84k|  for (k /= 2; k > 0; k /= 2) {
                                    ^854
  ------------------
  |  Branch (40:16): [True: 46.26%, False: 53.74%]
  ------------------
   41|    854|    a[k].sum = mod(a[k * 2].sum + a[k * 2 + 1].sum);
   42|    854|  }
   43|    992|}
   44|       |
   45|       |}; // namespace
   46|       |
   47|      1|int main() {
   48|      1|  rd rd;
   49|      1|  wt wt;
   50|      1|  int n = rd.uh();
   51|      1|  int q = rd.uh();
   52|      5|  for (int i = 0; i < n; ++i) a[n + i].siz = 1, a[n + i].sum = rd.uw();
                                       ^4   ^4
  ------------------
  |  Branch (52:19): [True: 80.00%, False: 20.00%]
  ------------------
   53|      5|  for (int i = n - 1; i >= 0; --i) {
                                            ^4
  ------------------
  |  Branch (53:23): [True: 80.00%, False: 20.00%]
  ------------------
   54|      4|    a[i].aff = {1, 0};
   55|      4|    a[i].siz = a[2 * i].siz + a[2 * i + 1].siz;
   56|      4|    a[i].sum = mod(a[2 * i].sum + a[2 * i + 1].sum);
   57|      4|  }
   58|  1.00k|  while (q--) {
  ------------------
  |  Branch (58:10): [True: 99.90%, False: 0.10%]
  ------------------
   59|  1.00k|    let t = rd.u1();
   60|  1.00k|    if (t == 0) {
  ------------------
  |  Branch (60:9): [True: 49.60%, False: 50.40%]
  ------------------
   61|    496|      int l = n + rd.uh();
   62|    496|      int r = n + rd.uh() - 1;
   63|    496|      pushdown(l--);
   64|    496|      pushdown(r++);
   65|    496|      int k = log(l ^ r);
   66|    496|      affine x = {rd.uw(), rd.uw()};
   67|    496|      int t, i;
   68|    844|      for (t = ~l & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
                                                             ^348
  ------------------
  |  Branch (68:41): [True: 41.23%, False: 58.77%]
  ------------------
   69|    348|        i = log(t);
   70|    348|        a[l >> i ^ 1] += x;
   71|    348|      }
   72|    496|      pushup(l >> i);
   73|    787|      for (t = +r & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
                                                             ^291
  ------------------
  |  Branch (73:41): [True: 36.98%, False: 63.02%]
  ------------------
   74|    291|        i = log(t);
   75|    291|        a[r >> i ^ 1] += x;
   76|    291|      }
   77|    496|      pushup(r >> i);
   78|    496|    }
   79|  1.00k|    if (t == 1) {
  ------------------
  |  Branch (79:9): [True: 50.40%, False: 49.60%]
  ------------------
   80|    504|      int l = n + rd.uh();
   81|    504|      int r = n + rd.uh() - 1;
   82|    504|      u64 sizL = 0, sumL = 0;
   83|    504|      u64 sizR = 0, sumR = 0;
   84|  1.53k|      for (--l, ++r; l ^ r ^ 1;) {
  ------------------
  |  Branch (84:22): [True: 67.06%, False: 32.94%]
  ------------------
   85|  1.02k|        if (~l & 1) sizL += a[l ^ 1].siz, sumL += a[l ^ 1].sum;
                                  ^315
  ------------------
  |  Branch (85:13): [True: 30.70%, False: 69.30%]
  ------------------
   86|  1.02k|        if (+r & 1) sizR += a[r ^ 1].siz, sumR += a[r ^ 1].sum;
                                  ^341
  ------------------
  |  Branch (86:13): [True: 33.24%, False: 66.76%]
  ------------------
   87|  1.02k|        l /= 2, r /= 2;
   88|  1.02k|        sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
   89|  1.02k|        sumR = (a[r].aff.a * sumR + a[r].aff.b * sizR) % P;
   90|  1.02k|      }
   91|    504|      sumL = mod(u32(sumL + sumR));
   92|    504|      sizL += sizR;
   93|    663|      for (l /= 2; l > 0; l /= 2) {
                                        ^159
  ------------------
  |  Branch (93:20): [True: 23.98%, False: 76.02%]
  ------------------
   94|    159|        sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
   95|    159|      }
   96|    504|      wt.uw(u32(sumL));
   97|    504|    }
   98|  1.00k|  }
   99|      1|  return 0;
  100|      1|}