結果

問題 No.1982 [Cherry 4th Tune B] 絶険
ユーザー DemystifyDemystify
提出日時 2022-06-17 22:24:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 350 ms / 3,000 ms
コード長 6,368 bytes
コンパイル時間 2,456 ms
コンパイル使用メモリ 212,352 KB
実行使用メモリ 46,608 KB
最終ジャッジ日時 2024-10-09 08:33:02
合計ジャッジ時間 11,960 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 11 ms
17,152 KB
testcase_03 AC 122 ms
22,648 KB
testcase_04 AC 144 ms
19,088 KB
testcase_05 AC 127 ms
19,492 KB
testcase_06 AC 180 ms
29,280 KB
testcase_07 AC 214 ms
31,960 KB
testcase_08 AC 142 ms
21,748 KB
testcase_09 AC 183 ms
31,040 KB
testcase_10 AC 170 ms
24,612 KB
testcase_11 AC 94 ms
15,408 KB
testcase_12 AC 175 ms
23,280 KB
testcase_13 AC 89 ms
12,940 KB
testcase_14 AC 110 ms
18,212 KB
testcase_15 AC 96 ms
13,772 KB
testcase_16 AC 160 ms
27,820 KB
testcase_17 AC 301 ms
37,760 KB
testcase_18 AC 253 ms
35,872 KB
testcase_19 AC 290 ms
38,784 KB
testcase_20 AC 50 ms
16,980 KB
testcase_21 AC 80 ms
23,788 KB
testcase_22 AC 114 ms
14,996 KB
testcase_23 AC 64 ms
16,452 KB
testcase_24 AC 92 ms
13,632 KB
testcase_25 AC 265 ms
29,704 KB
testcase_26 AC 271 ms
34,676 KB
testcase_27 AC 46 ms
9,360 KB
testcase_28 AC 107 ms
26,236 KB
testcase_29 AC 250 ms
39,660 KB
testcase_30 AC 174 ms
37,484 KB
testcase_31 AC 112 ms
26,112 KB
testcase_32 AC 350 ms
44,452 KB
testcase_33 AC 317 ms
46,460 KB
testcase_34 AC 302 ms
46,608 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define P0(i) (((i) & 1) == 0)
#define P1(i) (((i) & 1) == 1)
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) SORT(c), (c).erase(unique(ALL(c)), (c).end())
#define elif else if
#ifdef _LOCAL
    #define debug_bar cerr << "--------------------\n";
    #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
    #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n";
    template<class T> void debug_line(const vector<T>& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(x)
    #define debug_pair(x)
    template<class T> void debug_line([[maybe_unused]] const vector<T>& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {}
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = true) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
ll mod(ll x, ll m) { assert(m != 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
#include <atcoder/segtree>
using namespace atcoder;

// 1点更新・区間総和・二分探索
using S = ll;
S op(S a, S b) { return a + b; }
S e() { return 0; }
S target;
bool f(S v) { return v < target; }


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, K, Q; input(N, K, Q);
    VLL L(K),R(K),C(K),H(K); REP(i,K) input(L[i], R[i], C[i], H[i]);
    VLL I(Q),X(Q); REP(i,Q) input(I[i], X[i]);

    segtree<S, op, e> seg(K);

    VVLL add(N), del(N);
    REP(k,K) add[L[k]-1].push_back(k);
    REP(k,K) del[R[k]-1].push_back(k);

    VVLL E(N);
    REP(i,Q) E[I[i]-1].push_back(i);

    VLL ans(Q);
    REP(i,N) {
        for (const auto& k : add[i]) {
            seg.set(k, seg.get(k) + H[k]);
        }

        for (const auto& idx : E[i]) {
            target = X[idx];
            ll r = seg.max_right<f>(0);
            if (r == K) {
                ans[idx] = -1;
            } else {
                ans[idx] = C[r];
            }
        }

        for (const auto& k : del[i]) {
            seg.set(k, seg.get(k) - H[k]);
        }
    }

    REP(i,Q) print(ans[i]);

    return 0;
}
0