This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1508
#include "../../template/template.hpp"
#include "../../structure/bbst/randomized-binary-search-tree.hpp"
int main() {
int N, Q;
cin >> N >> Q;
vector< int > A(N);
for(auto &a : A) cin >> a;
auto f = [](int a, int b) { return min(a, b); };
RandomizedBinarySearchTree< int > rbst(N + Q, f, inf);
auto V = rbst.build(A);
while(Q--) {
int X, Y, Z;
cin >> X >> Y >> Z;
if(X == 0) {
auto S = rbst.split3(V, Y, Z + 1);
auto val = rbst.pop_back(get< 1 >(S));
rbst.push_front(get< 1 >(S), val);
V = rbst.merge(get< 0 >(S), get< 1 >(S), get< 2 >(S));
} else if(X == 1) {
cout << rbst.query(V, Y, Z + 1) << "\n";
} else {
rbst.set_element(V, Y, Z);
}
}
}
#line 1 "test/verify/aoj-1508.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1508
#line 1 "template/template.hpp"
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
for(int i = 0; i < (int) v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
for(T &in : v) is >> in;
return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/aoj-1508.test.cpp"
#line 1 "structure/bbst/randomized-binary-search-tree.hpp"
template< typename T >
class RandomizedBinarySearchTree {
using F = function< T(T, T) >;
private:
struct Node {
Node *l, *r;
size_t cnt;
T key, sum;
Node() = default;
Node(const T &k) : cnt(1), key(k), sum(k), l(nullptr), r(nullptr) {}
};
inline int xor128() {
static int x = 123456789;
static int y = 362436069;
static int z = 521288629;
static int w = 88675123;
int t;
t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
Node *build(int l, int r, const vector< T > &v) {
if(l + 1 >= r) return alloc(v[l]);
return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));
}
void dump(Node *t, typename vector< T >::iterator &it) const {
if(!t) return;
dump(t->l, it);
*it = t->key;
dump(t->r, ++it);
}
inline size_t count(const Node *t) const {
return t ? t->cnt : 0;
}
inline T sum(const Node *t) const {
return t ? t->sum : e;
}
inline Node *update(Node *t) {
t->cnt = count(t->l) + count(t->r) + 1;
t->sum = f(f(sum(t->l), t->key), sum(t->r));
return t;
}
vector< Node > pool;
int ptr;
const F f;
const T e;
public:
RandomizedBinarySearchTree(size_t sz, const F &f, const T &e) : pool(sz), f(f), ptr(0), e(e) {}
inline Node *alloc(const T &v) {
return &(pool[ptr++] = Node(v));
}
Node *merge(Node *l, Node *r) {
if(!l || !r) return l ? l : r;
if(xor128() % (l->cnt + r->cnt) < l->cnt) {
l->r = merge(l->r, r);
return update(l);
} else {
r->l = merge(l, r->l);
return update(r);
}
}
template< typename... Args >
Node *merge(Node *p, Args... args) {
return merge(p, merge(args...));
}
pair< Node *, Node * > split(Node *t, int k) {
if(!t) return {t, t};
if(k <= count(t->l)) {
auto s = split(t->l, k);
t->l = s.second;
return {s.first, update(t)};
} else {
auto s = split(t->r, k - count(t->l) - 1);
t->r = s.first;
return {update(t), s.second};
}
}
Node *build(const vector< T > &v) {
ptr = 0;
return build(0, (int) v.size(), v);
}
vector< T > dump(Node *t) const {
vector< T > v(count(t));
auto it = begin(v);
dump(t, it);
return v;
}
string to_string(Node *r) {
auto s = dump(r);
string ret;
for(int i = 0; i < s.size(); i++) ret += std::to_string(s[i]) + ", ";
return ret;
}
void insert(Node *&t, int k, const T &v) {
auto x = split(t, k);
t = merge(merge(x.first, alloc(v)), x.second);
}
void push_front(Node *&t, const T &v) {
t = merge(alloc(v), t);
}
void push_back(Node *&t, const T &v) {
t = merge(t, alloc(v));
}
T pop_front(Node *&t) {
auto ret = split(t, 1);
t = ret.second;
return ret.first->key;
}
T pop_back(Node *&t) {
auto ret = split(t, count(t) - 1);
t = ret.first;
return ret.second->key;
}
void erase(Node *&t, int k) {
auto x = split(t, k);
t = merge(x.first, split(x.second, 1).second);
}
T query(Node *&t, int a, int b) {
auto x = split(t, a);
auto y = split(x.second, b - a);
auto ret = sum(y.first);
t = merge(x.first, merge(y.first, y.second));
return ret;
}
tuple< Node *, Node *, Node * > split3(Node *t, int a, int b) {
auto x = split(t, a);
auto y = split(x.second, b - a);
return make_tuple(x.first, y.first, y.second);
}
void set_element(Node *&t, int k, const T &x) {
if(k < count(t->l)) set_element(t->l, k, x);
else if(k == count(t->l)) t->key = t->sum = x;
else set_element(t->r, k - count(t->l) - 1, x);
t = update(t);
}
size_t size(Node *t) const {
return count(t);
}
bool empty(Node *t) const {
return !t;
}
};
#line 6 "test/verify/aoj-1508.test.cpp"
int main() {
int N, Q;
cin >> N >> Q;
vector< int > A(N);
for(auto &a : A) cin >> a;
auto f = [](int a, int b) { return min(a, b); };
RandomizedBinarySearchTree< int > rbst(N + Q, f, inf);
auto V = rbst.build(A);
while(Q--) {
int X, Y, Z;
cin >> X >> Y >> Z;
if(X == 0) {
auto S = rbst.split3(V, Y, Z + 1);
auto val = rbst.pop_back(get< 1 >(S));
rbst.push_front(get< 1 >(S), val);
V = rbst.merge(get< 0 >(S), get< 1 >(S), get< 2 >(S));
} else if(X == 1) {
cout << rbst.query(V, Y, Z + 1) << "\n";
} else {
rbst.set_element(V, Y, Z);
}
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | testcase_00 | AC | 6 ms | 4 MB |
g++ | testcase_01 | AC | 6 ms | 4 MB |
g++ | testcase_02 | AC | 6 ms | 4 MB |
g++ | testcase_03 | AC | 6 ms | 4 MB |
g++ | testcase_04 | AC | 6 ms | 4 MB |
g++ | testcase_05 | AC | 6 ms | 4 MB |
g++ | testcase_06 | AC | 6 ms | 4 MB |
g++ | testcase_07 | AC | 6 ms | 4 MB |
g++ | testcase_08 | AC | 6 ms | 4 MB |
g++ | testcase_09 | AC | 6 ms | 4 MB |
g++ | testcase_10 | AC | 6 ms | 4 MB |
g++ | testcase_11 | AC | 6 ms | 4 MB |
g++ | testcase_12 | AC | 6 ms | 4 MB |
g++ | testcase_13 | AC | 6 ms | 4 MB |
g++ | testcase_14 | AC | 6 ms | 4 MB |
g++ | testcase_15 | AC | 6 ms | 4 MB |
g++ | testcase_16 | AC | 6 ms | 4 MB |
g++ | testcase_17 | AC | 6 ms | 4 MB |
g++ | testcase_18 | AC | 7 ms | 4 MB |
g++ | testcase_19 | AC | 7 ms | 4 MB |
g++ | testcase_20 | AC | 7 ms | 4 MB |
g++ | testcase_21 | AC | 7 ms | 4 MB |
g++ | testcase_22 | AC | 6 ms | 4 MB |
g++ | testcase_23 | AC | 6 ms | 4 MB |
g++ | testcase_24 | AC | 6 ms | 4 MB |
g++ | testcase_25 | AC | 6 ms | 4 MB |
g++ | testcase_26 | AC | 6 ms | 4 MB |
g++ | testcase_27 | AC | 6 ms | 4 MB |
g++ | testcase_28 | AC | 6 ms | 4 MB |
g++ | testcase_29 | AC | 6 ms | 4 MB |
g++ | testcase_30 | AC | 6 ms | 4 MB |
g++ | testcase_31 | AC | 6 ms | 4 MB |
g++ | testcase_32 | AC | 42 ms | 5 MB |
g++ | testcase_33 | AC | 68 ms | 7 MB |
g++ | testcase_34 | AC | 141 ms | 10 MB |
g++ | testcase_35 | AC | 117 ms | 17 MB |
g++ | testcase_36 | AC | 155 ms | 17 MB |
g++ | testcase_37 | AC | 16 ms | 4 MB |
g++ | testcase_38 | AC | 16 ms | 4 MB |
g++ | testcase_39 | AC | 16 ms | 4 MB |
g++ | testcase_40 | AC | 23 ms | 4 MB |
g++ | testcase_41 | AC | 16 ms | 4 MB |
g++ | testcase_42 | AC | 16 ms | 4 MB |
g++ | testcase_43 | AC | 16 ms | 4 MB |
g++ | testcase_44 | AC | 16 ms | 4 MB |
g++ | testcase_45 | AC | 16 ms | 4 MB |
g++ | testcase_46 | AC | 16 ms | 4 MB |
g++ | testcase_47 | AC | 42 ms | 5 MB |
g++ | testcase_48 | AC | 41 ms | 5 MB |
g++ | testcase_49 | AC | 42 ms | 5 MB |
g++ | testcase_50 | AC | 69 ms | 7 MB |
g++ | testcase_51 | AC | 68 ms | 7 MB |
g++ | testcase_52 | AC | 68 ms | 7 MB |
g++ | testcase_53 | AC | 305 ms | 17 MB |
g++ | testcase_54 | AC | 307 ms | 17 MB |
g++ | testcase_55 | AC | 300 ms | 17 MB |
g++ | testcase_56 | AC | 300 ms | 17 MB |
g++ | testcase_57 | AC | 306 ms | 17 MB |
g++ | testcase_58 | AC | 302 ms | 17 MB |
g++ | testcase_59 | AC | 302 ms | 17 MB |
g++ | testcase_60 | AC | 305 ms | 17 MB |
g++ | testcase_61 | AC | 301 ms | 17 MB |
g++ | testcase_62 | AC | 304 ms | 17 MB |
clang++ | testcase_00 | AC | 6 ms | 4 MB |
clang++ | testcase_01 | AC | 6 ms | 4 MB |
clang++ | testcase_02 | AC | 6 ms | 4 MB |
clang++ | testcase_03 | AC | 6 ms | 4 MB |
clang++ | testcase_04 | AC | 6 ms | 4 MB |
clang++ | testcase_05 | AC | 6 ms | 4 MB |
clang++ | testcase_06 | AC | 6 ms | 4 MB |
clang++ | testcase_07 | AC | 6 ms | 4 MB |
clang++ | testcase_08 | AC | 6 ms | 4 MB |
clang++ | testcase_09 | AC | 6 ms | 4 MB |
clang++ | testcase_10 | AC | 6 ms | 4 MB |
clang++ | testcase_11 | AC | 7 ms | 4 MB |
clang++ | testcase_12 | AC | 6 ms | 4 MB |
clang++ | testcase_13 | AC | 7 ms | 4 MB |
clang++ | testcase_14 | AC | 7 ms | 4 MB |
clang++ | testcase_15 | AC | 7 ms | 4 MB |
clang++ | testcase_16 | AC | 6 ms | 4 MB |
clang++ | testcase_17 | AC | 6 ms | 4 MB |
clang++ | testcase_18 | AC | 6 ms | 4 MB |
clang++ | testcase_19 | AC | 6 ms | 4 MB |
clang++ | testcase_20 | AC | 6 ms | 4 MB |
clang++ | testcase_21 | AC | 6 ms | 4 MB |
clang++ | testcase_22 | AC | 6 ms | 4 MB |
clang++ | testcase_23 | AC | 6 ms | 4 MB |
clang++ | testcase_24 | AC | 6 ms | 4 MB |
clang++ | testcase_25 | AC | 6 ms | 4 MB |
clang++ | testcase_26 | AC | 6 ms | 4 MB |
clang++ | testcase_27 | AC | 6 ms | 4 MB |
clang++ | testcase_28 | AC | 6 ms | 4 MB |
clang++ | testcase_29 | AC | 6 ms | 4 MB |
clang++ | testcase_30 | AC | 6 ms | 4 MB |
clang++ | testcase_31 | AC | 7 ms | 4 MB |
clang++ | testcase_32 | AC | 42 ms | 5 MB |
clang++ | testcase_33 | AC | 69 ms | 7 MB |
clang++ | testcase_34 | AC | 142 ms | 10 MB |
clang++ | testcase_35 | AC | 123 ms | 17 MB |
clang++ | testcase_36 | AC | 166 ms | 17 MB |
clang++ | testcase_37 | AC | 17 ms | 4 MB |
clang++ | testcase_38 | AC | 16 ms | 4 MB |
clang++ | testcase_39 | AC | 16 ms | 4 MB |
clang++ | testcase_40 | AC | 16 ms | 4 MB |
clang++ | testcase_41 | AC | 16 ms | 4 MB |
clang++ | testcase_42 | AC | 16 ms | 4 MB |
clang++ | testcase_43 | AC | 16 ms | 4 MB |
clang++ | testcase_44 | AC | 16 ms | 4 MB |
clang++ | testcase_45 | AC | 16 ms | 4 MB |
clang++ | testcase_46 | AC | 16 ms | 4 MB |
clang++ | testcase_47 | AC | 43 ms | 5 MB |
clang++ | testcase_48 | AC | 43 ms | 5 MB |
clang++ | testcase_49 | AC | 43 ms | 5 MB |
clang++ | testcase_50 | AC | 70 ms | 7 MB |
clang++ | testcase_51 | AC | 71 ms | 7 MB |
clang++ | testcase_52 | AC | 70 ms | 7 MB |
clang++ | testcase_53 | AC | 309 ms | 17 MB |
clang++ | testcase_54 | AC | 312 ms | 17 MB |
clang++ | testcase_55 | AC | 304 ms | 17 MB |
clang++ | testcase_56 | AC | 314 ms | 17 MB |
clang++ | testcase_57 | AC | 314 ms | 17 MB |
clang++ | testcase_58 | AC | 305 ms | 17 MB |
clang++ | testcase_59 | AC | 305 ms | 17 MB |
clang++ | testcase_60 | AC | 310 ms | 17 MB |
clang++ | testcase_61 | AC | 312 ms | 17 MB |
clang++ | testcase_62 | AC | 311 ms | 17 MB |