oj.uz

Submission #568082

# Submission time Handle Problem Language Result Execution time Memory
568082 2022-05-24T15:48:42 Z Cyanmond New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 302580 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;
                if (pd[i].find(p) != pd[i].end()) {
                    ++pd[i][p];
                    continue;
                }
                ++pd[i][p];
                auto itr = pd[i].find(p);
                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;
                if (itr_r != pd[i].end()) {
                    hp.erase(get_key(itr_l->first), get_key((itr_l->first + itr_r->first + 2) / 2),
                             itr_l->first);
                } else {
                    hp.erase(get_key(itr_l->first), M, itr_l->first);
                }
                hp.push(get_key(itr_l->first), get_key((itr_l->first + p + 2) / 2), itr_l->first);
            }
            if (qt == 1) {
                if (--pd[i][p] != 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;
                hp.erase(get_key(itr_l->first), get_key((itr_l->first + p + 2) / 2), itr_l->first);
                if (itr_r != pd[i].end()) {
                    hp.push(get_key(itr_l->first), get_key((itr_l->first + itr_r->first + 2) / 2),
                            itr_l->first);
                } else {
                    hp.push(get_key(itr_l->first), 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 592 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 4 ms 592 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 368 KB Output is correct
28 Correct 3 ms 592 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 600 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 592 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 4 ms 592 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 368 KB Output is correct
28 Correct 3 ms 592 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1468 ms 47352 KB Output is correct
32 Correct 93 ms 10600 KB Output is correct
33 Correct 1077 ms 39252 KB Output is correct
34 Correct 1461 ms 46368 KB Output is correct
35 Correct 1357 ms 43736 KB Output is correct
36 Correct 1117 ms 38072 KB Output is correct
37 Correct 795 ms 40096 KB Output is correct
38 Correct 686 ms 35868 KB Output is correct
39 Correct 593 ms 37848 KB Output is correct
40 Correct 542 ms 35852 KB Output is correct
41 Correct 969 ms 40816 KB Output is correct
42 Correct 1055 ms 42884 KB Output is correct
43 Correct 76 ms 10464 KB Output is correct
44 Correct 971 ms 40052 KB Output is correct
45 Correct 945 ms 39124 KB Output is correct
46 Correct 899 ms 36612 KB Output is correct
47 Correct 402 ms 36596 KB Output is correct
48 Correct 463 ms 38240 KB Output is correct
49 Correct 564 ms 40168 KB Output is correct
50 Correct 576 ms 41632 KB Output is correct
51 Correct 575 ms 39696 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4551 ms 290676 KB Output is correct
2 Correct 3327 ms 253912 KB Output is correct
3 Correct 1857 ms 250084 KB Output is correct
4 Correct 4419 ms 287204 KB Output is correct
5 Correct 3068 ms 249640 KB Output is correct
6 Correct 3413 ms 248788 KB Output is correct
7 Correct 1884 ms 254652 KB Output is correct
8 Correct 4359 ms 285432 KB Output is correct
9 Execution timed out 5088 ms 287916 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5101 ms 302580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 592 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 4 ms 592 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 368 KB Output is correct
28 Correct 3 ms 592 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1468 ms 47352 KB Output is correct
32 Correct 93 ms 10600 KB Output is correct
33 Correct 1077 ms 39252 KB Output is correct
34 Correct 1461 ms 46368 KB Output is correct
35 Correct 1357 ms 43736 KB Output is correct
36 Correct 1117 ms 38072 KB Output is correct
37 Correct 795 ms 40096 KB Output is correct
38 Correct 686 ms 35868 KB Output is correct
39 Correct 593 ms 37848 KB Output is correct
40 Correct 542 ms 35852 KB Output is correct
41 Correct 969 ms 40816 KB Output is correct
42 Correct 1055 ms 42884 KB Output is correct
43 Correct 76 ms 10464 KB Output is correct
44 Correct 971 ms 40052 KB Output is correct
45 Correct 945 ms 39124 KB Output is correct
46 Correct 899 ms 36612 KB Output is correct
47 Correct 402 ms 36596 KB Output is correct
48 Correct 463 ms 38240 KB Output is correct
49 Correct 564 ms 40168 KB Output is correct
50 Correct 576 ms 41632 KB Output is correct
51 Correct 575 ms 39696 KB Output is correct
52 Correct 488 ms 41344 KB Output is correct
53 Correct 457 ms 39844 KB Output is correct
54 Correct 890 ms 49208 KB Output is correct
55 Correct 840 ms 40376 KB Output is correct
56 Correct 704 ms 40444 KB Output is correct
57 Correct 984 ms 41332 KB Output is correct
58 Correct 904 ms 42776 KB Output is correct
59 Correct 699 ms 41808 KB Output is correct
60 Correct 898 ms 42344 KB Output is correct
61 Correct 84 ms 12104 KB Output is correct
62 Correct 433 ms 40336 KB Output is correct
63 Correct 717 ms 45276 KB Output is correct
64 Correct 805 ms 45768 KB Output is correct
65 Correct 996 ms 46284 KB Output is correct
66 Correct 1062 ms 40768 KB Output is correct
67 Correct 183 ms 11136 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 592 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 4 ms 592 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 368 KB Output is correct
28 Correct 3 ms 592 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1468 ms 47352 KB Output is correct
32 Correct 93 ms 10600 KB Output is correct
33 Correct 1077 ms 39252 KB Output is correct
34 Correct 1461 ms 46368 KB Output is correct
35 Correct 1357 ms 43736 KB Output is correct
36 Correct 1117 ms 38072 KB Output is correct
37 Correct 795 ms 40096 KB Output is correct
38 Correct 686 ms 35868 KB Output is correct
39 Correct 593 ms 37848 KB Output is correct
40 Correct 542 ms 35852 KB Output is correct
41 Correct 969 ms 40816 KB Output is correct
42 Correct 1055 ms 42884 KB Output is correct
43 Correct 76 ms 10464 KB Output is correct
44 Correct 971 ms 40052 KB Output is correct
45 Correct 945 ms 39124 KB Output is correct
46 Correct 899 ms 36612 KB Output is correct
47 Correct 402 ms 36596 KB Output is correct
48 Correct 463 ms 38240 KB Output is correct
49 Correct 564 ms 40168 KB Output is correct
50 Correct 576 ms 41632 KB Output is correct
51 Correct 575 ms 39696 KB Output is correct
52 Correct 4551 ms 290676 KB Output is correct
53 Correct 3327 ms 253912 KB Output is correct
54 Correct 1857 ms 250084 KB Output is correct
55 Correct 4419 ms 287204 KB Output is correct
56 Correct 3068 ms 249640 KB Output is correct
57 Correct 3413 ms 248788 KB Output is correct
58 Correct 1884 ms 254652 KB Output is correct
59 Correct 4359 ms 285432 KB Output is correct
60 Execution timed out 5088 ms 287916 KB Time limit exceeded
61 Halted 0 ms 0 KB -