oj.uz

Submission #1049710

# Submission time Handle Problem Language Result Execution time Memory
1049710 2024-08-09T04:25:10 Z shiomusubi496 Joker (BOI20_joker) C++17
71 / 100
 2000 ms 19736 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 {
    bool flag = true;
    vector<int> par, wei;
    vector<tuple<int, int, int, bool>> history;

public:
    UndoableUF(int n_) : par(n_, -1), wei(n_, 0) {}
    int find(int x) { return par[x] < 0 ? x : find(par[x]); }
    bool same(int x, int y) { return find(x) == find(y); }
    int weight(int x) { return par[x] < 0 ? wei[x] : wei[x] ^ weight(par[x]); }
    bool merge(int x, int y) {
        int xr = find(x), yr = find(y);
        int w = weight(x) ^ weight(y);
        x = xr, y = yr;
        history.emplace_back(x, par[x], wei[x], flag);
        history.emplace_back(y, par[y], wei[y], flag);
        if (x == y) {
            if (w == 0) flag = false;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        wei[y] = 1 ^ w;
        return true;
    }
    int find2(int x) {
        if (par[x] < 0) return x;
        int r = find2(par[x]);
        // history.emplace_back(x, par[x], wei[x], flag);
        wei[x] ^= wei[par[x]];
        return par[x] = r;
    }
    bool same2(int x, int y) { return find2(x) == find2(y); }
    bool merge2(int x, int y) {
        int xr = find2(x), yr = find2(y);
        int w = wei[x] ^ wei[y];
        x = xr, y = yr;
        // history.emplace_back(x, par[x], wei[x], flag);
        // history.emplace_back(y, par[y], wei[y], flag);
        if (x == y) {
            if (w == 0) flag = false;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        wei[y] = 1 ^ w;
        return true;
    }
    void undo() {
        auto [x, px, wx, _] = history.back(); history.pop_back();
        auto [y, py, wy, f] = history.back(); history.pop_back();
        par[x] = px;
        par[y] = py;
        wei[x] = wx;
        wei[y] = wy;
        flag = f;
    }
    void snapshot() { history.clear(); }
    void rollback() {
        while (!history.empty()) {
            auto [x, px, wx, f] = history.back(); history.pop_back();
            par[x] = px;
            wei[x] = wx;
            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 = 470;
    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(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.merge(A[i].first, 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);
        }
        curr = r;
        rep2 (i, curl - block, l) {
            uf.merge(A[i].first, A[i].second);
        }
        ans[k] = uf.is_bip();
        rep2 (i, curl - block, l) 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 7 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 5 ms 604 KB Output is correct
35 Correct 7 ms 600 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 7 ms 604 KB Output is correct
39 Correct 6 ms 604 KB Output is correct
40 Correct 7 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 10 ms 604 KB Output is correct
45 Correct 5 ms 608 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 528 KB Output is correct
48 Correct 5 ms 608 KB Output is correct
49 Correct 5 ms 604 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 5 ms 604 KB Output is correct
53 Correct 9 ms 544 KB Output is correct
54 Correct 5 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 1 ms 348 KB Output is correct
3 Correct 118 ms 14144 KB Output is correct
4 Correct 153 ms 15548 KB Output is correct
5 Correct 121 ms 14656 KB Output is correct
6 Correct 130 ms 14172 KB Output is correct
7 Correct 154 ms 15408 KB Output is correct
8 Correct 105 ms 13888 KB Output is correct
9 Correct 109 ms 14784 KB Output is correct
10 Correct 114 ms 15676 KB Output is correct
11 Correct 115 ms 15044 KB Output is correct
12 Correct 128 ms 14396 KB Output is correct
13 Correct 116 ms 13756 KB Output is correct
14 Correct 119 ms 14900 KB Output is correct
15 Correct 121 ms 14132 KB Output is correct
16 Correct 120 ms 14636 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 118 ms 14144 KB Output is correct
30 Correct 153 ms 15548 KB Output is correct
31 Correct 121 ms 14656 KB Output is correct
32 Correct 130 ms 14172 KB Output is correct
33 Correct 154 ms 15408 KB Output is correct
34 Correct 105 ms 13888 KB Output is correct
35 Correct 109 ms 14784 KB Output is correct
36 Correct 114 ms 15676 KB Output is correct
37 Correct 115 ms 15044 KB Output is correct
38 Correct 128 ms 14396 KB Output is correct
39 Correct 116 ms 13756 KB Output is correct
40 Correct 119 ms 14900 KB Output is correct
41 Correct 121 ms 14132 KB Output is correct
42 Correct 120 ms 14636 KB Output is correct
43 Correct 377 ms 14776 KB Output is correct
44 Correct 336 ms 16064 KB Output is correct
45 Correct 342 ms 15292 KB Output is correct
46 Correct 352 ms 13612 KB Output is correct
47 Correct 410 ms 13640 KB Output is correct
48 Correct 462 ms 14008 KB Output is correct
49 Correct 474 ms 14268 KB Output is correct
50 Correct 369 ms 14124 KB Output is correct
51 Correct 383 ms 13852 KB Output is correct
52 Correct 373 ms 15804 KB Output is correct
53 Correct 388 ms 13240 KB Output is correct
54 Correct 453 ms 13756 KB Output is correct
55 Correct 456 ms 15032 KB Output is correct
56 Correct 458 ms 14520 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 7 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 5 ms 604 KB Output is correct
35 Correct 7 ms 600 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 7 ms 604 KB Output is correct
39 Correct 6 ms 604 KB Output is correct
40 Correct 7 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 10 ms 604 KB Output is correct
45 Correct 5 ms 608 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 528 KB Output is correct
48 Correct 5 ms 608 KB Output is correct
49 Correct 5 ms 604 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 5 ms 604 KB Output is correct
53 Correct 9 ms 544 KB Output is correct
54 Correct 5 ms 604 KB Output is correct
55 Correct 419 ms 12220 KB Output is correct
56 Correct 1114 ms 13508 KB Output is correct
57 Correct 628 ms 12992 KB Output is correct
58 Correct 588 ms 11712 KB Output is correct
59 Correct 1492 ms 12736 KB Output is correct
60 Correct 1506 ms 12224 KB Output is correct
61 Correct 585 ms 10948 KB Output is correct
62 Correct 667 ms 12476 KB Output is correct
63 Correct 721 ms 11196 KB Output is correct
64 Correct 847 ms 13372 KB Output is correct
65 Correct 794 ms 13104 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 7 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 5 ms 604 KB Output is correct
35 Correct 7 ms 600 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 7 ms 604 KB Output is correct
39 Correct 6 ms 604 KB Output is correct
40 Correct 7 ms 604 KB Output is correct
41 Correct 5 ms 604 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 10 ms 604 KB Output is correct
45 Correct 5 ms 608 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 528 KB Output is correct
48 Correct 5 ms 608 KB Output is correct
49 Correct 5 ms 604 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 5 ms 604 KB Output is correct
53 Correct 9 ms 544 KB Output is correct
54 Correct 5 ms 604 KB Output is correct
55 Correct 118 ms 14144 KB Output is correct
56 Correct 153 ms 15548 KB Output is correct
57 Correct 121 ms 14656 KB Output is correct
58 Correct 130 ms 14172 KB Output is correct
59 Correct 154 ms 15408 KB Output is correct
60 Correct 105 ms 13888 KB Output is correct
61 Correct 109 ms 14784 KB Output is correct
62 Correct 114 ms 15676 KB Output is correct
63 Correct 115 ms 15044 KB Output is correct
64 Correct 128 ms 14396 KB Output is correct
65 Correct 116 ms 13756 KB Output is correct
66 Correct 119 ms 14900 KB Output is correct
67 Correct 121 ms 14132 KB Output is correct
68 Correct 120 ms 14636 KB Output is correct
69 Correct 377 ms 14776 KB Output is correct
70 Correct 336 ms 16064 KB Output is correct
71 Correct 342 ms 15292 KB Output is correct
72 Correct 352 ms 13612 KB Output is correct
73 Correct 410 ms 13640 KB Output is correct
74 Correct 462 ms 14008 KB Output is correct
75 Correct 474 ms 14268 KB Output is correct
76 Correct 369 ms 14124 KB Output is correct
77 Correct 383 ms 13852 KB Output is correct
78 Correct 373 ms 15804 KB Output is correct
79 Correct 388 ms 13240 KB Output is correct
80 Correct 453 ms 13756 KB Output is correct
81 Correct 456 ms 15032 KB Output is correct
82 Correct 458 ms 14520 KB Output is correct
83 Correct 419 ms 12220 KB Output is correct
84 Correct 1114 ms 13508 KB Output is correct
85 Correct 628 ms 12992 KB Output is correct
86 Correct 588 ms 11712 KB Output is correct
87 Correct 1492 ms 12736 KB Output is correct
88 Correct 1506 ms 12224 KB Output is correct
89 Correct 585 ms 10948 KB Output is correct
90 Correct 667 ms 12476 KB Output is correct
91 Correct 721 ms 11196 KB Output is correct
92 Correct 847 ms 13372 KB Output is correct
93 Correct 794 ms 13104 KB Output is correct
94 Correct 1040 ms 13872 KB Output is correct
95 Correct 1867 ms 15408 KB Output is correct
96 Correct 1873 ms 19644 KB Output is correct
97 Correct 1474 ms 19648 KB Output is correct
98 Correct 1612 ms 19136 KB Output is correct
99 Correct 1879 ms 19648 KB Output is correct
100 Execution timed out 2060 ms 19736 KB Time limit exceeded
101 Halted 0 ms 0 KB -