oj.uz

Submission #1049675

# Submission time Handle Problem Language Result Execution time Memory
1049675 2024-08-09T03:50:40 Z shiomusubi496 Joker (BOI20_joker) C++17
71 / 100
 2000 ms 31416 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;
    }
    int block = M / sqrt(Q);
    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);
    for (auto [l, r, k] : B) {
        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();
            curl += block;
            curr = M;
        }
        assert(curr >= r);
        rrep2 (i, r, curr) {
            uf.merge2(A[i].first, A[i].second + N);
            uf.merge2(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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 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 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 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 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 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 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 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 2 ms 604 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 796 KB Output is correct
32 Correct 4 ms 796 KB Output is correct
33 Correct 4 ms 620 KB Output is correct
34 Correct 6 ms 784 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 4 ms 624 KB Output is correct
41 Correct 4 ms 792 KB Output is correct
42 Correct 4 ms 796 KB Output is correct
43 Correct 4 ms 796 KB Output is correct
44 Correct 4 ms 796 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 4 ms 648 KB Output is correct
47 Correct 4 ms 668 KB Output is correct
48 Correct 4 ms 796 KB Output is correct
49 Correct 4 ms 796 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 5 ms 796 KB Output is correct
53 Correct 4 ms 792 KB Output is correct
54 Correct 4 ms 628 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 126 ms 29788 KB Output is correct
4 Correct 131 ms 30524 KB Output is correct
5 Correct 169 ms 30392 KB Output is correct
6 Correct 125 ms 29752 KB Output is correct
7 Correct 126 ms 29880 KB Output is correct
8 Correct 113 ms 29372 KB Output is correct
9 Correct 149 ms 29884 KB Output is correct
10 Correct 121 ms 31416 KB Output is correct
11 Correct 125 ms 30140 KB Output is correct
12 Correct 125 ms 31164 KB Output is correct
13 Correct 122 ms 29116 KB Output is correct
14 Correct 124 ms 29372 KB Output is correct
15 Correct 146 ms 30056 KB Output is correct
16 Correct 182 ms 30652 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 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 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 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 126 ms 29788 KB Output is correct
30 Correct 131 ms 30524 KB Output is correct
31 Correct 169 ms 30392 KB Output is correct
32 Correct 125 ms 29752 KB Output is correct
33 Correct 126 ms 29880 KB Output is correct
34 Correct 113 ms 29372 KB Output is correct
35 Correct 149 ms 29884 KB Output is correct
36 Correct 121 ms 31416 KB Output is correct
37 Correct 125 ms 30140 KB Output is correct
38 Correct 125 ms 31164 KB Output is correct
39 Correct 122 ms 29116 KB Output is correct
40 Correct 124 ms 29372 KB Output is correct
41 Correct 146 ms 30056 KB Output is correct
42 Correct 182 ms 30652 KB Output is correct
43 Correct 390 ms 29828 KB Output is correct
44 Correct 418 ms 30500 KB Output is correct
45 Correct 431 ms 30640 KB Output is correct
46 Correct 384 ms 29748 KB Output is correct
47 Correct 455 ms 30080 KB Output is correct
48 Correct 396 ms 29728 KB Output is correct
49 Correct 445 ms 30636 KB Output is correct
50 Correct 406 ms 29604 KB Output is correct
51 Correct 415 ms 30124 KB Output is correct
52 Correct 419 ms 30780 KB Output is correct
53 Correct 360 ms 29216 KB Output is correct
54 Correct 479 ms 29716 KB Output is correct
55 Correct 470 ms 30000 KB Output is correct
56 Correct 484 ms 30636 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 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 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 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 2 ms 604 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 796 KB Output is correct
32 Correct 4 ms 796 KB Output is correct
33 Correct 4 ms 620 KB Output is correct
34 Correct 6 ms 784 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 4 ms 624 KB Output is correct
41 Correct 4 ms 792 KB Output is correct
42 Correct 4 ms 796 KB Output is correct
43 Correct 4 ms 796 KB Output is correct
44 Correct 4 ms 796 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 4 ms 648 KB Output is correct
47 Correct 4 ms 668 KB Output is correct
48 Correct 4 ms 796 KB Output is correct
49 Correct 4 ms 796 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 5 ms 796 KB Output is correct
53 Correct 4 ms 792 KB Output is correct
54 Correct 4 ms 628 KB Output is correct
55 Correct 328 ms 27436 KB Output is correct
56 Correct 382 ms 28344 KB Output is correct
57 Correct 409 ms 28092 KB Output is correct
58 Correct 421 ms 27448 KB Output is correct
59 Correct 401 ms 27324 KB Output is correct
60 Correct 491 ms 27836 KB Output is correct
61 Correct 410 ms 27320 KB Output is correct
62 Correct 450 ms 27944 KB Output is correct
63 Correct 289 ms 26940 KB Output is correct
64 Correct 435 ms 27692 KB Output is correct
65 Correct 527 ms 28084 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 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 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 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 2 ms 604 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 796 KB Output is correct
32 Correct 4 ms 796 KB Output is correct
33 Correct 4 ms 620 KB Output is correct
34 Correct 6 ms 784 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 4 ms 624 KB Output is correct
41 Correct 4 ms 792 KB Output is correct
42 Correct 4 ms 796 KB Output is correct
43 Correct 4 ms 796 KB Output is correct
44 Correct 4 ms 796 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 4 ms 648 KB Output is correct
47 Correct 4 ms 668 KB Output is correct
48 Correct 4 ms 796 KB Output is correct
49 Correct 4 ms 796 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 5 ms 796 KB Output is correct
53 Correct 4 ms 792 KB Output is correct
54 Correct 4 ms 628 KB Output is correct
55 Correct 126 ms 29788 KB Output is correct
56 Correct 131 ms 30524 KB Output is correct
57 Correct 169 ms 30392 KB Output is correct
58 Correct 125 ms 29752 KB Output is correct
59 Correct 126 ms 29880 KB Output is correct
60 Correct 113 ms 29372 KB Output is correct
61 Correct 149 ms 29884 KB Output is correct
62 Correct 121 ms 31416 KB Output is correct
63 Correct 125 ms 30140 KB Output is correct
64 Correct 125 ms 31164 KB Output is correct
65 Correct 122 ms 29116 KB Output is correct
66 Correct 124 ms 29372 KB Output is correct
67 Correct 146 ms 30056 KB Output is correct
68 Correct 182 ms 30652 KB Output is correct
69 Correct 390 ms 29828 KB Output is correct
70 Correct 418 ms 30500 KB Output is correct
71 Correct 431 ms 30640 KB Output is correct
72 Correct 384 ms 29748 KB Output is correct
73 Correct 455 ms 30080 KB Output is correct
74 Correct 396 ms 29728 KB Output is correct
75 Correct 445 ms 30636 KB Output is correct
76 Correct 406 ms 29604 KB Output is correct
77 Correct 415 ms 30124 KB Output is correct
78 Correct 419 ms 30780 KB Output is correct
79 Correct 360 ms 29216 KB Output is correct
80 Correct 479 ms 29716 KB Output is correct
81 Correct 470 ms 30000 KB Output is correct
82 Correct 484 ms 30636 KB Output is correct
83 Correct 328 ms 27436 KB Output is correct
84 Correct 382 ms 28344 KB Output is correct
85 Correct 409 ms 28092 KB Output is correct
86 Correct 421 ms 27448 KB Output is correct
87 Correct 401 ms 27324 KB Output is correct
88 Correct 491 ms 27836 KB Output is correct
89 Correct 410 ms 27320 KB Output is correct
90 Correct 450 ms 27944 KB Output is correct
91 Correct 289 ms 26940 KB Output is correct
92 Correct 435 ms 27692 KB Output is correct
93 Correct 527 ms 28084 KB Output is correct
94 Execution timed out 2013 ms 29740 KB Time limit exceeded
95 Halted 0 ms 0 KB -