Problem p00998 (C++)

Buggy submission (status: Time Limit Exceeded):
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;

#define int long long

#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, x, ...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n)
#define rep(...) CHOOSE((__VA_ARGS__, REP1, REP2, REP3))(__VA_ARGS__)
#define rrep(i, s) rep(i, s, >= 0, --)

#define all(c) begin(c), end(c)
template <typename T> bool maxup(T &a, T &&b) {
  if (a < b) {
    a = b;
    return true;
  };
}
template <typename T> bool maxup(T &a, T &b) {
  if (a < b) {
    a = b;
    return true;
  };
}
template <typename T> bool minup(T &a, T &&b) {
  if (a > b) {
    a = b;
    return true;
  };
}
template <typename T> bool minup(T &a, T &b) {
  if (a > b) {
    a = b;
    return true;
  };
}

#define X first
#define Y second

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

template <typename T> inline void input(vector<T> &v) {
  for (auto &x : v)
    cin >> x;
}
struct node_t {
  int val;
  int pri;
  int cnt;
  int min;
  node_t *lch, *rch;
};

int count(node_t *t) { return !t ? 0 : t->cnt; }
int min(node_t *t) { return !t ? (1 << 29) : t->min; }
node_t *update(node_t *t) {
  t->cnt = count(t->lch) + count(t->rch) + 1;
  t->min = min(t->val, min(min(t->lch), min(t->rch)));
  return t;
}

node_t *merge(node_t *l, node_t *r) {
  if (!l || !r)
    return l ? l : r;

  if (l->pri > r->pri) {
    l->rch = merge(l->rch, r);
    return update(l);
  } else {
    r->lch = merge(l, r->lch);
    return update(r);
  }
}

pair<node_t *, node_t *> split(node_t *t, int k) {
  if (!t)
    return make_pair(nullptr, nullptr);

  if (k <= count(t->lch)) {
    auto s = split(t->lch, k);
    t->lch = s.second;
    return make_pair(s.first, update(t));
  } else {
    auto s = split(t->rch, k - count(t->lch) - 1);
    t->rch = s.first;
    return make_pair(update(t), s.second);
  }
}

node_t *insert(node_t *t, int k, int v) {
  auto n = new node_t{v, rand(), 1, v};
  if (!t)
    return n;
  auto x = split(t, k);
  return merge(merge(x.first, n), x.second);
}

node_t *erase(node_t *t, int k) {
  auto x = split(t, k);
  auto y = split(x.second, 1);
  return merge(x.first, y.second);
}

node_t *kth(node_t *t, int k) {
  if (!t || count(t->lch) == k)
    return t;
  return count(t->lch) > k ? kth(t->lch, k)
                           : kth(t->rch, k - count(t->lch) - 1);
}

int min(node_t *t, int l, int r) { //[l, r)
  if (!t || (l == 0 && count(t) <= r))
    return min(t);

  int lc = count(t->lch);
  int ret = min(t->lch, l, r);
  minup(ret, min(t->rch, l - lc - 1, r - lc - 1));
  if (l <= lc && lc < r) {
    minup(ret, t->val);
  }
  return ret;
}

using Tree = node_t *;

void get_all(node_t *t, vector<node_t *> &res) {
  if (!t)
    return;
  get_all(t->lch, res);
  res.push_back(t);
  get_all(t->rch, res);
}

vector<node_t *> get_all(node_t *t) {
  vector<node_t *> v;
  get_all(t, v);
  return v;
}

void dump(node_t *t) {
  return;
  if (!t)
    return;
  cout << "top: (" << t->val << ", " << t->min << "), count: " << count(t)
       << endl;
  for (auto x : get_all(t)) {
    cout << "  " << (x->val) << " " << x->min << endl;
  }
}

signed main() {
  int n, q;
  scanf("%lld %lld", &n, &q);
  Tree t = nullptr;
  rep(i, n) {
    int a;
    scanf("%lld", &a);
    dump(t);
    t = insert(t, count(t), a);
  }
  dump(t);
  rep(i, q) {
    int x, y, z;
    scanf("%lld %lld %lld", &x, &y, &z);
    if (x == 0) {
      auto tmp = kth(t, z);
      t = erase(t, z);
      dump(t);
      t = insert(t, y, tmp->val);
      dump(t);
    }
    if (x == 1) {
      printf("%lld\n", min(t, y, z + 1));
    }
    if (x == 2) {
      t = erase(t, y);
      t = insert(t, y, z);
    }
    dump(t);
  }

  // system("pause");
}

Fixed submission:
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;

#define int long long

#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, x, ...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n)
#define rep(...) CHOOSE((__VA_ARGS__, REP1, REP2, REP3))(__VA_ARGS__)
#define rrep(i, s) rep(i, s, >= 0, --)

#define all(c) begin(c), end(c)
template <typename T> bool maxup(T &a, T &&b) {
  if (a < b) {
    a = b;
    return true;
  };
}
template <typename T> bool maxup(T &a, T &b) {
  if (a < b) {
    a = b;
    return true;
  };
}
template <typename T> bool minup(T &a, T &&b) {
  if (a > b) {
    a = b;
    return true;
  };
}
template <typename T> bool minup(T &a, T &b) {
  if (a > b) {
    a = b;
    return true;
  };
}

#define X first
#define Y second

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

template <typename T> inline void input(vector<T> &v) {
  for (auto &x : v)
    cin >> x;
}
struct node_t {
  int val;
  int pri;
  int cnt;
  int min;
  node_t *lch, *rch;
};

int count(node_t *t) { return !t ? 0 : t->cnt; }
int min(node_t *t) { return !t ? (1 << 29) : t->min; }
node_t *update(node_t *t) {
  t->cnt = count(t->lch) + count(t->rch) + 1;
  t->min = min(t->val, min(min(t->lch), min(t->rch)));
  return t;
}

node_t *merge(node_t *l, node_t *r) {
  if (!l || !r)
    return l ? l : r;

  if (l->pri > r->pri) {
    l->rch = merge(l->rch, r);
    return update(l);
  } else {
    r->lch = merge(l, r->lch);
    return update(r);
  }
}

pair<node_t *, node_t *> split(node_t *t, int k) {
  if (!t)
    return make_pair(nullptr, nullptr);

  if (k <= count(t->lch)) {
    auto s = split(t->lch, k);
    t->lch = s.second;
    return make_pair(s.first, update(t));
  } else {
    auto s = split(t->rch, k - count(t->lch) - 1);
    t->rch = s.first;
    return make_pair(update(t), s.second);
  }
}

node_t *insert(node_t *t, int k, int v) {
  auto n = new node_t{v, rand(), 1, v};
  if (!t)
    return n;
  auto x = split(t, k);
  return merge(merge(x.first, n), x.second);
}

node_t *erase(node_t *t, int k) {
  auto x = split(t, k);
  auto y = split(x.second, 1);
  return merge(x.first, y.second);
}

node_t *kth(node_t *t, int k) {
  if (!t || count(t->lch) == k)
    return t;
  return count(t->lch) > k ? kth(t->lch, k)
                           : kth(t->rch, k - count(t->lch) - 1);
}

int min(node_t *t, int l, int r) { //[l, r)
  if (!t || (l == 0 && count(t) <= r))
    return min(t);

  int lc = count(t->lch);
  int ret = min(t->lch, l, r);
  minup(ret, min(t->rch, l - lc - 1, r - lc - 1));
  if (l <= lc && lc < r) {
    minup(ret, t->val);
  }
  return ret;
}

using Tree = node_t *;

void get_all(node_t *t, vector<node_t *> &res) {
  if (!t)
    return;
  get_all(t->lch, res);
  res.push_back(t);
  get_all(t->rch, res);
}

vector<node_t *> get_all(node_t *t) {
  vector<node_t *> v;
  get_all(t, v);
  return v;
}

void dump(node_t *t) {
  return;
  if (!t)
    return;
  cout << "top: (" << t->val << ", " << t->min << "), count: " << count(t)
       << endl;
  for (auto x : get_all(t)) {
    cout << "  " << (x->val) << " " << x->min << endl;
  }
}

signed main() {
  int n, q;
  scanf("%lld %lld", &n, &q);
  Tree t = nullptr;
  rep(i, n) {
    int a;
    scanf("%lld", &a);
    dump(t);
    t = insert(t, count(t), a);
  }
  dump(t);
  rep(i, q) {
    int x, y, z;
    scanf("%lld %lld %lld", &x, &y, &z);
    if (x == 0) {
      auto tmp = kth(t, z);
      t = erase(t, z);
      dump(t);
      t = insert(t, y, tmp->val);
      dump(t);
    }
    if (x == 1) {
      auto a = split(t, z + 1);
      auto b = split(a.first, y);
      printf("%lld\n", b.second->min);
      t = merge(merge(b.first, b.second), a.second);
      // printf("%lld\n" , min(t, y, z + 1));
    }
    if (x == 2) {
      t = erase(t, y);
      t = insert(t, y, z);
    }
    dump(t);
  }

  // system("pause");
}