oj.uz

Submission #1049721

# Submission time Handle Problem Language Result Execution time Memory
1049721 2024-08-09T04:27:49 Z shiomusubi496 Joker (BOI20_joker) C++17
71 / 100
 2000 ms 16184 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 = 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(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);
            }
            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 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 344 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 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 344 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 7 ms 344 KB Output is correct
30 Correct 4 ms 600 KB Output is correct
31 Correct 4 ms 612 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 3 ms 508 KB Output is correct
34 Correct 4 ms 452 KB Output is correct
35 Correct 6 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 7 ms 616 KB Output is correct
38 Correct 6 ms 856 KB Output is correct
39 Correct 8 ms 604 KB Output is correct
40 Correct 4 ms 444 KB Output is correct
41 Correct 6 ms 604 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 604 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 604 KB Output is correct
48 Correct 6 ms 604 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 6 ms 600 KB Output is correct
53 Correct 6 ms 604 KB Output is correct
54 Correct 6 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 115 ms 14172 KB Output is correct
4 Correct 107 ms 15680 KB Output is correct
5 Correct 117 ms 14272 KB Output is correct
6 Correct 113 ms 14912 KB Output is correct
7 Correct 115 ms 14016 KB Output is correct
8 Correct 108 ms 13152 KB Output is correct
9 Correct 107 ms 14276 KB Output is correct
10 Correct 110 ms 14268 KB Output is correct
11 Correct 115 ms 14528 KB Output is correct
12 Correct 156 ms 15808 KB Output is correct
13 Correct 118 ms 12988 KB Output is correct
14 Correct 117 ms 14784 KB Output is correct
15 Correct 124 ms 14940 KB Output is correct
16 Correct 147 ms 14528 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 344 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 115 ms 14172 KB Output is correct
30 Correct 107 ms 15680 KB Output is correct
31 Correct 117 ms 14272 KB Output is correct
32 Correct 113 ms 14912 KB Output is correct
33 Correct 115 ms 14016 KB Output is correct
34 Correct 108 ms 13152 KB Output is correct
35 Correct 107 ms 14276 KB Output is correct
36 Correct 110 ms 14268 KB Output is correct
37 Correct 115 ms 14528 KB Output is correct
38 Correct 156 ms 15808 KB Output is correct
39 Correct 118 ms 12988 KB Output is correct
40 Correct 117 ms 14784 KB Output is correct
41 Correct 124 ms 14940 KB Output is correct
42 Correct 147 ms 14528 KB Output is correct
43 Correct 350 ms 13912 KB Output is correct
44 Correct 342 ms 14380 KB Output is correct
45 Correct 350 ms 16064 KB Output is correct
46 Correct 361 ms 13880 KB Output is correct
47 Correct 441 ms 15036 KB Output is correct
48 Correct 461 ms 13360 KB Output is correct
49 Correct 469 ms 14524 KB Output is correct
50 Correct 355 ms 15196 KB Output is correct
51 Correct 385 ms 14264 KB Output is correct
52 Correct 389 ms 16184 KB Output is correct
53 Correct 397 ms 14952 KB Output is correct
54 Correct 450 ms 15036 KB Output is correct
55 Correct 452 ms 15292 KB Output is correct
56 Correct 462 ms 15916 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 344 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 7 ms 344 KB Output is correct
30 Correct 4 ms 600 KB Output is correct
31 Correct 4 ms 612 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 3 ms 508 KB Output is correct
34 Correct 4 ms 452 KB Output is correct
35 Correct 6 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 7 ms 616 KB Output is correct
38 Correct 6 ms 856 KB Output is correct
39 Correct 8 ms 604 KB Output is correct
40 Correct 4 ms 444 KB Output is correct
41 Correct 6 ms 604 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 604 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 604 KB Output is correct
48 Correct 6 ms 604 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 6 ms 600 KB Output is correct
53 Correct 6 ms 604 KB Output is correct
54 Correct 6 ms 604 KB Output is correct
55 Correct 385 ms 11828 KB Output is correct
56 Correct 1094 ms 12080 KB Output is correct
57 Correct 635 ms 12332 KB Output is correct
58 Correct 576 ms 11200 KB Output is correct
59 Correct 1346 ms 12076 KB Output is correct
60 Correct 1471 ms 11708 KB Output is correct
61 Correct 560 ms 12612 KB Output is correct
62 Correct 643 ms 13504 KB Output is correct
63 Correct 498 ms 11968 KB Output is correct
64 Correct 724 ms 11840 KB Output is correct
65 Correct 732 ms 12600 KB Output is correct

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 344 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 7 ms 344 KB Output is correct
30 Correct 4 ms 600 KB Output is correct
31 Correct 4 ms 612 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 3 ms 508 KB Output is correct
34 Correct 4 ms 452 KB Output is correct
35 Correct 6 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 7 ms 616 KB Output is correct
38 Correct 6 ms 856 KB Output is correct
39 Correct 8 ms 604 KB Output is correct
40 Correct 4 ms 444 KB Output is correct
41 Correct 6 ms 604 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 5 ms 604 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 604 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 6 ms 604 KB Output is correct
48 Correct 6 ms 604 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 604 KB Output is correct
51 Correct 5 ms 604 KB Output is correct
52 Correct 6 ms 600 KB Output is correct
53 Correct 6 ms 604 KB Output is correct
54 Correct 6 ms 604 KB Output is correct
55 Correct 115 ms 14172 KB Output is correct
56 Correct 107 ms 15680 KB Output is correct
57 Correct 117 ms 14272 KB Output is correct
58 Correct 113 ms 14912 KB Output is correct
59 Correct 115 ms 14016 KB Output is correct
60 Correct 108 ms 13152 KB Output is correct
61 Correct 107 ms 14276 KB Output is correct
62 Correct 110 ms 14268 KB Output is correct
63 Correct 115 ms 14528 KB Output is correct
64 Correct 156 ms 15808 KB Output is correct
65 Correct 118 ms 12988 KB Output is correct
66 Correct 117 ms 14784 KB Output is correct
67 Correct 124 ms 14940 KB Output is correct
68 Correct 147 ms 14528 KB Output is correct
69 Correct 350 ms 13912 KB Output is correct
70 Correct 342 ms 14380 KB Output is correct
71 Correct 350 ms 16064 KB Output is correct
72 Correct 361 ms 13880 KB Output is correct
73 Correct 441 ms 15036 KB Output is correct
74 Correct 461 ms 13360 KB Output is correct
75 Correct 469 ms 14524 KB Output is correct
76 Correct 355 ms 15196 KB Output is correct
77 Correct 385 ms 14264 KB Output is correct
78 Correct 389 ms 16184 KB Output is correct
79 Correct 397 ms 14952 KB Output is correct
80 Correct 450 ms 15036 KB Output is correct
81 Correct 452 ms 15292 KB Output is correct
82 Correct 462 ms 15916 KB Output is correct
83 Correct 385 ms 11828 KB Output is correct
84 Correct 1094 ms 12080 KB Output is correct
85 Correct 635 ms 12332 KB Output is correct
86 Correct 576 ms 11200 KB Output is correct
87 Correct 1346 ms 12076 KB Output is correct
88 Correct 1471 ms 11708 KB Output is correct
89 Correct 560 ms 12612 KB Output is correct
90 Correct 643 ms 13504 KB Output is correct
91 Correct 498 ms 11968 KB Output is correct
92 Correct 724 ms 11840 KB Output is correct
93 Correct 732 ms 12600 KB Output is correct
94 Correct 1054 ms 15412 KB Output is correct
95 Correct 1911 ms 14528 KB Output is correct
96 Correct 1925 ms 15676 KB Output is correct
97 Correct 1424 ms 13620 KB Output is correct
98 Correct 1486 ms 14524 KB Output is correct
99 Correct 1630 ms 14908 KB Output is correct
100 Execution timed out 2013 ms 14388 KB Time limit exceeded
101 Halted 0 ms 0 KB -