結果

問題 No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに
ユーザー 👑 hitonanodehitonanode
提出日時 2022-10-14 22:05:39
言語 C++23(draft)
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 547 ms / 6,000 ms
コード長 8,081 bytes
コンパイル時間 2,861 ms
コンパイル使用メモリ 192,472 KB
実行使用メモリ 32,360 KB
最終ジャッジ日時 2023-09-08 21:44:46
合計ジャッジ時間 25,806 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 275 ms
20,560 KB
testcase_04 AC 395 ms
22,440 KB
testcase_05 AC 222 ms
17,788 KB
testcase_06 AC 357 ms
22,048 KB
testcase_07 AC 412 ms
23,580 KB
testcase_08 AC 372 ms
22,440 KB
testcase_09 AC 194 ms
13,540 KB
testcase_10 AC 177 ms
12,736 KB
testcase_11 AC 279 ms
17,496 KB
testcase_12 AC 276 ms
17,756 KB
testcase_13 AC 193 ms
13,300 KB
testcase_14 AC 156 ms
7,996 KB
testcase_15 AC 419 ms
24,320 KB
testcase_16 AC 381 ms
22,732 KB
testcase_17 AC 125 ms
9,076 KB
testcase_18 AC 532 ms
31,628 KB
testcase_19 AC 518 ms
31,676 KB
testcase_20 AC 519 ms
31,636 KB
testcase_21 AC 521 ms
31,928 KB
testcase_22 AC 519 ms
31,716 KB
testcase_23 AC 520 ms
31,928 KB
testcase_24 AC 510 ms
31,668 KB
testcase_25 AC 523 ms
31,712 KB
testcase_26 AC 518 ms
31,636 KB
testcase_27 AC 518 ms
31,668 KB
testcase_28 AC 523 ms
31,676 KB
testcase_29 AC 547 ms
31,664 KB
testcase_30 AC 520 ms
31,684 KB
testcase_31 AC 518 ms
32,360 KB
testcase_32 AC 520 ms
31,668 KB
testcase_33 AC 465 ms
31,660 KB
testcase_34 AC 475 ms
31,928 KB
testcase_35 AC 472 ms
31,704 KB
testcase_36 AC 474 ms
31,676 KB
testcase_37 AC 463 ms
31,716 KB
testcase_38 AC 63 ms
7,676 KB
testcase_39 AC 165 ms
9,856 KB
testcase_40 AC 264 ms
31,712 KB
testcase_41 AC 2 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/lazysegtree>


struct S {
    lint val;
    int red;
};

S op(S l, S r) { return {l.val + r.val, l.red + r.red}; }

S e() { return {0, 0}; }

using F = int;
F composition(F f, F g) { return f + g;}
F id() { return 0; }

S mapping(F f, S x) { return {x.val - x.red * lint(f), x.red}; }

int main() {
    int N;
    cin >> N;
    vector<S> ainit;

    vector<tuple<int, int, int, int>> events;
    REP(i, N) {
        int a, t;
        cin >> a >> t;
        ainit.push_back(S{a, 0});
        events.emplace_back(t - 1, -2, i, -1);
        events.emplace_back(t - 1 + a, -1, i, -1);
    }
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree(ainit);

    int Q;
    cin >> Q;
    REP(q, Q) {
        int d, l, r;
        cin >> d >> l >> r;
        --l;
        events.emplace_back(d, q, l, r);
    }

    sort(ALL(events));

    vector<lint> ret(Q);


    int current = 0;
    for (auto [day, tp, l, r] : events) {
        int dt = day - current;
        if (dt) tree.apply(0, N, dt);
        current = day;

        if (tp == -2) {
            auto g = tree.get(l);
            tree.set(l, S{g.val, 1});
        } else if (tp == -1) {
            auto g = tree.get(l);
            tree.set(l, S{g.val, 0});
        } else {
            ret.at(tp) = tree.prod(l, r).val;
        }
    }
    for (auto x : ret) cout << x << '\n';
}
0