oj.uz

Submission #568101

# Submission time Handle Problem Language Result Execution time Memory
568101 2022-05-24T16:32:06 Z Cyanmond New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 282168 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() or v != b.top()) {
                return v;
            } else {
                a.pop();
                b.pop();
            }
        }
        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) {
        scanf("%d%d%d%d", &X[i], &T[i], &A[i], &B[i]);
        // cin >> X[i] >> T[i] >> A[i] >> B[i];
        --T[i];
    }
    vector<int> L(Q), Y(Q);
    REP(i, Q) scanf("%d%d", &L[i], &Y[i]); // 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;
        press.reserve(N + Q);
        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;
        event.reserve(N + Q);
        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]);
        printf("%d\n", ans);
        // cout << ans << '\n';
    }
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:118:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         scanf("%d%d%d%d", &X[i], &T[i], &A[i], &B[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:123:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |     REP(i, Q) scanf("%d%d", &L[i], &Y[i]); // cin >> L[i] >> Y[i];
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8020 KB Output is correct
2 Correct 3 ms 8020 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 8276 KB Output is correct
8 Correct 6 ms 8400 KB Output is correct
9 Correct 7 ms 8400 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8400 KB Output is correct
12 Correct 6 ms 8392 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 6 ms 8276 KB Output is correct
15 Correct 6 ms 8400 KB Output is correct
16 Correct 6 ms 8276 KB Output is correct
17 Correct 6 ms 8400 KB Output is correct
18 Correct 6 ms 8400 KB Output is correct
19 Correct 6 ms 8276 KB Output is correct
20 Correct 6 ms 8400 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 7 ms 8400 KB Output is correct
23 Correct 6 ms 8276 KB Output is correct
24 Correct 5 ms 8400 KB Output is correct
25 Correct 6 ms 8400 KB Output is correct
26 Correct 6 ms 8276 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 6 ms 8276 KB Output is correct
29 Correct 7 ms 8372 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8020 KB Output is correct
2 Correct 3 ms 8020 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 8276 KB Output is correct
8 Correct 6 ms 8400 KB Output is correct
9 Correct 7 ms 8400 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8400 KB Output is correct
12 Correct 6 ms 8392 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 6 ms 8276 KB Output is correct
15 Correct 6 ms 8400 KB Output is correct
16 Correct 6 ms 8276 KB Output is correct
17 Correct 6 ms 8400 KB Output is correct
18 Correct 6 ms 8400 KB Output is correct
19 Correct 6 ms 8276 KB Output is correct
20 Correct 6 ms 8400 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 7 ms 8400 KB Output is correct
23 Correct 6 ms 8276 KB Output is correct
24 Correct 5 ms 8400 KB Output is correct
25 Correct 6 ms 8400 KB Output is correct
26 Correct 6 ms 8276 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 6 ms 8276 KB Output is correct
29 Correct 7 ms 8372 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 1402 ms 49280 KB Output is correct
32 Correct 99 ms 15032 KB Output is correct
33 Correct 1138 ms 43620 KB Output is correct
34 Correct 1393 ms 48144 KB Output is correct
35 Correct 1351 ms 47488 KB Output is correct
36 Correct 1071 ms 42588 KB Output is correct
37 Correct 781 ms 43092 KB Output is correct
38 Correct 650 ms 41228 KB Output is correct
39 Correct 573 ms 42856 KB Output is correct
40 Correct 570 ms 42336 KB Output is correct
41 Correct 985 ms 45224 KB Output is correct
42 Correct 952 ms 46948 KB Output is correct
43 Correct 75 ms 15428 KB Output is correct
44 Correct 992 ms 45120 KB Output is correct
45 Correct 932 ms 44388 KB Output is correct
46 Correct 917 ms 42468 KB Output is correct
47 Correct 439 ms 42752 KB Output is correct
48 Correct 495 ms 44792 KB Output is correct
49 Correct 622 ms 46152 KB Output is correct
50 Correct 657 ms 46252 KB Output is correct
51 Correct 655 ms 44944 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4356 ms 281348 KB Output is correct
2 Correct 3417 ms 259472 KB Output is correct
3 Correct 1852 ms 255208 KB Output is correct
4 Correct 3859 ms 282168 KB Output is correct
5 Correct 3018 ms 252208 KB Output is correct
6 Correct 3288 ms 252728 KB Output is correct
7 Correct 1810 ms 259648 KB Output is correct
8 Correct 3810 ms 276544 KB Output is correct
9 Correct 4385 ms 280708 KB Output is correct
10 Correct 4259 ms 281944 KB Output is correct
11 Correct 3524 ms 263412 KB Output is correct
12 Correct 3860 ms 264892 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8020 KB Output is correct
2 Correct 3 ms 8020 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 8276 KB Output is correct
8 Correct 6 ms 8400 KB Output is correct
9 Correct 7 ms 8400 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8400 KB Output is correct
12 Correct 6 ms 8392 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 6 ms 8276 KB Output is correct
15 Correct 6 ms 8400 KB Output is correct
16 Correct 6 ms 8276 KB Output is correct
17 Correct 6 ms 8400 KB Output is correct
18 Correct 6 ms 8400 KB Output is correct
19 Correct 6 ms 8276 KB Output is correct
20 Correct 6 ms 8400 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 7 ms 8400 KB Output is correct
23 Correct 6 ms 8276 KB Output is correct
24 Correct 5 ms 8400 KB Output is correct
25 Correct 6 ms 8400 KB Output is correct
26 Correct 6 ms 8276 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 6 ms 8276 KB Output is correct
29 Correct 7 ms 8372 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 1402 ms 49280 KB Output is correct
32 Correct 99 ms 15032 KB Output is correct
33 Correct 1138 ms 43620 KB Output is correct
34 Correct 1393 ms 48144 KB Output is correct
35 Correct 1351 ms 47488 KB Output is correct
36 Correct 1071 ms 42588 KB Output is correct
37 Correct 781 ms 43092 KB Output is correct
38 Correct 650 ms 41228 KB Output is correct
39 Correct 573 ms 42856 KB Output is correct
40 Correct 570 ms 42336 KB Output is correct
41 Correct 985 ms 45224 KB Output is correct
42 Correct 952 ms 46948 KB Output is correct
43 Correct 75 ms 15428 KB Output is correct
44 Correct 992 ms 45120 KB Output is correct
45 Correct 932 ms 44388 KB Output is correct
46 Correct 917 ms 42468 KB Output is correct
47 Correct 439 ms 42752 KB Output is correct
48 Correct 495 ms 44792 KB Output is correct
49 Correct 622 ms 46152 KB Output is correct
50 Correct 657 ms 46252 KB Output is correct
51 Correct 655 ms 44944 KB Output is correct
52 Correct 450 ms 48136 KB Output is correct
53 Correct 453 ms 46736 KB Output is correct
54 Correct 873 ms 51912 KB Output is correct
55 Correct 788 ms 46248 KB Output is correct
56 Correct 712 ms 46576 KB Output is correct
57 Correct 919 ms 46344 KB Output is correct
58 Correct 816 ms 47168 KB Output is correct
59 Correct 727 ms 47872 KB Output is correct
60 Correct 877 ms 45936 KB Output is correct
61 Correct 82 ms 19192 KB Output is correct
62 Correct 468 ms 47476 KB Output is correct
63 Correct 714 ms 50140 KB Output is correct
64 Correct 819 ms 49964 KB Output is correct
65 Correct 957 ms 49484 KB Output is correct
66 Correct 982 ms 46056 KB Output is correct
67 Correct 216 ms 17168 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8020 KB Output is correct
2 Correct 3 ms 8020 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 8276 KB Output is correct
8 Correct 6 ms 8400 KB Output is correct
9 Correct 7 ms 8400 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8400 KB Output is correct
12 Correct 6 ms 8392 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 6 ms 8276 KB Output is correct
15 Correct 6 ms 8400 KB Output is correct
16 Correct 6 ms 8276 KB Output is correct
17 Correct 6 ms 8400 KB Output is correct
18 Correct 6 ms 8400 KB Output is correct
19 Correct 6 ms 8276 KB Output is correct
20 Correct 6 ms 8400 KB Output is correct
21 Correct 4 ms 8148 KB Output is correct
22 Correct 7 ms 8400 KB Output is correct
23 Correct 6 ms 8276 KB Output is correct
24 Correct 5 ms 8400 KB Output is correct
25 Correct 6 ms 8400 KB Output is correct
26 Correct 6 ms 8276 KB Output is correct
27 Correct 5 ms 8132 KB Output is correct
28 Correct 6 ms 8276 KB Output is correct
29 Correct 7 ms 8372 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 1402 ms 49280 KB Output is correct
32 Correct 99 ms 15032 KB Output is correct
33 Correct 1138 ms 43620 KB Output is correct
34 Correct 1393 ms 48144 KB Output is correct
35 Correct 1351 ms 47488 KB Output is correct
36 Correct 1071 ms 42588 KB Output is correct
37 Correct 781 ms 43092 KB Output is correct
38 Correct 650 ms 41228 KB Output is correct
39 Correct 573 ms 42856 KB Output is correct
40 Correct 570 ms 42336 KB Output is correct
41 Correct 985 ms 45224 KB Output is correct
42 Correct 952 ms 46948 KB Output is correct
43 Correct 75 ms 15428 KB Output is correct
44 Correct 992 ms 45120 KB Output is correct
45 Correct 932 ms 44388 KB Output is correct
46 Correct 917 ms 42468 KB Output is correct
47 Correct 439 ms 42752 KB Output is correct
48 Correct 495 ms 44792 KB Output is correct
49 Correct 622 ms 46152 KB Output is correct
50 Correct 657 ms 46252 KB Output is correct
51 Correct 655 ms 44944 KB Output is correct
52 Correct 4356 ms 281348 KB Output is correct
53 Correct 3417 ms 259472 KB Output is correct
54 Correct 1852 ms 255208 KB Output is correct
55 Correct 3859 ms 282168 KB Output is correct
56 Correct 3018 ms 252208 KB Output is correct
57 Correct 3288 ms 252728 KB Output is correct
58 Correct 1810 ms 259648 KB Output is correct
59 Correct 3810 ms 276544 KB Output is correct
60 Correct 4385 ms 280708 KB Output is correct
61 Correct 4259 ms 281944 KB Output is correct
62 Correct 3524 ms 263412 KB Output is correct
63 Correct 3860 ms 264892 KB Output is correct
64 Execution timed out 5065 ms 281500 KB Time limit exceeded
65 Halted 0 ms 0 KB -