#634292 (C++17) No.1441 MErGe

提出ソース

結果

問題	No.1441 MErGe
ユーザー	hitonanode
提出日時	2021-03-26 21:35:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	356 ms / 1,000 ms
コード長	5,309 bytes
コンパイル時間	3,601 ms
コンパイル使用メモリ	234,484 KB
実行使用メモリ	15,744 KB
最終ジャッジ日時	2024-05-06 14:52:06
合計ジャッジ時間	11,497 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	4 ms 5,376 KB
testcase_04	AC	5 ms 5,376 KB
testcase_05	AC	7 ms 5,376 KB
testcase_06	AC	7 ms 5,376 KB
testcase_07	AC	8 ms 5,376 KB
testcase_08	AC	65 ms 6,272 KB
testcase_09	AC	70 ms 6,016 KB
testcase_10	AC	89 ms 5,760 KB
testcase_11	AC	81 ms 5,376 KB
testcase_12	AC	114 ms 6,144 KB
testcase_13	AC	306 ms 15,104 KB
testcase_14	AC	298 ms 15,104 KB
testcase_15	AC	287 ms 14,592 KB
testcase_16	AC	290 ms 15,104 KB
testcase_17	AC	286 ms 14,720 KB
testcase_18	AC	187 ms 12,160 KB
testcase_19	AC	216 ms 13,824 KB
testcase_20	AC	171 ms 11,648 KB
testcase_21	AC	142 ms 10,368 KB
testcase_22	AC	179 ms 9,856 KB
testcase_23	AC	356 ms 15,744 KB
testcase_24	AC	348 ms 15,744 KB
testcase_25	AC	331 ms 15,744 KB
testcase_26	AC	343 ms 15,744 KB
testcase_27	AC	336 ms 15,744 KB
testcase_28	AC	178 ms 15,616 KB
testcase_29	AC	177 ms 15,616 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
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) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const 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) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template <typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;


int main() {
    int N, Q;
    cin >> N >> Q;
    vector<lint> A(N);
    cin >> A;
    vector<lint> AA(N + 1);
    REP(i, N) AA[i + 1] = AA[i] + A[i];

    pbds_set<int> s;
    REP(i, N + 1) s.insert(i);

    while (Q--) {
        int t, l, r;
        cin >> t >> l >> r;
        l--;
        if (t == 1) {
            auto itr = s.find_by_order(l + 1), irr = s.find_by_order(r);
            if (itr != s.end()) {
                while (itr != irr) {
                    s.erase(itr);
                    itr = s.find_by_order(l + 1);
                }
            }
        } else {
            l = *s.find_by_order(l), r = *s.find_by_order(r);
            cout << AA[r] - AA[l] << '\n';
        }
    }
}

yukicoder

結果

テストケース

ソースコード