oj.uz

답안 #568088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568088 2022-05-24T16:09:40 Z Cyanmond 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 282224 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#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;
    }
};

int cnt_sp[2000000];

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 replace(int l, int r1, int r2, int v) {
        assert(0 <= l and l <= r1 and l <= r2 and r1 <= n and r2 <= n);
        vector<int> vs;
        for (int li = l + siz, ri = r1 + siz; li < ri; li >>= 1, ri >>= 1) {
            if (li & 1) {
                ++cnt_sp[li++];
                vs.push_back(li - 1);
            }
            if (ri & 1) {
                ++cnt_sp[--ri];
                vs.push_back(ri);
            }
        }
        for (int li = l + siz, ri = r2 + siz; li < ri; li >>= 1, ri >>= 1) {
            if (li & 1) {
                --cnt_sp[li++];
                vs.push_back(li - 1);
            }
            if (ri & 1) {
                --cnt_sp[--ri];
                vs.push_back(ri);
            }
        }
        for (const int i : vs) {
            if (cnt_sp[i] == 1) data[i].push(v);
            if (cnt_sp[i] == -1) data[i].erase(v);
            cnt_sp[i] = 0;
        }
    }

    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);
    fill(cnt_sp, cnt_sp + 2000000, 0);

    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.replace(l_id, get_key((itr_l->first + p + 2) / 2),
                               get_key((itr_l->first + itr_r->first + 2) / 2), itr_l->first);
                } else {
                    hp.replace(l_id, get_key((itr_l->first + p + 2) / 2), M, 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);
                if (itr_r != pd[i].end()) {
                    hp.replace(l_id, get_key((itr_l->first + itr_r->first + 2) / 2),
                               get_key((itr_l->first + p + 2) / 2), itr_l->first);
                } else {
                    hp.replace(l_id, M, get_key((itr_l->first + p + 2) / 2), 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 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 3 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 5 ms 8400 KB Output is correct
8 Correct 5 ms 8432 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 6 ms 8324 KB Output is correct
11 Correct 5 ms 8416 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct
13 Correct 5 ms 8400 KB Output is correct
14 Correct 5 ms 8400 KB Output is correct
15 Correct 6 ms 8404 KB Output is correct
16 Correct 6 ms 8404 KB Output is correct
17 Correct 6 ms 8428 KB Output is correct
18 Correct 6 ms 8404 KB Output is correct
19 Correct 5 ms 8404 KB Output is correct
20 Correct 6 ms 8404 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 5 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 6 ms 8404 KB Output is correct
25 Correct 6 ms 8404 KB Output is correct
26 Correct 6 ms 8400 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 6 ms 8372 KB Output is correct
29 Correct 5 ms 8324 KB Output is correct
30 Correct 5 ms 8400 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 3 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 5 ms 8400 KB Output is correct
8 Correct 5 ms 8432 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 6 ms 8324 KB Output is correct
11 Correct 5 ms 8416 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct
13 Correct 5 ms 8400 KB Output is correct
14 Correct 5 ms 8400 KB Output is correct
15 Correct 6 ms 8404 KB Output is correct
16 Correct 6 ms 8404 KB Output is correct
17 Correct 6 ms 8428 KB Output is correct
18 Correct 6 ms 8404 KB Output is correct
19 Correct 5 ms 8404 KB Output is correct
20 Correct 6 ms 8404 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 5 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 6 ms 8404 KB Output is correct
25 Correct 6 ms 8404 KB Output is correct
26 Correct 6 ms 8400 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 6 ms 8372 KB Output is correct
29 Correct 5 ms 8324 KB Output is correct
30 Correct 5 ms 8400 KB Output is correct
31 Correct 1356 ms 49424 KB Output is correct
32 Correct 89 ms 17496 KB Output is correct
33 Correct 997 ms 43640 KB Output is correct
34 Correct 1300 ms 48296 KB Output is correct
35 Correct 1265 ms 47928 KB Output is correct
36 Correct 990 ms 44024 KB Output is correct
37 Correct 732 ms 43248 KB Output is correct
38 Correct 602 ms 42464 KB Output is correct
39 Correct 540 ms 43132 KB Output is correct
40 Correct 534 ms 42548 KB Output is correct
41 Correct 924 ms 45284 KB Output is correct
42 Correct 876 ms 47144 KB Output is correct
43 Correct 73 ms 17124 KB Output is correct
44 Correct 911 ms 45400 KB Output is correct
45 Correct 895 ms 44440 KB Output is correct
46 Correct 957 ms 42448 KB Output is correct
47 Correct 470 ms 42824 KB Output is correct
48 Correct 485 ms 44660 KB Output is correct
49 Correct 576 ms 46312 KB Output is correct
50 Correct 611 ms 46376 KB Output is correct
51 Correct 590 ms 45132 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3976 ms 276716 KB Output is correct
2 Correct 3275 ms 259192 KB Output is correct
3 Correct 1724 ms 256672 KB Output is correct
4 Correct 3674 ms 278612 KB Output is correct
5 Correct 2909 ms 251776 KB Output is correct
6 Correct 3119 ms 253220 KB Output is correct
7 Correct 1732 ms 261460 KB Output is correct
8 Correct 3561 ms 275240 KB Output is correct
9 Correct 4057 ms 282224 KB Output is correct
10 Correct 4062 ms 280592 KB Output is correct
11 Correct 3373 ms 263836 KB Output is correct
12 Correct 3631 ms 267252 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 3 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 5 ms 8400 KB Output is correct
8 Correct 5 ms 8432 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 6 ms 8324 KB Output is correct
11 Correct 5 ms 8416 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct
13 Correct 5 ms 8400 KB Output is correct
14 Correct 5 ms 8400 KB Output is correct
15 Correct 6 ms 8404 KB Output is correct
16 Correct 6 ms 8404 KB Output is correct
17 Correct 6 ms 8428 KB Output is correct
18 Correct 6 ms 8404 KB Output is correct
19 Correct 5 ms 8404 KB Output is correct
20 Correct 6 ms 8404 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 5 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 6 ms 8404 KB Output is correct
25 Correct 6 ms 8404 KB Output is correct
26 Correct 6 ms 8400 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 6 ms 8372 KB Output is correct
29 Correct 5 ms 8324 KB Output is correct
30 Correct 5 ms 8400 KB Output is correct
31 Correct 1356 ms 49424 KB Output is correct
32 Correct 89 ms 17496 KB Output is correct
33 Correct 997 ms 43640 KB Output is correct
34 Correct 1300 ms 48296 KB Output is correct
35 Correct 1265 ms 47928 KB Output is correct
36 Correct 990 ms 44024 KB Output is correct
37 Correct 732 ms 43248 KB Output is correct
38 Correct 602 ms 42464 KB Output is correct
39 Correct 540 ms 43132 KB Output is correct
40 Correct 534 ms 42548 KB Output is correct
41 Correct 924 ms 45284 KB Output is correct
42 Correct 876 ms 47144 KB Output is correct
43 Correct 73 ms 17124 KB Output is correct
44 Correct 911 ms 45400 KB Output is correct
45 Correct 895 ms 44440 KB Output is correct
46 Correct 957 ms 42448 KB Output is correct
47 Correct 470 ms 42824 KB Output is correct
48 Correct 485 ms 44660 KB Output is correct
49 Correct 576 ms 46312 KB Output is correct
50 Correct 611 ms 46376 KB Output is correct
51 Correct 590 ms 45132 KB Output is correct
52 Correct 443 ms 48480 KB Output is correct
53 Correct 428 ms 46868 KB Output is correct
54 Correct 832 ms 51792 KB Output is correct
55 Correct 761 ms 46316 KB Output is correct
56 Correct 672 ms 46752 KB Output is correct
57 Correct 869 ms 46520 KB Output is correct
58 Correct 748 ms 47320 KB Output is correct
59 Correct 669 ms 47828 KB Output is correct
60 Correct 910 ms 46348 KB Output is correct
61 Correct 103 ms 19240 KB Output is correct
62 Correct 443 ms 47424 KB Output is correct
63 Correct 685 ms 50500 KB Output is correct
64 Correct 758 ms 50352 KB Output is correct
65 Correct 915 ms 49456 KB Output is correct
66 Correct 946 ms 45980 KB Output is correct
67 Correct 199 ms 18340 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 3 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 5 ms 8400 KB Output is correct
8 Correct 5 ms 8432 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 6 ms 8324 KB Output is correct
11 Correct 5 ms 8416 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct
13 Correct 5 ms 8400 KB Output is correct
14 Correct 5 ms 8400 KB Output is correct
15 Correct 6 ms 8404 KB Output is correct
16 Correct 6 ms 8404 KB Output is correct
17 Correct 6 ms 8428 KB Output is correct
18 Correct 6 ms 8404 KB Output is correct
19 Correct 5 ms 8404 KB Output is correct
20 Correct 6 ms 8404 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 5 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 6 ms 8404 KB Output is correct
25 Correct 6 ms 8404 KB Output is correct
26 Correct 6 ms 8400 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 6 ms 8372 KB Output is correct
29 Correct 5 ms 8324 KB Output is correct
30 Correct 5 ms 8400 KB Output is correct
31 Correct 1356 ms 49424 KB Output is correct
32 Correct 89 ms 17496 KB Output is correct
33 Correct 997 ms 43640 KB Output is correct
34 Correct 1300 ms 48296 KB Output is correct
35 Correct 1265 ms 47928 KB Output is correct
36 Correct 990 ms 44024 KB Output is correct
37 Correct 732 ms 43248 KB Output is correct
38 Correct 602 ms 42464 KB Output is correct
39 Correct 540 ms 43132 KB Output is correct
40 Correct 534 ms 42548 KB Output is correct
41 Correct 924 ms 45284 KB Output is correct
42 Correct 876 ms 47144 KB Output is correct
43 Correct 73 ms 17124 KB Output is correct
44 Correct 911 ms 45400 KB Output is correct
45 Correct 895 ms 44440 KB Output is correct
46 Correct 957 ms 42448 KB Output is correct
47 Correct 470 ms 42824 KB Output is correct
48 Correct 485 ms 44660 KB Output is correct
49 Correct 576 ms 46312 KB Output is correct
50 Correct 611 ms 46376 KB Output is correct
51 Correct 590 ms 45132 KB Output is correct
52 Correct 3976 ms 276716 KB Output is correct
53 Correct 3275 ms 259192 KB Output is correct
54 Correct 1724 ms 256672 KB Output is correct
55 Correct 3674 ms 278612 KB Output is correct
56 Correct 2909 ms 251776 KB Output is correct
57 Correct 3119 ms 253220 KB Output is correct
58 Correct 1732 ms 261460 KB Output is correct
59 Correct 3561 ms 275240 KB Output is correct
60 Correct 4057 ms 282224 KB Output is correct
61 Correct 4062 ms 280592 KB Output is correct
62 Correct 3373 ms 263836 KB Output is correct
63 Correct 3631 ms 267252 KB Output is correct
64 Execution timed out 5078 ms 281576 KB Time limit exceeded
65 Halted 0 ms 0 KB -