結果
問題 | No.789 範囲の合計 |
ユーザー | maspy |
提出日時 | 2024-09-09 10:14:59 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 96 ms / 1,000 ms |
コード長 | 20,919 bytes |
コンパイル時間 | 4,947 ms |
コンパイル使用メモリ | 302,136 KB |
実行使用メモリ | 63,484 KB |
最終ジャッジ日時 | 2024-09-09 10:15:08 |
合計ジャッジ時間 | 7,696 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 88 ms
51,500 KB |
testcase_03 | AC | 34 ms
6,940 KB |
testcase_04 | AC | 96 ms
57,676 KB |
testcase_05 | AC | 67 ms
48,680 KB |
testcase_06 | AC | 69 ms
52,048 KB |
testcase_07 | AC | 32 ms
6,944 KB |
testcase_08 | AC | 76 ms
63,484 KB |
testcase_09 | AC | 66 ms
56,752 KB |
testcase_10 | AC | 69 ms
35,652 KB |
testcase_11 | AC | 52 ms
50,676 KB |
testcase_12 | AC | 52 ms
50,168 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,944 KB |
ソースコード
#line 1 "main.cpp" #define PROBLEM "https://yukicoder.me/problems/no/789" #line 1 "library/my_template.hpp" #if defined(LOCAL) #include <my_template_compiled.hpp> #else // https://codeforces.com/blog/entry/96344 #pragma GCC optimize("Ofast,unroll-loops") // いまの CF だとこれ入れると動かない? // #pragma GCC target("avx2,popcnt") #include <bits/stdc++.h> using namespace std; using ll = long long; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; using u128 = unsigned __int128; using f128 = __float128; template <class T> constexpr T infty = 0; template <> constexpr int infty<int> = 1'010'000'000; template <> constexpr ll infty<ll> = 2'020'000'000'000'000'000; template <> constexpr u32 infty<u32> = infty<int>; template <> constexpr u64 infty<u64> = infty<ll>; template <> constexpr i128 infty<i128> = i128(infty<ll>) * 2'000'000'000'000'000'000; template <> constexpr double infty<double> = infty<ll>; template <> constexpr long double infty<long double> = infty<ll>; using pi = pair<ll, ll>; using vi = vector<ll>; 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 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 overload4(a, b, c, d, e, ...) e #define overload3(a, b, c, d, ...) d #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) overload3(__VA_ARGS__, 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 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); } int popcnt_mod_2(int x) { return __builtin_parity(x); } int popcnt_mod_2(u32 x) { return __builtin_parity(x); } int popcnt_mod_2(ll x) { return __builtin_parityll(x); } int popcnt_mod_2(u64 x) { return __builtin_parityll(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 floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); } template <typename T> T ceil(T x, T y) { return floor(x + y - 1, y); } template <typename T> T bmod(T x, T y) { return x - y * floor(x, y); } template <typename T> pair<T, T> divmod(T x, T y) { T q = floor(x, y); return {q, x - q * y}; } template <typename T, typename U> T SUM(const vector<U> &A) { T sm = 0; for (auto &&a: A) sm += a; return sm; } #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()), x.shrink_to_fit() template <typename T> T POP(deque<T> &que) { T a = que.front(); que.pop_front(); return a; } template <typename T> T POP(pq<T> &que) { T a = que.top(); que.pop(); return a; } template <typename T> T POP(pqg<T> &que) { T a = que.top(); que.pop(); return a; } template <typename T> T POP(vc<T> &que) { T a = que.back(); que.pop_back(); return a; } template <typename F> ll binary_search(F check, ll ok, ll ng, bool check_ok = true) { if (check_ok) assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; (check(x) ? ok : 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; (check(x) ? ok : 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); } // ? は -1 vc<int> s_to_vi(const string &S, char first_char) { vc<int> A(S.size()); FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); } return A; } template <typename T, typename U> vector<T> cumsum(vector<U> &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; } // stable sort template <typename T> vector<int> argsort(const vector<T> &A) { vector<int> ids(len(A)); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); }); return ids; } // A[I[0]], A[I[1]], ... template <typename T> vc<T> rearrange(const vc<T> &A, const vc<int> &I) { vc<T> B(len(I)); FOR(i, len(I)) B[i] = A[I[i]]; return B; } template <typename T, typename... Vectors> void concat(vc<T> &first, const Vectors &... others) { vc<T> &res = first; (res.insert(res.end(), others.begin(), others.end()), ...); } #endif #line 1 "library/other/io.hpp" #define FASTIO #include <unistd.h> // https://judge.yosupo.jp/submission/21623 namespace fastio { static constexpr uint32_t SZ = 1 << 17; char ibuf[SZ]; char obuf[SZ]; char out[100]; // pointer of ibuf, obuf uint32_t pil = 0, pir = 0, por = 0; struct Pre { char num[10000][4]; constexpr Pre() : num() { for (int i = 0; i < 10000; i++) { int n = i; for (int j = 3; j >= 0; j--) { num[i][j] = n % 10 | '0'; n /= 10; } } } } constexpr pre; inline void load() { memcpy(ibuf, ibuf + pil, pir - pil); pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin); pil = 0; if (pir < SZ) ibuf[pir++] = '\n'; } inline void flush() { fwrite(obuf, 1, por, stdout); por = 0; } void rd(char &c) { do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); } void rd(string &x) { x.clear(); char c; do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); do { x += c; if (pil == pir) load(); c = ibuf[pil++]; } while (!isspace(c)); } template <typename T> void rd_real(T &x) { string s; rd(s); x = stod(s); } template <typename T> void rd_integer(T &x) { if (pil + 100 > pir) load(); char c; do c = ibuf[pil++]; while (c < '-'); bool minus = 0; if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (c == '-') { minus = 1, c = ibuf[pil++]; } } x = 0; while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; } if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (minus) x = -x; } } void rd(int &x) { rd_integer(x); } void rd(ll &x) { rd_integer(x); } void rd(i128 &x) { rd_integer(x); } void rd(u32 &x) { rd_integer(x); } void rd(u64 &x) { rd_integer(x); } void rd(u128 &x) { rd_integer(x); } void rd(double &x) { rd_real(x); } void rd(long double &x) { rd_real(x); } void rd(f128 &x) { rd_real(x); } template <class T, class U> void rd(pair<T, U> &p) { return rd(p.first), rd(p.second); } template <size_t N = 0, typename T> void rd_tuple(T &t) { if constexpr (N < std::tuple_size<T>::value) { auto &x = std::get<N>(t); rd(x); rd_tuple<N + 1>(t); } } template <class... T> void rd(tuple<T...> &tpl) { rd_tuple(tpl); } template <size_t N = 0, typename T> void rd(array<T, N> &x) { for (auto &d: x) rd(d); } template <class T> void rd(vc<T> &x) { for (auto &d: x) rd(d); } void read() {} template <class H, class... T> void read(H &h, T &... t) { rd(h), read(t...); } void wt(const char c) { if (por == SZ) flush(); obuf[por++] = c; } void wt(const string s) { for (char c: s) wt(c); } void wt(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) wt(s[i]); } template <typename T> void wt_integer(T x) { if (por > SZ - 100) flush(); if (x < 0) { obuf[por++] = '-', x = -x; } int outi; for (outi = 96; x >= 10000; outi -= 4) { memcpy(out + outi, pre.num[x % 10000], 4); x /= 10000; } if (x >= 1000) { memcpy(obuf + por, pre.num[x], 4); por += 4; } else if (x >= 100) { memcpy(obuf + por, pre.num[x] + 1, 3); por += 3; } else if (x >= 10) { int q = (x * 103) >> 10; obuf[por] = q | '0'; obuf[por + 1] = (x - q * 10) | '0'; por += 2; } else obuf[por++] = x | '0'; memcpy(obuf + por, out + outi + 4, 96 - outi); por += 96 - outi; } template <typename T> void wt_real(T x) { ostringstream oss; oss << fixed << setprecision(15) << double(x); string s = oss.str(); wt(s); } void wt(int x) { wt_integer(x); } void wt(ll x) { wt_integer(x); } void wt(i128 x) { wt_integer(x); } void wt(u32 x) { wt_integer(x); } void wt(u64 x) { wt_integer(x); } void wt(u128 x) { wt_integer(x); } void wt(double x) { wt_real(x); } void wt(long double x) { wt_real(x); } void wt(f128 x) { wt_real(x); } template <class T, class U> void wt(const pair<T, U> val) { wt(val.first); wt(' '); wt(val.second); } template <size_t N = 0, typename T> void wt_tuple(const T t) { if constexpr (N < std::tuple_size<T>::value) { if constexpr (N > 0) { wt(' '); } const auto x = std::get<N>(t); wt(x); wt_tuple<N + 1>(t); } } template <class... T> void wt(tuple<T...> tpl) { wt_tuple(tpl); } template <class T, size_t S> void wt(const array<T, S> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } template <class T> void wt(const vector<T> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } void print() { wt('\n'); } template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) { wt(head); if (sizeof...(Tail)) wt(' '); print(forward<Tail>(tail)...); } // gcc expansion. called automaticall after main. void __attribute__((destructor)) _d() { flush(); } } // namespace fastio using fastio::read; using fastio::print; using fastio::flush; #if defined(LOCAL) #define SHOW(...) SHOW_IMPL(__VA_ARGS__, SHOW6, SHOW5, SHOW4, SHOW3, SHOW2, SHOW1)(__VA_ARGS__) #define SHOW_IMPL(_1, _2, _3, _4, _5, _6, NAME, ...) NAME #define SHOW1(x) print(#x, "=", (x)), flush() #define SHOW2(x, y) print(#x, "=", (x), #y, "=", (y)), flush() #define SHOW3(x, y, z) print(#x, "=", (x), #y, "=", (y), #z, "=", (z)), flush() #define SHOW4(x, y, z, w) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w)), flush() #define SHOW5(x, y, z, w, v) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", (v)), flush() #define SHOW6(x, y, z, w, v, u) print(#x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", (v), #u, "=", (u)), flush() #else #define SHOW(...) #endif #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define U32(...) \ u32 __VA_ARGS__; \ read(__VA_ARGS__) #define U64(...) \ u64 __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 2 "library/ds/segtree/dynamic_lazy_segtree.hpp" // Q*2logN 程度必要 template <typename ActedMonoid, bool PERSISTENT> struct Dynamic_Lazy_SegTree { using AM = ActedMonoid; using MX = typename AM::Monoid_X; using MA = typename AM::Monoid_A; using X = typename AM::X; using A = typename AM::A; using F = function<X(ll, ll)>; F default_prod; struct Node { Node *l, *r; X x; A lazy; }; const int NODES; const ll L0, R0; Node *pool; int pid; using np = Node *; Dynamic_Lazy_SegTree( int NODES, ll L0, ll R0, F default_prod = [](ll l, ll r) -> X { return MX::unit(); }) : default_prod(default_prod), NODES(NODES), L0(L0), R0(R0), pid(0) { pool = new Node[NODES]; } ~Dynamic_Lazy_SegTree() { delete[] pool; } np new_root() { return new_node(L0, R0); } np new_node(const X x) { assert(pid < NODES); pool[pid].l = pool[pid].r = nullptr; pool[pid].x = x; pool[pid].lazy = MA::unit(); return &(pool[pid++]); } np new_node(ll l, ll r) { return new_node(default_prod(l, r)); } np new_node() { return new_node(L0, R0); } np new_node(const vc<X> &dat) { assert(L0 == 0 && R0 == len(dat)); auto dfs = [&](auto &dfs, ll l, ll r) -> Node * { if (l == r) return nullptr; if (r == l + 1) return new_node(dat[l]); ll m = (l + r) / 2; np l_root = dfs(dfs, l, m), r_root = dfs(dfs, m, r); X x = MX::op(l_root->x, r_root->x); np root = new_node(x); root->l = l_root, root->r = r_root; return root; }; return dfs(dfs, 0, len(dat)); } X prod(np root, ll l, ll r) { if (l == r || !root) return MX::unit(); assert(pid && L0 <= l && l < r && r <= R0); X x = MX::unit(); prod_rec(root, L0, R0, l, r, x, MA::unit()); return x; } X prod_all(np root) { return prod(root, L0, R0); } np set(np root, ll i, const X &x) { assert(pid && L0 <= i && i < R0); return set_rec(root, L0, R0, i, x); } np multiply(np root, ll i, const X &x) { assert(pid && L0 <= i && i < R0); return multiply_rec(root, L0, R0, i, x); } np apply(np root, ll l, ll r, const A &a) { if (l == r) return root; assert(pid && L0 <= l && l < r && r <= R0); return apply_rec(root, L0, R0, l, r, a); } template <typename F> ll max_right(np root, F check, ll L) { assert(pid && L0 <= L && L <= R0 && check(MX::unit())); X x = MX::unit(); return max_right_rec(root, check, L0, R0, L, x); } template <typename F> ll min_left(np root, F check, ll R) { assert(pid && L0 <= R && R <= R0 && check(MX::unit())); X x = MX::unit(); return min_left_rec(root, check, L0, R0, R, x); } // f(idx, val) template <typename F> void enumerate(np root, F f) { auto dfs = [&](auto &dfs, np c, ll l, ll r, A a) -> void { if (!c) return; if (r - l == 1) { f(l, AM::act(c->x, a, 1)); return; } ll m = (l + r) / 2; a = MA::op(c->lazy, a); dfs(dfs, c->l, l, m, a); dfs(dfs, c->r, m, r, a); }; dfs(dfs, root, L0, R0, MA::unit()); } void reset() { pid = 0; } private: np copy_node(np c) { if (!c || !PERSISTENT) return c; pool[pid].l = c->l, pool[pid].r = c->r; pool[pid].x = c->x; pool[pid].lazy = c->lazy; return &(pool[pid++]); } void prop(np c, ll l, ll r) { assert(r - l >= 2); ll m = (l + r) / 2; if (c->lazy == MA::unit()) return; c->l = (c->l ? copy_node(c->l) : new_node(l, m)); c->l->x = AM::act(c->l->x, c->lazy, m - l); c->l->lazy = MA::op(c->l->lazy, c->lazy); c->r = (c->r ? copy_node(c->r) : new_node(m, r)); c->r->x = AM::act(c->r->x, c->lazy, r - m); c->r->lazy = MA::op(c->r->lazy, c->lazy); c->lazy = MA::unit(); } np set_rec(np c, ll l, ll r, ll i, const X &x) { if (r == l + 1) { c = copy_node(c); c->x = x; c->lazy = MA::unit(); return c; } prop(c, l, r); ll m = (l + r) / 2; if (!c->l) c->l = new_node(l, m); if (!c->r) c->r = new_node(m, r); c = copy_node(c); if (i < m) { c->l = set_rec(c->l, l, m, i, x); } else { c->r = set_rec(c->r, m, r, i, x); } c->x = MX::op(c->l->x, c->r->x); return c; } np multiply_rec(np c, ll l, ll r, ll i, const X &x) { if (r == l + 1) { c = copy_node(c); c->x = MX::op(c->x, x); c->lazy = MA::unit(); return c; } prop(c, l, r); ll m = (l + r) / 2; if (!c->l) c->l = new_node(l, m); if (!c->r) c->r = new_node(m, r); c = copy_node(c); if (i < m) { c->l = multiply_rec(c->l, l, m, i, x); } else { c->r = multiply_rec(c->r, m, r, i, x); } c->x = MX::op(c->l->x, c->r->x); return c; } void prod_rec(np c, ll l, ll r, ll ql, ll qr, X &x, A lazy) { chmax(ql, l); chmin(qr, r); if (ql >= qr) return; if (!c) { x = MX::op(x, AM::act(default_prod(ql, qr), lazy, qr - ql)); return; } if (l == ql && r == qr) { x = MX::op(x, AM::act(c->x, lazy, r - l)); return; } ll m = (l + r) / 2; lazy = MA::op(c->lazy, lazy); prod_rec(c->l, l, m, ql, qr, x, lazy); prod_rec(c->r, m, r, ql, qr, x, lazy); } np apply_rec(np c, ll l, ll r, ll ql, ll qr, const A &a) { if (!c) c = new_node(l, r); chmax(ql, l); chmin(qr, r); if (ql >= qr) return c; if (l == ql && r == qr) { c = copy_node(c); c->x = AM::act(c->x, a, r - l); c->lazy = MA::op(c->lazy, a); return c; } prop(c, l, r); ll m = (l + r) / 2; c = copy_node(c); c->l = apply_rec(c->l, l, m, ql, qr, a); c->r = apply_rec(c->r, m, r, ql, qr, a); c->x = MX::op(c->l->x, c->r->x); return c; } template <typename F> ll max_right_rec(np c, const F &check, ll l, ll r, ll ql, X &x) { if (r <= ql) return r; if (!c) c = new_node(l, r); chmax(ql, l); if (l == ql && check(MX::op(x, c->x))) { x = MX::op(x, c->x); return r; } if (r == l + 1) return l; prop(c, l, r); ll m = (l + r) / 2; ll k = max_right_rec(c->l, check, l, m, ql, x); if (k < m) return k; return max_right_rec(c->r, check, m, r, ql, x); } template <typename F> ll min_left_rec(np c, const F &check, ll l, ll r, ll qr, X &x) { if (qr <= l) return l; if (!c) c = new_node(l, r); chmin(qr, r); if (r == qr && check(MX::op(c->x, x))) { x = MX::op(c->x, x); return l; } if (r == l + 1) return r; prop(c, l, r); ll m = (l + r) / 2; ll k = min_left_rec(c->r, check, m, r, qr, x); if (m < k) return k; return min_left_rec(c->l, check, l, m, qr, x); } }; #line 2 "library/alg/monoid/add.hpp" template <typename E> struct Monoid_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 2 "library/alg/acted_monoid/sum_add.hpp" template <typename E> struct ActedMonoid_Sum_Add { using Monoid_X = Monoid_Add<E>; using Monoid_A = Monoid_Add<E>; using X = typename Monoid_X::value_type; using A = typename Monoid_A::value_type; static constexpr X act(const X &x, const A &a, const ll &size) { return x + a * E(size); } }; #line 6 "main.cpp" void solve() { LL(Q); using AM = ActedMonoid_Sum_Add<ll>; Dynamic_Lazy_SegTree<AM, false> seg(60 * Q, 0, infty<int>); auto root = seg.new_node(); ll ANS = 0; FOR(Q) { LL(t, a, b); if (t == 0) { seg.apply(root, a, a + 1, b); } if (t == 1) { ANS += seg.prod(root, a, b + 1); } } print(ANS); } signed main() { solve(); return 0; }