結果
| 問題 | No.1441 MErGe |
| ユーザー |
 maspy
|
| 提出日時 | 2022-09-20 05:03:11 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 385 ms / 1,000 ms |
| コード長 | 20,583 bytes |
| コンパイル時間 | 3,548 ms |
| コンパイル使用メモリ | 234,260 KB |
| 実行使用メモリ | 27,428 KB |
| 最終ジャッジ日時 | 2023-08-23 19:22:09 |
| 合計ジャッジ時間 | 14,486 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,376 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 2 ms
4,376 KB |
| testcase_03 | AC | 3 ms
4,380 KB |
| testcase_04 | AC | 2 ms
4,380 KB |
| testcase_05 | AC | 7 ms
4,376 KB |
| testcase_06 | AC | 7 ms
4,384 KB |
| testcase_07 | AC | 6 ms
4,380 KB |
| testcase_08 | AC | 68 ms
6,608 KB |
| testcase_09 | AC | 65 ms
6,888 KB |
| testcase_10 | AC | 121 ms
6,572 KB |
| testcase_11 | AC | 109 ms
6,844 KB |
| testcase_12 | AC | 122 ms
8,004 KB |
| testcase_13 | AC | 315 ms
20,072 KB |
| testcase_14 | AC | 313 ms
20,028 KB |
| testcase_15 | AC | 309 ms
20,384 KB |
| testcase_16 | AC | 315 ms
19,992 KB |
| testcase_17 | AC | 297 ms
20,008 KB |
| testcase_18 | AC | 170 ms
12,776 KB |
| testcase_19 | AC | 194 ms
14,096 KB |
| testcase_20 | AC | 150 ms
12,088 KB |
| testcase_21 | AC | 131 ms
10,168 KB |
| testcase_22 | AC | 199 ms
10,332 KB |
| testcase_23 | AC | 372 ms
21,016 KB |
| testcase_24 | AC | 382 ms
20,644 KB |
| testcase_25 | AC | 385 ms
21,452 KB |
| testcase_26 | AC | 381 ms
21,016 KB |
| testcase_27 | AC | 374 ms
21,020 KB |
| testcase_28 | AC | 45 ms
27,428 KB |
| testcase_29 | AC | 45 ms
26,984 KB |
ソースコード
#line 1 "main.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1441"
#line 1 "library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
ll SUM(vector<int> &A) {
ll sum = 0;
for (auto &&a: A) sum += a;
return sum;
}
template <typename T>
T SUM(vector<T> &A) {
T sum = T(0);
for (auto &&a: A) sum += a;
return sum;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T pick(deque<T> &que) {
assert(que.size());
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T pick(pq<T> &que) {
assert(que.size());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(pqg<T> &que) {
assert(que.size());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(vc<T> &que) {
assert(que.size());
T a = que.back();
que.pop_back();
return a;
}
template <typename T, typename U>
T ceil(T x, U y) {
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
T q = floor(x, y);
return {q, x - q * y};
}
ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
if (check(x))
ok = x;
else
ng = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
if (check(x)) {
ok = x;
} else {
ng = x;
}
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
vi s_to_vi(const string &S, char first_char) {
vi A(S.size());
FOR(i, S.size()) { A[i] = S[i] - first_char; }
return A;
}
template <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
vc<CNT> C(size);
for (auto &&x: A) { ++C[x]; }
return C;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
// stable
vector<int> ids(A.size());
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
int n = len(I);
vc<T> B(n);
FOR(i, n) B[i] = A[I[i]];
return B;
}
#line 1 "library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>
namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;
struct Scanner {
FILE *fp;
char line[(1 << 15) + 1];
size_t st = 0, ed = 0;
void reread() {
memmove(line, line + st, ed - st);
ed -= st;
st = 0;
ed += fread(line + ed, 1, (1 << 15) - ed, fp);
line[ed] = '\0';
}
bool succ() {
while (true) {
if (st == ed) {
reread();
if (st == ed) return false;
}
while (st != ed && isspace(line[st])) st++;
if (st != ed) break;
}
if (ed - st <= 50) {
bool sep = false;
for (size_t i = st; i < ed; i++) {
if (isspace(line[i])) {
sep = true;
break;
}
}
if (!sep) reread();
}
return true;
}
template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
while (true) {
size_t sz = 0;
while (st + sz < ed && !isspace(line[st + sz])) sz++;
ref.append(line + st, sz);
st += sz;
if (!sz || st != ed) break;
reread();
}
return true;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
bool neg = false;
if (line[st] == '-') {
neg = true;
st++;
}
ref = T(0);
while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
if (neg) ref = -ref;
return true;
}
template <class T, is_modint_t<T> * = nullptr>
bool read_single(T &ref) {
long long val = 0;
bool f = read_single(val);
ref = T(val);
return f;
}
bool read_single(double &ref) {
string s;
if (!read_single(s)) return false;
ref = std::stod(s);
return true;
}
bool read_single(char &ref) {
string s;
if (!read_single(s) || s.size() != 1) return false;
ref = s[0];
return true;
}
template <class T>
bool read_single(vector<T> &ref) {
for (auto &d: ref) {
if (!read_single(d)) return false;
}
return true;
}
template <class T, class U>
bool read_single(pair<T, U> &p) {
return (read_single(p.first) && read_single(p.second));
}
template <class A, class B, class C>
bool read_single(tuple<A, B, C> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)));
}
template <class A, class B, class C, class D>
bool read_single(tuple<A, B, C, D> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)) && read_single(get<3>(p)));
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
bool f = read_single(h);
assert(f);
read(t...);
}
Scanner(FILE *fp) : fp(fp) {}
};
struct Printer {
Printer(FILE *_fp) : fp(_fp) {}
~Printer() { flush(); }
static constexpr size_t SIZE = 1 << 15;
FILE *fp;
char line[SIZE], small[50];
size_t pos = 0;
void flush() {
fwrite(line, 1, pos, fp);
pos = 0;
}
void write(const char &val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void write(T val) {
if (pos > (1 << 15) - 50) flush();
if (val == 0) {
write('0');
return;
}
if (val < 0) {
write('-');
val = -val; // todo min
}
size_t len = 0;
while (val) {
small[len++] = char(0x30 | (val % 10));
val /= 10;
}
for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
pos += len;
}
void write(const string &s) {
for (char c: s) write(c);
}
void write(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) write(s[i]);
}
void write(const double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
void write(const long double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
template <class T, is_modint_t<T> * = nullptr>
void write(T &ref) {
write(ref.val);
}
template <class T>
void write(const vector<T> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
template <class T, class U>
void write(const pair<T, U> &val) {
write(val.first);
write(' ');
write(val.second);
}
template <class A, class B, class C>
void write(const tuple<A, B, C> &val) {
auto &[a, b, c] = val;
write(a), write(' '), write(b), write(' '), write(c);
}
template <class A, class B, class C, class D>
void write(const tuple<A, B, C, D> &val) {
auto &[a, b, c, d] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
}
template <class A, class B, class C, class D, class E>
void write(const tuple<A, B, C, D, E> &val) {
auto &[a, b, c, d, e] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
}
template <class A, class B, class C, class D, class E, class F>
void write(const tuple<A, B, C, D, E, F> &val) {
auto &[a, b, c, d, e, f] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
}
template <class T, size_t S>
void write(const array<T, S> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
void write(i128 val) {
string s;
bool negative = 0;
if(val < 0){
negative = 1;
val = -val;
}
while (val) {
s += '0' + int(val % 10);
val /= 10;
}
if(negative) s += "-";
reverse(all(s));
if (len(s) == 0) s = "0";
write(s);
}
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
printer.write(head);
if (sizeof...(Tail)) printer.write(' ');
print(forward<Tail>(tail)...);
}
void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
scanner.read(head);
read(tail...);
}
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 1 "library/bbst/splaytree_monoid.hpp"
/*
・ある Node にアクセスするときには、その先祖は伝搬済
・prod, rev_prod は、rev を反映済のものを持つ
・l, r にも rev を反映させたものを持つ
*/
template <typename Monoid, int NODES = 1'000'000>
struct SplayTree_Monoid {
using X = typename Monoid::value_type;
struct Node {
Node *l, *r, *p;
X x, prod, rev_prod;
int size;
bool rev;
};
Node *pool;
int pid;
SplayTree_Monoid() : pid(0) { pool = new Node[NODES]; }
void reset() { pid = 0; }
Node *new_node(const X &x) {
pool[pid].l = pool[pid].r = pool[pid].p = nullptr;
pool[pid].x = x;
pool[pid].prod = x;
pool[pid].rev_prod = x;
pool[pid].size = 1;
pool[pid].rev = 0;
return &(pool[pid++]);
}
Node *new_node(const vc<X> &dat) {
auto dfs = [&](auto &dfs, int l, int r) -> Node * {
if (l == r) return nullptr;
if (r == l + 1) return new_node(dat[l]);
int m = (l + r) / 2;
Node *l_root = dfs(dfs, l, m);
Node *r_root = dfs(dfs, m + 1, r);
Node *root = new_node(dat[m]);
root->l = l_root, root->r = r_root;
if (l_root) l_root->p = root;
if (r_root) r_root->p = root;
update(root);
return root;
};
return dfs(dfs, 0, len(dat));
}
// k 番目が根に来るように splay する
void get_kth(Node *&root, int k) {
assert(root && 0 <= k && k < (root->size));
while (1) {
prop(root);
int lsize = (root->l ? root->l->size : 0);
if (k < lsize) root = root->l;
if (k == lsize) { break; }
if (k > lsize) {
k -= lsize + 1;
root = root->r;
}
}
splay(root);
}
// 左に右をマージ
void merge(Node *&root, Node *r_root) {
if (!root) {
root = r_root;
return;
}
if (!r_root) return;
get_kth(root, root->size - 1);
root->r = r_root;
r_root->p = root;
update(root);
}
// 左右に分けて、root を左側に変更。右側を return する。
Node *split(Node *&root, int l_size) {
if (!root) { return nullptr; }
assert(0 <= l_size && l_size <= root->size);
if (l_size == 0) {
Node *res = root;
root = nullptr;
return res;
}
if (l_size == root->size) return nullptr;
get_kth(root, l_size - 1);
Node *res = root->r;
root->r = nullptr;
res->p = nullptr;
update(root);
return res;
}
X prod(Node *&root, int l, int r) {
assert(0 <= l && l <= r && r <= root->size);
if (l == r) return Monoid::unit();
Node *r_root = split(root, r);
Node *m_root = split(root, l);
X res = m_root->prod;
merge(root, m_root);
merge(root, r_root);
return res;
}
void reverse(Node *&root, int l, int r) {
assert(0 <= l && l <= r && r <= root->size);
if (r - l <= 1) return;
Node *r_root = split(root, r);
Node *m_root = split(root, l);
m_root->rev ^= 1;
swap(m_root->l, m_root->r);
swap(m_root->prod, m_root->rev_prod);
merge(root, m_root);
merge(root, r_root);
}
// root の k 番目に n を挿入する
void insert(Node *&root, int k, Node *n) {
if (!root) {
assert(k == 0);
root = n;
return;
}
assert(0 <= k && k <= root->size);
auto r_root = split(root, k);
merge(root, n);
merge(root, r_root);
}
void insert(Node *&root, int k, const X &x) { insert(root, k, new_node(x)); }
void set(Node *&root, int k, const X &x) {
get_kth(root, k);
root->x = x;
update(root);
}
// root から k 番目を削除。削除したノードをかえす
Node *erase(Node *&root, int k) {
assert(0 <= k && k < root->size);
get_kth(root, k);
Node *l_root = root->l;
Node *r_root = root->r;
if (l_root) l_root->p = nullptr;
if (r_root) r_root->p = nullptr;
root->l = nullptr;
root->r = nullptr;
root->prod = root->x;
root->size = 1;
merge(l_root, r_root);
swap(root, l_root);
return l_root;
}
vc<X> get_all(Node *root) {
vc<X> res;
auto dfs = [&](auto &dfs, Node *n) -> void {
if (!n) return;
dfs(dfs, n->l);
res.eb(n->x);
dfs(dfs, n->r);
};
dfs(dfs, root);
return res;
}
void debug(Node *root) {
print("splay tree");
string s;
auto dfs = [&](auto &dfs, Node *n) -> void {
if (!n) return;
if (n->l) assert(n->l->p == n);
if (n->r) assert(n->r->p == n);
s += "l";
dfs(dfs, n->l);
s.pop_back();
print(s, "size", n->size, "x", n->x, "prod", n->prod, "rev_prod",
n->rev_prod);
s += "r";
dfs(dfs, n->r);
s.pop_back();
};
dfs(dfs, root);
}
private:
void prop(Node *c) {
if (!c->rev) return;
c->rev = 0;
if (c->l) {
c->l->rev ^= 1;
swap(c->l->l, c->l->r);
swap(c->l->prod, c->l->rev_prod);
}
if (c->r) {
c->r->rev ^= 1;
swap(c->r->l, c->r->r);
swap(c->r->prod, c->r->rev_prod);
}
}
void update(Node *c) {
c->size = 1;
c->prod = c->x;
c->rev_prod = c->x;
if (c->l) {
c->size += c->l->size;
c->prod = Monoid::op(c->l->prod, c->prod);
c->rev_prod = Monoid::op(c->rev_prod, c->l->rev_prod);
}
if (c->r) {
c->size += c->r->size;
c->prod = Monoid::op(c->prod, c->r->prod);
c->rev_prod = Monoid::op(c->r->rev_prod, c->rev_prod);
}
}
void rotate(Node *n) {
// n を根に近づける
Node *pp, *p, *c;
p = n->p;
pp = p->p;
if (p->l == n) {
c = n->r;
n->r = p;
p->l = c;
} else {
c = n->l;
n->l = p;
p->r = c;
}
if (pp && pp->l == p) pp->l = n;
if (pp && pp->r == p) pp->r = n;
n->p = pp;
p->p = n;
if (c) c->p = p;
}
inline int state(Node *n) {
if (!n->p) return 0;
if (n->p->l == n) return 1;
return -1;
}
// c の先祖は prop 済である
void splay(Node *c) {
while (c->p) {
Node *p = c->p;
Node *pp = (p ? p->p : nullptr);
if (state(p) == 0) { rotate(c); }
elif (state(c) == state(p)) {
rotate(p);
rotate(c);
}
else {
rotate(c);
rotate(c);
}
if (pp) update(pp);
if (p) update(p);
}
update(c);
}
};
#line 2 "library/alg/group_add.hpp"
template <typename E>
struct Group_Add {
using X = E;
using value_type = X;
static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
static constexpr X inverse(const X &x) noexcept { return -x; }
static constexpr X power(const X &x, ll n) noexcept { return X(n) * x; }
static constexpr X unit() { return X(0); }
static constexpr bool commute = true;
};
#line 6 "main.cpp"
void solve() {
LL(N, Q);
VEC(ll, A, N);
SplayTree_Monoid<Group_Add<ll>> ST;
auto root = ST.new_node(A);
FOR(Q) {
LL(t, l, r);
--l;
if (t == 1) {
auto nr = ST.split(root, r);
auto nm = ST.split(root, l);
nm = ST.new_node(nm->prod);
ST.merge(root, nm);
ST.merge(root, nr);
}
if (t == 2) { print(ST.prod(root, l, r)); }
}
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15);
ll T = 1;
// LL(T);
FOR(T) solve();
return 0;
}