結果
| 問題 | No.789 範囲の合計 |
| ユーザー |
 maspy
|
| 提出日時 | 2022-05-16 16:33:30 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 165 ms / 1,000 ms |
| コード長 | 18,038 bytes |
| コンパイル時間 | 2,371 ms |
| コンパイル使用メモリ | 217,244 KB |
| 実行使用メモリ | 84,696 KB |
| 最終ジャッジ日時 | 2024-09-14 08:43:26 |
| 合計ジャッジ時間 | 4,807 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 24 ms
81,496 KB |
| testcase_01 | AC | 24 ms
81,616 KB |
| testcase_02 | AC | 150 ms
84,080 KB |
| testcase_03 | AC | 87 ms
81,676 KB |
| testcase_04 | AC | 165 ms
84,532 KB |
| testcase_05 | AC | 131 ms
83,960 KB |
| testcase_06 | AC | 142 ms
84,096 KB |
| testcase_07 | AC | 83 ms
81,620 KB |
| testcase_08 | AC | 143 ms
84,696 KB |
| testcase_09 | AC | 131 ms
84,480 KB |
| testcase_10 | AC | 136 ms
83,184 KB |
| testcase_11 | AC | 86 ms
84,480 KB |
| testcase_12 | AC | 86 ms
84,372 KB |
| testcase_13 | AC | 23 ms
81,616 KB |
| testcase_14 | AC | 23 ms
81,500 KB |
ソースコード
#line 1 "main.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/789"
#line 1 "/home/maspy/compro/library/my_template.hpp"
#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
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, 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 <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(A);
assert(len(I) == n);
vc<T> B(n);
FOR(i, n) B[i] = A[I[i]];
return B;
}
#line 1 "/home/maspy/compro/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 << setprecision(15) << x;
string s = oss.str();
write(s);
}
void write(const long double &x) {
ostringstream oss;
oss << 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 2 "/home/maspy/compro/library/ds/dynamic_lazysegtree.hpp"
template <class Lazy, int NODES = 5'000'000>
struct Dynamic_LazySegTree {
using Monoid_X = typename Lazy::X_structure;
using Monoid_A = typename Lazy::A_structure;
using X = typename Monoid_X::value_type;
using A = typename Monoid_A::value_type;
struct Node {
X x;
A a;
Node *l, *r;
Node() {}
Node(const X &x) : x(x), a(Monoid_A::unit()), l(nullptr), r(nullptr) {}
X get() { return Lazy::act(x, a); }
};
Node *pool;
int pid;
ll L, R;
Node *root;
function<X(ll, ll)> default_fn;
Dynamic_LazySegTree(ll L, ll R)
: Dynamic_LazySegTree(L, R, [](ll L, ll R) { return Monoid_X::unit(); }) {
}
Dynamic_LazySegTree(ll L, ll R, function<X(ll, ll)> f)
: pid(0), L(L), R(R), default_fn(f) {
pool = new Node[NODES];
root = new_node(L, R);
}
void reset() {
pid = 0;
root = new_node(L, R);
}
void set(ll i, const X &x) {
assert(L <= i && i < R);
set_rec(root, L, R, i, x);
}
void apply(ll l, ll r, const A &a) {
assert(L <= l && l <= r && r <= R);
apply_rec(root, L, R, l, r, a);
}
X prod(ll l, ll r) {
assert(L <= l && l <= r && r <= R);
return prod_rec(root, L, R, l, r);
}
X prod_all() { return root->get(); }
void debug() {
auto dfs = [&](auto &dfs, Node *n, ll l, ll r) -> void {
print("lr", l, r, "x", n->x, "a", n->a);
ll m = (l + r) / 2;
if (n->l) dfs(dfs, n->l, l, m);
if (n->r) dfs(dfs, n->r, m, r);
};
dfs(dfs, root, L, R);
}
private:
Node *new_node(ll node_l, ll node_r) {
pool[pid].x = default_fn(node_l, node_r);
pool[pid].a = Monoid_A::unit();
pool[pid].l = pool[pid].r = nullptr;
return &(pool[pid++]);
}
void prop(Node *n, ll node_l, ll node_r) {
if (n->a == Monoid_A::unit()) return;
ll node_m = (node_l + node_r) / 2;
if (!n->l) n->l = new_node(node_l, node_m);
if (!n->r) n->r = new_node(node_m, node_r);
(n->l)->a = Monoid_A::op((n->l)->a, n->a);
(n->r)->a = Monoid_A::op((n->r)->a, n->a);
n->x = Lazy::act(n->x, n->a);
n->a = Monoid_A::unit();
}
void set_rec(Node *n, ll node_l, ll node_r, ll idx, const X &x) {
if (node_r - node_l == 1) {
n->x = x;
n->a = Monoid_A::unit();
return;
}
ll node_m = (node_l + node_r) / 2;
prop(n, node_l, node_r);
if (idx < node_m) {
if (!(n->l)) n->l = new_node(node_l, node_m);
set_rec(n->l, node_l, node_m, idx, x);
} else {
if (!(n->r)) n->r = new_node(node_m, node_r);
set_rec(n->r, node_m, node_r, idx, x);
}
X xl = (n->l ? (n->l)->get() : Monoid_X::unit());
X xr = (n->r ? (n->r)->get() : Monoid_X::unit());
n->x = Monoid_X::op(xl, xr);
}
void apply_rec(Node *n, ll node_l, ll node_r, ll l, ll r, const A &a) {
chmax(l, node_l);
chmin(r, node_r);
if (l >= r) return;
if (l == node_l && r == node_r) {
n->a = Monoid_A::op(n->a, a);
return;
}
ll node_m = (node_l + node_r) / 2;
prop(n, node_l, node_r);
if (!(n->l)) n->l = new_node(node_l, node_m);
if (!(n->r)) n->r = new_node(node_m, node_r);
apply_rec(n->l, node_l, node_m, l, r, a);
apply_rec(n->r, node_m, node_r, l, r, a);
n->x = Monoid_X::op((n->l)->get(), (n->r)->get());
}
X prod_rec(Node *n, ll node_l, ll node_r, ll l, ll r) {
chmax(l, node_l);
chmin(r, node_r);
if (l >= r) return Monoid_X::unit();
if (l == node_l && r == node_r) return n->get();
ll node_m = (node_l + node_r) / 2;
prop(n, node_l, node_r);
X xl = (n->l ? prod_rec(n->l, node_l, node_m, l, r) : Monoid_X::unit());
X xr = (n->r ? prod_rec(n->r, node_m, node_r, l, r) : Monoid_X::unit());
return Monoid_X::op(xl, xr);
}
};
#line 2 "/home/maspy/compro/library/alg/group_add.hpp"
template <class X>
struct Group_Add {
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 n * x; }
static constexpr X unit() { return X(0); }
static constexpr bool commute = true;
};
#line 1 "/home/maspy/compro/library/alg/group_cntsum.hpp"
template <typename E = long long>
struct Group_CntSum {
using value_type = pair<E, E>;
using X = value_type;
static constexpr X op(const X &x, const X &y) {
return {x.fi + y.fi, x.se + y.se};
}
static constexpr X inverse(const X &x) { return {-x.fi, -x.se}; }
static constexpr X unit() { return {0, 0}; }
static constexpr bool commute = true;
};
#line 3 "/home/maspy/compro/library/alg/lazy_cntsum_add.hpp"
template <typename E>
struct Lazy_CntSum_Add {
using MX = Group_CntSum<E>;
using MA = Group_Add<E>;
using X_structure = MX;
using A_structure = MA;
using X = typename MX::value_type;
using A = typename MA::value_type;
static constexpr X act(const X &x, const A &a) {
return {x.fi, x.se + x.fi * a};
}
};
#line 6 "main.cpp"
void solve() {
Dynamic_LazySegTree<Lazy_CntSum_Add<ll>, 2000000> seg(0, 1LL << 30);
LL(Q);
ll ANS = 0;
set<int> ids;
FOR(Q) {
LL(t, a, b);
if (t == 0) {
if (ids.count(a)) {
seg.apply(a, a + 1, b);
} else {
seg.set(a, {1, b});
ids.insert(a);
}
}
if (t == 1) { ANS += seg.prod(a, b + 1).se; }
}
print(ANS);
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15);
ll T = 1;
// LL(T);
FOR(T) solve();
return 0;
}