/tmp/solutions/build/range_reverse_range_sum-main.cpp:
    1|       |#include <common.h>
    2|       |prelude;
    3|       |
    4|       |namespace {
    5|       |
    6|       |constexpr int N = 200003;
    7|       |
    8|       |struct Node {
    9|       |  int val;
   10|       |  u64 sum;
   11|       |  int rev;
   12|       |  int size;
   13|       |  int l, r;
   14|       |} node[N];
   15|       |
   16|  8.93M|def maintain(int x) -> void {
   17|  8.93M|  node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
   18|  8.93M|  node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
   19|  8.93M|}
   20|       |
   21|   400k|def build(int l, int r) -> int {
   22|   400k|  if (l > r) return 0;
                           ^200k
  ------------------
  |  Branch (22:7): [True: 50.00%, False: 50.00%]
  ------------------
   23|   200k|  int m = (l + r) / 2;
   24|   200k|  node[m].l = build(l, m - 1);
   25|   200k|  node[m].r = build(m + 1, r);
   26|   200k|  maintain(m);
   27|   200k|  return m;
   28|   400k|}
   29|       |
   30|  9.13M|def pushdown(int x) -> void {
   31|  9.13M|  if (node[x].rev) {
  ------------------
  |  Branch (31:7): [True: 40.16%, False: 59.84%]
  ------------------
   32|  3.67M|    std::swap(node[x].l, node[x].r);
   33|  3.67M|    node[node[x].l].rev ^= 1;
   34|  3.67M|    node[node[x].r].rev ^= 1;
   35|  3.67M|    node[x].rev = 0;
   36|  3.67M|  }
   37|  9.13M|}
   38|       |
   39|  99.6k|def reverse(int x) -> void {
   40|  99.6k|  if (x == 0) return;
                            ^0
  ------------------
  |  Branch (40:7): [True: 0.00%, False: 100.00%]
  ------------------
   41|  99.6k|  node[x].rev ^= 1;
   42|  99.6k|}
   43|       |
   44|  4.34M|def zig(int &x) -> void {
   45|  4.34M|  int l = node[x].l;
   46|  4.34M|  node[x].l = node[l].r;
   47|  4.34M|  maintain(x);
   48|  4.34M|  node[l].r = x;
   49|  4.34M|  x = l;
   50|  4.34M|}
   51|       |
   52|  4.39M|def zag(int &x) -> void {
   53|  4.39M|  int r = node[x].r;
   54|  4.39M|  node[x].r = node[r].l;
   55|  4.39M|  maintain(x);
   56|  4.39M|  node[r].l = x;
   57|  4.39M|  x = r;
   58|  4.39M|}
   59|       |
   60|  4.66M|def splay(int &x, int k) -> void {
   61|  4.66M|  pushdown(x);
   62|  4.66M|  if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
  ------------------
  |  Branch (62:64): [True: 4.28%, False: 95.72%]
  ------------------
   63|   199k|    return;
   64|  4.46M|  } else if (k < size) {
  ------------------
  |  Branch (64:14): [True: 49.36%, False: 50.64%]
  ------------------
   65|  2.20M|    pushdown(l);
   66|  2.20M|    if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
  ------------------
  |  Branch (66:69): [True: 4.54%, False: 95.46%]
  ------------------
   67|   100k|      zig(x);
   68|  2.10M|    } else if (k < size) {
  ------------------
  |  Branch (68:16): [True: 48.28%, False: 51.72%]
  ------------------
   69|  1.01M|      splay(ll, k);
   70|  1.01M|      zig(x);
   71|  1.01M|      zig(x);
   72|  1.08M|    } else {
   73|  1.08M|      splay(lr, k - size - 1);
   74|  1.08M|      zag(l);
   75|  1.08M|      zig(x);
   76|  1.08M|    }
   77|  2.26M|  } else {
   78|  2.26M|    pushdown(r);
   79|  2.26M|    k -= size + 1;
   80|  2.26M|    if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
  ------------------
  |  Branch (80:69): [True: 4.41%, False: 95.59%]
  ------------------
   81|  99.8k|      zag(x);
   82|  2.16M|    } else if (k < size) {
  ------------------
  |  Branch (82:16): [True: 52.03%, False: 47.97%]
  ------------------
   83|  1.12M|      splay(rl, k);
   84|  1.12M|      zig(r);
   85|  1.12M|      zag(x);
   86|  1.12M|    } else {
   87|  1.03M|      splay(rr, k - size - 1);
   88|  1.03M|      zag(x);
   89|  1.03M|      zag(x);
   90|  1.03M|    }
   91|  2.26M|  }
   92|  4.66M|}
   93|       |
   94|       |} // namespace
   95|       |
   96|      1|int main() {
   97|      1|  rd rd;
   98|      1|  wt wt;
   99|      1|  int n = rd.uh();
  100|      1|  int q = rd.uh();
  101|      1|#ifdef LOCAL
  102|      1|  std::memset(node, 0, sizeof(Node) * (n + 3));
  103|      1|#endif
  104|   200k|  for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
                                            ^200k^200k
  ------------------
  |  Branch (104:19): [True: 100.00%, False: 0.00%]
  ------------------
  105|      1|  int x = build(1, n + 2);
  106|      1|  if (n == 0) rd.skip(1);
                            ^0
  ------------------
  |  Branch (106:7): [True: 0.00%, False: 100.00%]
  ------------------
  107|   200k|  while (q--) {
  ------------------
  |  Branch (107:10): [True: 100.00%, False: 0.00%]
  ------------------
  108|   200k|    int t = rd.u1();
  109|   200k|    int l = rd.uh();
  110|   200k|    int r = rd.uh();
  111|   200k|    splay(x, l);
  112|   200k|    splay(node[x].r, r - l);
  113|   200k|    if (t == 0) {
  ------------------
  |  Branch (113:9): [True: 49.81%, False: 50.19%]
  ------------------
  114|  99.6k|      reverse(node[node[x].r].l);
  115|  99.6k|    }
  116|   200k|    if (t == 1) {
  ------------------
  |  Branch (116:9): [True: 50.19%, False: 49.81%]
  ------------------
  117|   100k|      wt.ud(node[node[node[x].r].l].sum);
  118|   100k|    }
  119|   200k|  }
  120|      1|  return 0;
  121|      1|}