oj.uz

답안 #568084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568084 2022-05-24T15:56:11 Z Cyanmond 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 302536 KB 
#include <bits/stdc++.h>

using namespace std;
using i64 = int64_t;

constexpr int inf = 1000000100;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, l, r) for (int i = (l); i < (r); ++i)
#define RVP(i, n) for (int i = (n - 1); i >= 0; --i)

#define ALL(x) (x).begin(), (x).end()

struct PriqueErase {
    priority_queue<int, vector<int>, greater<int>> a, b;

    void push(int x) { a.push(x); }

    void erase(int x) { b.push(x); }

    int top() {
        while (not a.empty()) {
            const int v = a.top();
            if (b.empty()) {
                return v;
            } else if (v == b.top()) {
                a.pop();
                b.pop();
            } else {
                return v;
            }
        }
        return inf;
    }
};

struct RIEPM {
    int n, siz;
    vector<PriqueErase> data;

    RIEPM(int n_) : n(n_) {
        siz = 1;
        while (siz < n) siz <<= 1;
        data.assign(2 * siz, PriqueErase());
    }

    void push(int l, int r, int v) {
        assert(0 <= l and l <= r and r <= n);
        for (l += siz, r += siz; l < r; l >>= 1, r >>= 1) {
            if (l & 1) data[l++].push(v);
            if (r & 1) data[--r].push(v);
        }
    }

    void erase(int l, int r, int v) {
        assert(0 <= l and l <= r and r <= n);
        for (l += siz, r += siz; l < r; l >>= 1, r >>= 1) {
            if (l & 1) data[l++].erase(v);
            if (r & 1) data[--r].erase(v);
        }
    }

    int top(int i) {
        assert(0 <= i and i < n);
        i += siz;
        int res = inf;
        while (i != 0) {
            res = min(res, data[i].top());
            i >>= 1;
        }
        return res;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K, Q;
    cin >> N >> K >> Q;
    vector<int> X(N), T(N), A(N), B(N);
    REP(i, N) {
        cin >> X[i] >> T[i] >> A[i] >> B[i];
        --T[i];
    }
    vector<int> L(Q), Y(Q);
    REP(i, Q) cin >> L[i] >> Y[i];

    auto reverse_points = [&]() {
        REP(i, N) X[i] = inf - X[i];
        REP(i, Q) L[i] = inf - L[i];
    };

    auto solve = [&]() {
        vector<int> press;
        REP(i, N) press.push_back(X[i]);
        REP(i, Q) press.push_back(L[i]);
        sort(ALL(press));
        press.erase(unique(ALL(press)), press.end());

        auto get_key = [&](int i) { return (int)(lower_bound(ALL(press), i) - press.begin()); };

        const int M = (int)press.size();
        RIEPM hp(M);

        vector<tuple<int, int, int, int>> event;
        REP(i, N) {
            event.push_back({A[i], 0, X[i], T[i]});
            event.push_back({B[i] + 1, 1, X[i], T[i]});
        }
        REP(i, Q) event.push_back({Y[i], 2, L[i], i});
        sort(ALL(event));

        vector<map<int, int>> pd(K);
        vector<int> res(Q, -1);

        int cnt_zero = K;
        for (const auto &[c, qt, p, i] : event) {
            if (qt == 0) {
                if (pd[i].empty()) --cnt_zero;
                auto [itr, vld] = pd[i].insert({p, 1});
                if (not vld) {
                    ++itr->second;
                    continue;
                }
                auto itr_r = itr;
                ++itr_r;
                if (itr_r == pd[i].end()) {
                    hp.push(get_key(p), M, p);
                } else {
                    hp.push(get_key(p), get_key((p + itr_r->first + 2) / 2), p);
                }
                if (itr == pd[i].begin()) continue;
                auto itr_l = itr;
                --itr_l;
                const int l_id = get_key(itr_l->first);
                if (itr_r != pd[i].end()) {
                    hp.erase(l_id, get_key((itr_l->first + itr_r->first + 2) / 2), itr_l->first);
                } else {
                    hp.erase(l_id, M, itr_l->first);
                }
                hp.push(l_id, get_key((itr_l->first + p + 2) / 2), itr_l->first);
            }
            if (qt == 1) {
                auto itr = pd[i].find(p);
                if (--(itr->second) != 0) {
                    continue;
                }
                pd[i].erase(p);
                if (pd[i].empty()) ++cnt_zero;
                auto itr_r = pd[i].upper_bound(p);
                if (itr_r != pd[i].end()) {
                    hp.erase(get_key(p), get_key((p + itr_r->first + 2) / 2), p);
                } else {
                    hp.erase(get_key(p), M, p);
                }
                if (itr_r == pd[i].begin()) continue;
                auto itr_l = itr_r;
                --itr_l;
                const int l_id = get_key(itr_l->first);
                hp.erase(l_id, get_key((itr_l->first + p + 2) / 2), itr_l->first);
                if (itr_r != pd[i].end()) {
                    hp.push(l_id, get_key((itr_l->first + itr_r->first + 2) / 2), itr_l->first);
                } else {
                    hp.push(l_id, M, itr_l->first);
                }
            }
            if (qt == 2) {
                if (cnt_zero != 0) continue;
                const int pi = get_key(p);
                const int vi = hp.top(pi);
                if (vi == inf) continue;
                res[i] = p - vi;
            }
        }

        return res;
    };

    const auto res1 = solve();
    reverse_points();
    const auto res2 = solve();
    REP(i, Q) {
        const int ans = max(res1[i], res2[i]);
        cout << ans << '\n';
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 3 ms 592 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 592 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 608 KB Output is correct
27 Correct 2 ms 396 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 468 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 3 ms 592 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 592 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 608 KB Output is correct
27 Correct 2 ms 396 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1449 ms 45404 KB Output is correct
32 Correct 92 ms 9556 KB Output is correct
33 Correct 1172 ms 38108 KB Output is correct
34 Correct 1442 ms 45108 KB Output is correct
35 Correct 1398 ms 42492 KB Output is correct
36 Correct 1104 ms 36792 KB Output is correct
37 Correct 778 ms 38944 KB Output is correct
38 Correct 618 ms 34632 KB Output is correct
39 Correct 555 ms 36740 KB Output is correct
40 Correct 530 ms 34600 KB Output is correct
41 Correct 989 ms 39728 KB Output is correct
42 Correct 974 ms 41792 KB Output is correct
43 Correct 92 ms 9360 KB Output is correct
44 Correct 1033 ms 38824 KB Output is correct
45 Correct 959 ms 37704 KB Output is correct
46 Correct 888 ms 35432 KB Output is correct
47 Correct 433 ms 35496 KB Output is correct
48 Correct 454 ms 37120 KB Output is correct
49 Correct 564 ms 39052 KB Output is correct
50 Correct 583 ms 40656 KB Output is correct
51 Correct 635 ms 38604 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4501 ms 290524 KB Output is correct
2 Correct 3278 ms 252840 KB Output is correct
3 Correct 1751 ms 248892 KB Output is correct
4 Correct 4124 ms 286116 KB Output is correct
5 Correct 2794 ms 248592 KB Output is correct
6 Correct 3113 ms 247672 KB Output is correct
7 Correct 1764 ms 253576 KB Output is correct
8 Correct 4114 ms 284444 KB Output is correct
9 Correct 4773 ms 286872 KB Output is correct
10 Correct 4209 ms 290836 KB Output is correct
11 Correct 3367 ms 269192 KB Output is correct
12 Correct 3702 ms 273996 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5060 ms 302536 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 3 ms 592 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 592 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 608 KB Output is correct
27 Correct 2 ms 396 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1449 ms 45404 KB Output is correct
32 Correct 92 ms 9556 KB Output is correct
33 Correct 1172 ms 38108 KB Output is correct
34 Correct 1442 ms 45108 KB Output is correct
35 Correct 1398 ms 42492 KB Output is correct
36 Correct 1104 ms 36792 KB Output is correct
37 Correct 778 ms 38944 KB Output is correct
38 Correct 618 ms 34632 KB Output is correct
39 Correct 555 ms 36740 KB Output is correct
40 Correct 530 ms 34600 KB Output is correct
41 Correct 989 ms 39728 KB Output is correct
42 Correct 974 ms 41792 KB Output is correct
43 Correct 92 ms 9360 KB Output is correct
44 Correct 1033 ms 38824 KB Output is correct
45 Correct 959 ms 37704 KB Output is correct
46 Correct 888 ms 35432 KB Output is correct
47 Correct 433 ms 35496 KB Output is correct
48 Correct 454 ms 37120 KB Output is correct
49 Correct 564 ms 39052 KB Output is correct
50 Correct 583 ms 40656 KB Output is correct
51 Correct 635 ms 38604 KB Output is correct
52 Correct 465 ms 40504 KB Output is correct
53 Correct 435 ms 39036 KB Output is correct
54 Correct 889 ms 48488 KB Output is correct
55 Correct 822 ms 39644 KB Output is correct
56 Correct 741 ms 39548 KB Output is correct
57 Correct 988 ms 40612 KB Output is correct
58 Correct 813 ms 41880 KB Output is correct
59 Correct 733 ms 41060 KB Output is correct
60 Correct 912 ms 41596 KB Output is correct
61 Correct 104 ms 11356 KB Output is correct
62 Correct 446 ms 39520 KB Output is correct
63 Correct 740 ms 44652 KB Output is correct
64 Correct 853 ms 45016 KB Output is correct
65 Correct 997 ms 45632 KB Output is correct
66 Correct 1047 ms 40060 KB Output is correct
67 Correct 182 ms 10472 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 3 ms 592 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 592 KB Output is correct
18 Correct 3 ms 592 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 608 KB Output is correct
27 Correct 2 ms 396 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 2 ms 592 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1449 ms 45404 KB Output is correct
32 Correct 92 ms 9556 KB Output is correct
33 Correct 1172 ms 38108 KB Output is correct
34 Correct 1442 ms 45108 KB Output is correct
35 Correct 1398 ms 42492 KB Output is correct
36 Correct 1104 ms 36792 KB Output is correct
37 Correct 778 ms 38944 KB Output is correct
38 Correct 618 ms 34632 KB Output is correct
39 Correct 555 ms 36740 KB Output is correct
40 Correct 530 ms 34600 KB Output is correct
41 Correct 989 ms 39728 KB Output is correct
42 Correct 974 ms 41792 KB Output is correct
43 Correct 92 ms 9360 KB Output is correct
44 Correct 1033 ms 38824 KB Output is correct
45 Correct 959 ms 37704 KB Output is correct
46 Correct 888 ms 35432 KB Output is correct
47 Correct 433 ms 35496 KB Output is correct
48 Correct 454 ms 37120 KB Output is correct
49 Correct 564 ms 39052 KB Output is correct
50 Correct 583 ms 40656 KB Output is correct
51 Correct 635 ms 38604 KB Output is correct
52 Correct 4501 ms 290524 KB Output is correct
53 Correct 3278 ms 252840 KB Output is correct
54 Correct 1751 ms 248892 KB Output is correct
55 Correct 4124 ms 286116 KB Output is correct
56 Correct 2794 ms 248592 KB Output is correct
57 Correct 3113 ms 247672 KB Output is correct
58 Correct 1764 ms 253576 KB Output is correct
59 Correct 4114 ms 284444 KB Output is correct
60 Correct 4773 ms 286872 KB Output is correct
61 Correct 4209 ms 290836 KB Output is correct
62 Correct 3367 ms 269192 KB Output is correct
63 Correct 3702 ms 273996 KB Output is correct
64 Execution timed out 5060 ms 302536 KB Time limit exceeded
65 Halted 0 ms 0 KB -