結果

問題 No.1982 [Cherry 4th Tune B] 絶険
ユーザー iiljjiiljj
提出日時 2022-06-25 17:28:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,248 ms / 3,000 ms
コード長 12,996 bytes
コンパイル時間 2,085 ms
コンパイル使用メモリ 154,488 KB
実行使用メモリ 21,908 KB
最終ジャッジ日時 2024-11-14 17:10:16
合計ジャッジ時間 25,057 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 5 ms
6,400 KB
testcase_03 AC 354 ms
14,424 KB
testcase_04 AC 486 ms
14,556 KB
testcase_05 AC 311 ms
9,088 KB
testcase_06 AC 549 ms
14,096 KB
testcase_07 AC 638 ms
14,308 KB
testcase_08 AC 498 ms
14,752 KB
testcase_09 AC 568 ms
15,928 KB
testcase_10 AC 539 ms
12,888 KB
testcase_11 AC 270 ms
8,192 KB
testcase_12 AC 631 ms
15,488 KB
testcase_13 AC 357 ms
12,480 KB
testcase_14 AC 273 ms
9,088 KB
testcase_15 AC 351 ms
12,196 KB
testcase_16 AC 434 ms
10,624 KB
testcase_17 AC 921 ms
18,972 KB
testcase_18 AC 789 ms
17,504 KB
testcase_19 AC 875 ms
17,568 KB
testcase_20 AC 120 ms
9,412 KB
testcase_21 AC 184 ms
9,216 KB
testcase_22 AC 417 ms
13,236 KB
testcase_23 AC 186 ms
9,200 KB
testcase_24 AC 237 ms
8,704 KB
testcase_25 AC 851 ms
18,052 KB
testcase_26 AC 865 ms
18,284 KB
testcase_27 AC 113 ms
6,272 KB
testcase_28 AC 66 ms
13,440 KB
testcase_29 AC 1,248 ms
21,908 KB
testcase_30 AC 802 ms
21,908 KB
testcase_31 AC 97 ms
14,496 KB
testcase_32 AC 1,117 ms
21,784 KB
testcase_33 AC 1,108 ms
21,784 KB
testcase_34 AC 967 ms
21,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<<<N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region BIT */

template <class T = ll> struct BinaryIndexedTree {
    vector<T> data;

    BinaryIndexedTree(int sz) { data.assign(++sz, 0); }

    void init() { fill(ALL(data), T(0)); }

    T sum(int k) const {
        T ret = 0;
        for (++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }

    void add(int k, const T &x) {
        for (++k; k < SIZE(data); k += k & -k) data[k] += x;
    }

    // query for [l, r)
    // subtraction is required
    T query(const int l, const int r) const { return sum(r - 1) - sum(l - 1); }
};

/* #endregion */

/* #region RangeAddBIT */

template <class T = ll> struct RangeAddBinaryIndexedTree {
    BinaryIndexedTree<T> p, q;
    RangeAddBinaryIndexedTree(const int n) : p(n + 1), q(n + 1) {}
    void init() {
        p.init();
        q.init();
    }
    void add_range(const int l, const int r, const T w) {
        p.add(l, -w * l);
        p.add(r, w * r);
        q.add(l, w);
        q.add(r, -w);
    }
    // [0, r) の和を求める
    T get_range(const int r) const { return p.sum(r) + q.sum(r) * r; }
    // [l, r) の和を求める
    T query(const int l, const int r) {
        if (l >= r) return T(0);
        return get_range(r) - get_range(l);
    }
};

/* #endregion */

/* #region parallel_binary_search */

// 並列二分探索
vc<int> parallel_binary_search(int n, int q,
                               function<void(void)> init,       //
                               function<void(int)> operate,     //
                               function<bool(int)> discriminate //
) {
    using pii = pair<int, int>; // mid, qi

    vc<int> ql(q, -1), qr(q, n); // 区間左端(ng)，右端(ok)
    vc<pii> query(q), nxt(0);
    REP(i, 0, q) query[i] = {(ql[i] + qr[i]) / 2, i};
    vc<int> ret(q);

    // 一度も操作をしない状態で満たされるかどうか確かめる必要があるとき使う
    constexpr int QUERY_INIT_CHECK = -2;

    while (!query.empty()) {
        sort(ALL(query));

        int cur = 0;
        init(); // 操作を開始するための初期化

        // 一度も操作をしない状態で満たされるかどうか確かめる
        while (cur < SIZE(query) && query[cur].first == QUERY_INIT_CHECK) {
            pii &p = query[cur++];
            int qi = p.second;

            // 一度も操作をしない状態で充足されたら -1 にする
            ret[qi] = (discriminate(qi)) ? -1 : 0;
        }

        REP(i, 0, n) {
            operate(i); // i 回目の操作

            while (cur < SIZE(query) && query[cur].first <= i) {
                pii &p = query[cur++];
                int qi = p.second, mid = p.first; // mid 回目の操作が今ちょうど終わったところ

                if (discriminate(qi))
                    qr[qi] = mid;
                else
                    ql[qi] = mid;

                if (ql[qi] == -1 && qr[qi] == 0) {
                    nxt.push_back({QUERY_INIT_CHECK, qi});
                } else if (ql[qi] + 1 == qr[qi]) {
                    ret[qi] = qr[qi];
                } else {
                    nxt.push_back({(ql[qi] + qr[qi]) / 2, qi});
                }
            }
        }

        query.swap(nxt);
        nxt.clear();
    }

    return ret;
}

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, k, q);
    vll l(k), r(k), c(k), H(k);
    REP(i, 0, k) cin >> l[i], r[i], c[i], H[i];
    l--;

    vll I(q), X(q);
    REP(i, 0, q) cin >> I[i], X[i];
    I--;

    RangeAddBinaryIndexedTree<> bit(n);

    auto init = [&]() -> void { bit.init(); };
    // oi 回目の操作を適用する
    auto operate = [&](int oi) -> void {
        bit.add_range(l[oi], r[oi], H[oi]); //
    };
    // クエリ qi の判定条件が充足されるかどうかを返す
    auto discriminate = [&](int qi) -> bool {
        return bit.query(I[qi], I[qi] + 1) >= X[qi]; //
    };

    vc<int> ret = parallel_binary_search(k, q, init, operate, discriminate);
    dump(ret);

    REP(i, 0, q) {
        if (ret[i] == k)
            pprint(-1);
        else
            pprint(c[ret[i]]);
    }
}

// entry point
int main() {
    solve();
    return 0;
}
0