/tmp/solutions/build/dynamic_sequence_range_affine_range_sum-main.cpp:
    1|       |#include <common.h>
    2|       |prelude;
    3|       |
    4|       |namespace {
    5|       |
    6|       |constexpr int N = 1000003;
    7|       |constexpr u32 P = 998244353;
    8|       |
    9|       |struct Node {
   10|       |  u32 val;
   11|       |  u32 sum;
   12|       |  u32 a;
   13|       |  u32 b;
   14|       |  int rev;
   15|       |  int size;
   16|       |  int l, r;
   17|       |} node[N];
   18|       |
   19|  15.1k|def maintain(int x) -> void {
   20|  15.1k|  node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
   21|  15.1k|  node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
   22|  15.1k|}
   23|       |
   24|  1.06k|def build(int l, int r) -> int {
   25|  1.06k|  if (l > r) return 0;
                           ^535
  ------------------
  |  Branch (25:7): [True: 50.05%, False: 49.95%]
  ------------------
   26|    534|  int m = (l + r) / 2;
   27|    534|  node[m].l = build(l, m - 1);
   28|    534|  node[m].r = build(m + 1, r);
   29|    534|  maintain(m);
   30|    534|  return m;
   31|  1.06k|}
   32|       |
   33|    152|def reverse(int x) -> void { node[x].rev ^= 1; }
   34|       |
   35|  11.8k|def affine(int x, u64 a, u64 b) -> void {
   36|  11.8k|  if (x == 0) return;
                            ^2.52k
  ------------------
  |  Branch (36:7): [True: 21.31%, False: 78.69%]
  ------------------
   37|  9.33k|  node[x].a = (a * node[x].a) % P;
   38|  9.33k|  node[x].b = (a * node[x].b + b) % P;
   39|  9.33k|  node[x].val = (a * node[x].val + b) % P;
   40|  9.33k|  node[x].sum = (a * node[x].sum + b * node[x].size) % P;
   41|  9.33k|}
   42|       |
   43|  16.2k|def pushdown(int x) -> void {
   44|  16.2k|  if (node[x].rev) {
  ------------------
  |  Branch (44:7): [True: 22.84%, False: 77.16%]
  ------------------
   45|  3.71k|    std::swap(node[x].l, node[x].r);
   46|  3.71k|    node[node[x].l].rev ^= 1;
   47|  3.71k|    node[node[x].r].rev ^= 1;
   48|  3.71k|    node[x].rev = 0;
   49|  3.71k|  }
   50|  16.2k|  if ((node[x].a != 1) | (node[x].b != 0)) {
  ------------------
  |  Branch (50:7): [True: 35.92%, False: 64.08%]
  ------------------
   51|  5.84k|    affine(node[x].l, node[x].a, node[x].b);
   52|  5.84k|    affine(node[x].r, node[x].a, node[x].b);
   53|  5.84k|    node[x].a = 1;
   54|  5.84k|    node[x].b = 0;
   55|  5.84k|  }
   56|  16.2k|}
   57|       |
   58|  7.51k|def zig(int &x) -> void {
   59|  7.51k|  int l = node[x].l;
   60|  7.51k|  node[x].l = node[l].r;
   61|  7.51k|  maintain(x);
   62|  7.51k|  node[l].r = x;
   63|  7.51k|  x = l;
   64|  7.51k|}
   65|       |
   66|  7.13k|def zag(int &x) -> void {
   67|  7.13k|  int r = node[x].r;
   68|  7.13k|  node[x].r = node[r].l;
   69|  7.13k|  maintain(x);
   70|  7.13k|  node[r].l = x;
   71|  7.13k|  x = r;
   72|  7.13k|}
   73|       |
   74|  8.54k|def splay(int &x, int k) -> void {
   75|  8.54k|  pushdown(x);
   76|  8.54k|  if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
  ------------------
  |  Branch (76:64): [True: 9.46%, False: 90.54%]
  ------------------
   77|    808|    return;
   78|  7.73k|  } else if (k < size) {
  ------------------
  |  Branch (78:14): [True: 51.86%, False: 48.14%]
  ------------------
   79|  4.01k|    pushdown(l);
   80|  4.01k|    if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
  ------------------
  |  Branch (80:69): [True: 12.14%, False: 87.86%]
  ------------------
   81|    487|      zig(x);
   82|  3.52k|    } else if (k < size) {
  ------------------
  |  Branch (82:16): [True: 57.65%, False: 42.35%]
  ------------------
   83|  2.03k|      splay(ll, k);
   84|  2.03k|      zig(x);
   85|  2.03k|      zig(x);
   86|  2.03k|    } else {
   87|  1.49k|      splay(lr, k - size - 1);
   88|  1.49k|      zag(l);
   89|  1.49k|      zig(x);
   90|  1.49k|    }
   91|  4.01k|  } else {
   92|  3.72k|    pushdown(r);
   93|  3.72k|    k -= size + 1;
   94|  3.72k|    if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
  ------------------
  |  Branch (94:69): [True: 8.89%, False: 91.11%]
  ------------------
   95|    331|      zag(x);
   96|  3.39k|    } else if (k < size) {
  ------------------
  |  Branch (96:16): [True: 43.46%, False: 56.54%]
  ------------------
   97|  1.47k|      splay(rl, k);
   98|  1.47k|      zig(r);
   99|  1.47k|      zag(x);
  100|  1.91k|    } else {
  101|  1.91k|      splay(rr, k - size - 1);
  102|  1.91k|      zag(x);
  103|  1.91k|      zag(x);
  104|  1.91k|    }
  105|  3.72k|  }
  106|  8.54k|}
  107|       |
  108|       |} // namespace
  109|       |
  110|      1|int main() {
  111|      1|  rd rd;
  112|      1|  wt wt;
  113|      1|  int n = rd.uh();
  114|      1|  int q = rd.uh();
  115|  1.34k|  for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
                                                ^1.34k^1.34k
  ------------------
  |  Branch (115:19): [True: 99.93%, False: 0.07%]
  ------------------
  116|    533|  for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
                                            ^532 ^532
  ------------------
  |  Branch (116:19): [True: 99.81%, False: 0.19%]
  ------------------
  117|      1|  int x = build(1, n += 2);
  118|    814|  while (q--) {
  ------------------
  |  Branch (118:10): [True: 99.88%, False: 0.12%]
  ------------------
  119|    813|    let t = rd.u1();
  120|    813|    if (t == 0) {
  ------------------
  |  Branch (120:9): [True: 19.80%, False: 80.20%]
  ------------------
  121|    161|      ++n;
  122|    161|      int k = rd.uh();
  123|    161|      node[n].val = node[n].sum = rd.uw();
  124|    161|      splay(x, k);
  125|    161|      splay(node[x].r, 0);
  126|    161|      node[node[x].r].l = n;
  127|    161|    }
  128|    813|    if (t == 1) {
  ------------------
  |  Branch (128:9): [True: 19.80%, False: 80.20%]
  ------------------
  129|    161|      int k = rd.uh();
  130|    161|      splay(x, k);
  131|    161|      splay(node[x].r, 1);
  132|    161|      node[node[x].r].l = 0;
  133|    161|    }
  134|    813|    if (t == 2) {
  ------------------
  |  Branch (134:9): [True: 18.70%, False: 81.30%]
  ------------------
  135|    152|      int l = rd.uh();
  136|    152|      int r = rd.uh();
  137|    152|      splay(x, l);
  138|    152|      splay(node[x].r, r - l);
  139|    152|      reverse(node[node[x].r].l);
  140|    152|    }
  141|    813|    if (t == 3) {
  ------------------
  |  Branch (141:9): [True: 20.54%, False: 79.46%]
  ------------------
  142|    167|      int l = rd.uh();
  143|    167|      int r = rd.uh();
  144|    167|      splay(x, l);
  145|    167|      splay(node[x].r, r - l);
  146|    167|      int a = rd.uw();
  147|    167|      int b = rd.uw();
  148|    167|      affine(node[node[x].r].l, a, b);
  149|    167|    }
  150|    813|    if (t == 4) {
  ------------------
  |  Branch (150:9): [True: 21.16%, False: 78.84%]
  ------------------
  151|    172|      int l = rd.uh();
  152|    172|      int r = rd.uh();
  153|    172|      splay(x, l);
  154|    172|      splay(node[x].r, r - l);
  155|    172|      wt.ud(node[node[node[x].r].l].sum);
  156|    172|    }
  157|    813|  }
  158|      1|  return 0;
  159|      1|}