/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|  6.33k|def maintain(int x) -> void {
   20|  6.33k|  node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
   21|  6.33k|  node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
   22|  6.33k|}
   23|       |
   24|  1.41k|def build(int l, int r) -> int {
   25|  1.41k|  if (l > r) return 0;
                           ^707
  ------------------
  |  Branch (25:7): [True: 50.04%, False: 49.96%]
  ------------------
   26|    706|  int m = (l + r) / 2;
   27|    706|  node[m].l = build(l, m - 1);
   28|    706|  node[m].r = build(m + 1, r);
   29|    706|  maintain(m);
   30|    706|  return m;
   31|  1.41k|}
   32|       |
   33|     65|def reverse(int x) -> void { node[x].rev ^= 1; }
   34|       |
   35|  4.65k|def affine(int x, u64 a, u64 b) -> void {
   36|  4.65k|  if (x == 0) return;
                            ^920
  ------------------
  |  Branch (36:7): [True: 19.78%, False: 80.22%]
  ------------------
   37|  3.73k|  node[x].a = (a * node[x].a) % P;
   38|  3.73k|  node[x].b = (a * node[x].b + b) % P;
   39|  3.73k|  node[x].val = (a * node[x].val + b) % P;
   40|  3.73k|  node[x].sum = (a * node[x].sum + b * node[x].size) % P;
   41|  3.73k|}
   42|       |
   43|  6.23k|def pushdown(int x) -> void {
   44|  6.23k|  if (node[x].rev) {
  ------------------
  |  Branch (44:7): [True: 24.68%, False: 75.32%]
  ------------------
   45|  1.53k|    std::swap(node[x].l, node[x].r);
   46|  1.53k|    node[node[x].l].rev ^= 1;
   47|  1.53k|    node[node[x].r].rev ^= 1;
   48|  1.53k|    node[x].rev = 0;
   49|  1.53k|  }
   50|  6.23k|  if ((node[x].a != 1) | (node[x].b != 0)) {
  ------------------
  |  Branch (50:7): [True: 36.77%, False: 63.23%]
  ------------------
   51|  2.29k|    affine(node[x].l, node[x].a, node[x].b);
   52|  2.29k|    affine(node[x].r, node[x].a, node[x].b);
   53|  2.29k|    node[x].a = 1;
   54|  2.29k|    node[x].b = 0;
   55|  2.29k|  }
   56|  6.23k|}
   57|       |
   58|  2.86k|def zig(int &x) -> void {
   59|  2.86k|  int l = node[x].l;
   60|  2.86k|  node[x].l = node[l].r;
   61|  2.86k|  maintain(x);
   62|  2.86k|  node[l].r = x;
   63|  2.86k|  x = l;
   64|  2.86k|}
   65|       |
   66|  2.77k|def zag(int &x) -> void {
   67|  2.77k|  int r = node[x].r;
   68|  2.77k|  node[x].r = node[r].l;
   69|  2.77k|  maintain(x);
   70|  2.77k|  node[r].l = x;
   71|  2.77k|  x = r;
   72|  2.77k|}
   73|       |
   74|  3.26k|def splay(int &x, int k) -> void {
   75|  3.26k|  pushdown(x);
   76|  3.26k|  if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
  ------------------
  |  Branch (76:64): [True: 8.83%, False: 91.17%]
  ------------------
   77|    288|    return;
   78|  2.97k|  } else if (k < size) {
  ------------------
  |  Branch (78:14): [True: 50.54%, False: 49.46%]
  ------------------
   79|  1.50k|    pushdown(l);
   80|  1.50k|    if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
  ------------------
  |  Branch (80:69): [True: 11.24%, False: 88.76%]
  ------------------
   81|    169|      zig(x);
   82|  1.33k|    } else if (k < size) {
  ------------------
  |  Branch (82:16): [True: 55.47%, False: 44.53%]
  ------------------
   83|    740|      splay(ll, k);
   84|    740|      zig(x);
   85|    740|      zig(x);
   86|    740|    } else {
   87|    594|      splay(lr, k - size - 1);
   88|    594|      zag(l);
   89|    594|      zig(x);
   90|    594|    }
   91|  1.50k|  } else {
   92|  1.47k|    pushdown(r);
   93|  1.47k|    k -= size + 1;
   94|  1.47k|    if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
  ------------------
  |  Branch (94:69): [True: 10.13%, False: 89.87%]
  ------------------
   95|    149|      zag(x);
   96|  1.32k|    } else if (k < size) {
  ------------------
  |  Branch (96:16): [True: 46.67%, False: 53.33%]
  ------------------
   97|    617|      splay(rl, k);
   98|    617|      zig(r);
   99|    617|      zag(x);
  100|    705|    } else {
  101|    705|      splay(rr, k - size - 1);
  102|    705|      zag(x);
  103|    705|      zag(x);
  104|    705|    }
  105|  1.47k|  }
  106|  3.26k|}
  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.00k|  for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
                                                ^1.00k^1.00k
  ------------------
  |  Branch (115:19): [True: 99.90%, False: 0.10%]
  ------------------
  116|    705|  for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
                                            ^704 ^704
  ------------------
  |  Branch (116:19): [True: 99.86%, False: 0.14%]
  ------------------
  117|      1|  int x = build(1, n += 2);
  118|    304|  while (q--) {
  ------------------
  |  Branch (118:10): [True: 99.67%, False: 0.33%]
  ------------------
  119|    303|    let t = rd.u1();
  120|    303|    if (t == 0) {
  ------------------
  |  Branch (120:9): [True: 16.17%, False: 83.83%]
  ------------------
  121|     49|      ++n;
  122|     49|      int k = rd.uh();
  123|     49|      node[n].val = node[n].sum = rd.uw();
  124|     49|      splay(x, k);
  125|     49|      splay(node[x].r, 0);
  126|     49|      node[node[x].r].l = n;
  127|     49|    }
  128|    303|    if (t == 1) {
  ------------------
  |  Branch (128:9): [True: 20.13%, False: 79.87%]
  ------------------
  129|     61|      int k = rd.uh();
  130|     61|      splay(x, k);
  131|     61|      splay(node[x].r, 1);
  132|     61|      node[node[x].r].l = 0;
  133|     61|    }
  134|    303|    if (t == 2) {
  ------------------
  |  Branch (134:9): [True: 21.45%, False: 78.55%]
  ------------------
  135|     65|      int l = rd.uh();
  136|     65|      int r = rd.uh();
  137|     65|      splay(x, l);
  138|     65|      splay(node[x].r, r - l);
  139|     65|      reverse(node[node[x].r].l);
  140|     65|    }
  141|    303|    if (t == 3) {
  ------------------
  |  Branch (141:9): [True: 21.45%, False: 78.55%]
  ------------------
  142|     65|      int l = rd.uh();
  143|     65|      int r = rd.uh();
  144|     65|      splay(x, l);
  145|     65|      splay(node[x].r, r - l);
  146|     65|      int a = rd.uw();
  147|     65|      int b = rd.uw();
  148|     65|      affine(node[node[x].r].l, a, b);
  149|     65|    }
  150|    303|    if (t == 4) {
  ------------------
  |  Branch (150:9): [True: 20.79%, False: 79.21%]
  ------------------
  151|     63|      int l = rd.uh();
  152|     63|      int r = rd.uh();
  153|     63|      splay(x, l);
  154|     63|      splay(node[x].r, r - l);
  155|     63|      wt.ud(node[node[node[x].r].l].sum);
  156|     63|    }
  157|    303|  }
  158|      1|  return 0;
  159|      1|}