oj.uz

Submission #1049691

# Submission time Handle Problem Language Result Execution time Memory
1049691 2024-08-09T04:02:23 Z shiomusubi496 Joker (BOI20_joker) C++17
71 / 100
 2000 ms 20272 KB 
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

class UndoableUF {
    int n;
    bool flag = true;
    vector<int> par;
    vector<tuple<int, int, bool>> history;

public:
    UndoableUF(int n_) : n(n_ / 2), par(n_, -1) {}
    int find(int x) { return par[x] < 0 ? x : find(par[x]); }
    bool same(int x, int y) { return find(x) == find(y); }
    bool merge(int x, int y) {
        x = find(x), y = find(y);
        history.emplace_back(x, par[x], flag);
        history.emplace_back(y, par[y], flag);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        if (same(x, (x + n) % (2 * n))) flag = false;
        return true;
    }
    int find2(int x) {
        if (par[x] < 0) return x;
        history.emplace_back(x, par[x], flag);
        return par[x] = find2(par[x]);
    }
    bool same2(int x, int y) { return find2(x) == find2(y); }
    bool merge2(int x, int y) {
        x = find2(x), y = find2(y);
        history.emplace_back(x, par[x], flag);
        history.emplace_back(y, par[y], flag);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        if (same2(x, (x + n) % (2 * n))) flag = false;
        return true;
    }
    void undo() {
        auto [x, px, _] = history.back(); history.pop_back();
        auto [y, py, f] = history.back(); history.pop_back();
        par[x] = px;
        par[y] = py;
        flag = f;
    }
    void snapshot() { history.clear(); }
    void rollback() {
        while (!history.empty()) {
            auto [x, px, f] = history.back(); history.pop_back();
            par[x] = px;
            flag = f;
        }
    }
    bool is_bip() { return flag; }
};

int main() {
    int N, M, Q; cin >> N >> M >> Q;
    vector<pair<int, int>> A(M);
    rep (i, M) {
        cin >> A[i].first >> A[i].second;
        --A[i].first, --A[i].second;
    }
    vector<array<int, 3>> B(Q);
    rep (i, Q) {
        cin >> B[i][0] >> B[i][1];
        --B[i][0];
        B[i][2] = i;
    }
    static constexpr int block = 500;
    sort(all(B), [&](auto a, auto b) {
        if (a[0] / block != b[0] / block) return a[0] < b[0];
        return a[1] > b[1];
    });
    vector<bool> ans(Q);
    int curl = block, curr = M;
    UndoableUF uf(2 * N);
    bool f = false;
    for (auto [l, r, k] : B) {
        if (f) {
            ans[k] = false;
            continue;
        }
        while (curl <= l) {
            uf.rollback();
            rep2 (i, curl - block, curl) {
                if (i >= M) break;
                uf.merge2(A[i].first, A[i].second + N);
                uf.merge2(A[i].first + N, A[i].second);
            }
            uf.snapshot();
            if (!uf.is_bip()) {
                ans[k] = false;
                f = true;
                break;
            }
            curl += block;
            curr = M;
        }
        if (f) continue;
        assert(curr >= r);
        rrep2 (i, r, curr) {
            uf.merge(A[i].first, A[i].second + N);
            uf.merge(A[i].first + N, A[i].second);
        }
        curr = r;
        rep2 (i, curl - block, l) {
            uf.merge(A[i].first, A[i].second + N);
            uf.merge(A[i].first + N, A[i].second);
        }
        ans[k] = uf.is_bip();
        rep2 (i, curl - block, l) uf.undo(), uf.undo();
    }
    rep (i, Q) puts(ans[i] ? "NO" : "YES");
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 6 ms 604 KB Output is correct
31 Correct 6 ms 604 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 7 ms 684 KB Output is correct
36 Correct 6 ms 604 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 9 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 11 ms 676 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 7 ms 600 KB Output is correct
44 Correct 7 ms 604 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 7 ms 604 KB Output is correct
47 Correct 6 ms 600 KB Output is correct
48 Correct 8 ms 604 KB Output is correct
49 Correct 7 ms 676 KB Output is correct
50 Correct 7 ms 676 KB Output is correct
51 Correct 6 ms 632 KB Output is correct
52 Correct 7 ms 676 KB Output is correct
53 Correct 7 ms 604 KB Output is correct
54 Correct 7 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 115 ms 17472 KB Output is correct
4 Correct 110 ms 19540 KB Output is correct
5 Correct 132 ms 18880 KB Output is correct
6 Correct 118 ms 19004 KB Output is correct
7 Correct 138 ms 18780 KB Output is correct
8 Correct 130 ms 18364 KB Output is correct
9 Correct 109 ms 17980 KB Output is correct
10 Correct 113 ms 20272 KB Output is correct
11 Correct 117 ms 19392 KB Output is correct
12 Correct 127 ms 19512 KB Output is correct
13 Correct 116 ms 18364 KB Output is correct
14 Correct 126 ms 17596 KB Output is correct
15 Correct 137 ms 19900 KB Output is correct
16 Correct 121 ms 18620 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 115 ms 17472 KB Output is correct
30 Correct 110 ms 19540 KB Output is correct
31 Correct 132 ms 18880 KB Output is correct
32 Correct 118 ms 19004 KB Output is correct
33 Correct 138 ms 18780 KB Output is correct
34 Correct 130 ms 18364 KB Output is correct
35 Correct 109 ms 17980 KB Output is correct
36 Correct 113 ms 20272 KB Output is correct
37 Correct 117 ms 19392 KB Output is correct
38 Correct 127 ms 19512 KB Output is correct
39 Correct 116 ms 18364 KB Output is correct
40 Correct 126 ms 17596 KB Output is correct
41 Correct 137 ms 19900 KB Output is correct
42 Correct 121 ms 18620 KB Output is correct
43 Correct 416 ms 19284 KB Output is correct
44 Correct 446 ms 18620 KB Output is correct
45 Correct 450 ms 19128 KB Output is correct
46 Correct 427 ms 17592 KB Output is correct
47 Correct 476 ms 17592 KB Output is correct
48 Correct 499 ms 18872 KB Output is correct
49 Correct 552 ms 19384 KB Output is correct
50 Correct 409 ms 17592 KB Output is correct
51 Correct 449 ms 18872 KB Output is correct
52 Correct 484 ms 19384 KB Output is correct
53 Correct 420 ms 18728 KB Output is correct
54 Correct 561 ms 18732 KB Output is correct
55 Correct 566 ms 19640 KB Output is correct
56 Correct 549 ms 18364 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 6 ms 604 KB Output is correct
31 Correct 6 ms 604 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 7 ms 684 KB Output is correct
36 Correct 6 ms 604 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 9 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 11 ms 676 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 7 ms 600 KB Output is correct
44 Correct 7 ms 604 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 7 ms 604 KB Output is correct
47 Correct 6 ms 600 KB Output is correct
48 Correct 8 ms 604 KB Output is correct
49 Correct 7 ms 676 KB Output is correct
50 Correct 7 ms 676 KB Output is correct
51 Correct 6 ms 632 KB Output is correct
52 Correct 7 ms 676 KB Output is correct
53 Correct 7 ms 604 KB Output is correct
54 Correct 7 ms 604 KB Output is correct
55 Correct 511 ms 16692 KB Output is correct
56 Correct 1342 ms 16320 KB Output is correct
57 Correct 827 ms 17452 KB Output is correct
58 Correct 628 ms 15296 KB Output is correct
59 Correct 1535 ms 16940 KB Output is correct
60 Correct 1684 ms 15932 KB Output is correct
61 Correct 640 ms 16700 KB Output is correct
62 Correct 824 ms 17464 KB Output is correct
63 Correct 649 ms 15804 KB Output is correct
64 Correct 868 ms 15808 KB Output is correct
65 Correct 892 ms 17704 KB Output is correct

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 6 ms 604 KB Output is correct
31 Correct 6 ms 604 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 7 ms 684 KB Output is correct
36 Correct 6 ms 604 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 10 ms 604 KB Output is correct
39 Correct 9 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 11 ms 676 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 7 ms 600 KB Output is correct
44 Correct 7 ms 604 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 7 ms 604 KB Output is correct
47 Correct 6 ms 600 KB Output is correct
48 Correct 8 ms 604 KB Output is correct
49 Correct 7 ms 676 KB Output is correct
50 Correct 7 ms 676 KB Output is correct
51 Correct 6 ms 632 KB Output is correct
52 Correct 7 ms 676 KB Output is correct
53 Correct 7 ms 604 KB Output is correct
54 Correct 7 ms 604 KB Output is correct
55 Correct 115 ms 17472 KB Output is correct
56 Correct 110 ms 19540 KB Output is correct
57 Correct 132 ms 18880 KB Output is correct
58 Correct 118 ms 19004 KB Output is correct
59 Correct 138 ms 18780 KB Output is correct
60 Correct 130 ms 18364 KB Output is correct
61 Correct 109 ms 17980 KB Output is correct
62 Correct 113 ms 20272 KB Output is correct
63 Correct 117 ms 19392 KB Output is correct
64 Correct 127 ms 19512 KB Output is correct
65 Correct 116 ms 18364 KB Output is correct
66 Correct 126 ms 17596 KB Output is correct
67 Correct 137 ms 19900 KB Output is correct
68 Correct 121 ms 18620 KB Output is correct
69 Correct 416 ms 19284 KB Output is correct
70 Correct 446 ms 18620 KB Output is correct
71 Correct 450 ms 19128 KB Output is correct
72 Correct 427 ms 17592 KB Output is correct
73 Correct 476 ms 17592 KB Output is correct
74 Correct 499 ms 18872 KB Output is correct
75 Correct 552 ms 19384 KB Output is correct
76 Correct 409 ms 17592 KB Output is correct
77 Correct 449 ms 18872 KB Output is correct
78 Correct 484 ms 19384 KB Output is correct
79 Correct 420 ms 18728 KB Output is correct
80 Correct 561 ms 18732 KB Output is correct
81 Correct 566 ms 19640 KB Output is correct
82 Correct 549 ms 18364 KB Output is correct
83 Correct 511 ms 16692 KB Output is correct
84 Correct 1342 ms 16320 KB Output is correct
85 Correct 827 ms 17452 KB Output is correct
86 Correct 628 ms 15296 KB Output is correct
87 Correct 1535 ms 16940 KB Output is correct
88 Correct 1684 ms 15932 KB Output is correct
89 Correct 640 ms 16700 KB Output is correct
90 Correct 824 ms 17464 KB Output is correct
91 Correct 649 ms 15804 KB Output is correct
92 Correct 868 ms 15808 KB Output is correct
93 Correct 892 ms 17704 KB Output is correct
94 Correct 1331 ms 19004 KB Output is correct
95 Execution timed out 2017 ms 18880 KB Time limit exceeded
96 Halted 0 ms 0 KB -