oj.uz

답안 #1049664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049664 2024-08-09T03:43:19 Z shiomusubi496 Joker (BOI20_joker) C++17
49 / 100
 2000 ms 23992 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 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;
    }
    bool same(int x, int y) { return find(x) == find(y); }
    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()) undo();
    }
    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 = sqrt(N);
    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.merge(A[i].first, A[i].second + N);
                uf.merge(A[i].first + N, A[i].second);
            }
            uf.snapshot();
            curl += block;
            curr = M;
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 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 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 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 0 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 2 ms 444 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 472 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 3 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 4 ms 600 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 448 KB Output is correct
49 Correct 3 ms 488 KB Output is correct
50 Correct 3 ms 604 KB Output is correct
51 Correct 3 ms 664 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 3 ms 668 KB Output is correct
54 Correct 3 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 120 ms 18880 KB Output is correct
4 Correct 125 ms 19392 KB Output is correct
5 Correct 122 ms 19512 KB Output is correct
6 Correct 121 ms 19392 KB Output is correct
7 Correct 119 ms 18620 KB Output is correct
8 Correct 112 ms 18108 KB Output is correct
9 Correct 111 ms 18880 KB Output is correct
10 Correct 116 ms 20156 KB Output is correct
11 Correct 119 ms 17968 KB Output is correct
12 Correct 122 ms 19904 KB Output is correct
13 Correct 121 ms 18748 KB Output is correct
14 Correct 141 ms 18368 KB Output is correct
15 Correct 133 ms 18624 KB Output is correct
16 Correct 121 ms 18364 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 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 0 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 120 ms 18880 KB Output is correct
30 Correct 125 ms 19392 KB Output is correct
31 Correct 122 ms 19512 KB Output is correct
32 Correct 121 ms 19392 KB Output is correct
33 Correct 119 ms 18620 KB Output is correct
34 Correct 112 ms 18108 KB Output is correct
35 Correct 111 ms 18880 KB Output is correct
36 Correct 116 ms 20156 KB Output is correct
37 Correct 119 ms 17968 KB Output is correct
38 Correct 122 ms 19904 KB Output is correct
39 Correct 121 ms 18748 KB Output is correct
40 Correct 141 ms 18368 KB Output is correct
41 Correct 133 ms 18624 KB Output is correct
42 Correct 121 ms 18364 KB Output is correct
43 Correct 448 ms 18612 KB Output is correct
44 Correct 467 ms 19540 KB Output is correct
45 Correct 434 ms 19640 KB Output is correct
46 Correct 426 ms 18872 KB Output is correct
47 Correct 521 ms 19388 KB Output is correct
48 Correct 523 ms 18724 KB Output is correct
49 Correct 529 ms 18616 KB Output is correct
50 Correct 401 ms 17780 KB Output is correct
51 Correct 461 ms 18616 KB Output is correct
52 Correct 496 ms 19640 KB Output is correct
53 Correct 291 ms 17596 KB Output is correct
54 Correct 547 ms 18872 KB Output is correct
55 Correct 584 ms 22680 KB Output is correct
56 Correct 548 ms 23992 KB Output is correct

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 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 0 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 2 ms 444 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 472 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 3 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 4 ms 600 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 448 KB Output is correct
49 Correct 3 ms 488 KB Output is correct
50 Correct 3 ms 604 KB Output is correct
51 Correct 3 ms 664 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 3 ms 668 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 681 ms 17340 KB Output is correct
56 Correct 1375 ms 17856 KB Output is correct
57 Correct 841 ms 20272 KB Output is correct
58 Correct 1028 ms 17344 KB Output is correct
59 Execution timed out 2081 ms 18088 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 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 0 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 2 ms 444 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 472 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 3 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 4 ms 600 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 448 KB Output is correct
49 Correct 3 ms 488 KB Output is correct
50 Correct 3 ms 604 KB Output is correct
51 Correct 3 ms 664 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 3 ms 668 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 120 ms 18880 KB Output is correct
56 Correct 125 ms 19392 KB Output is correct
57 Correct 122 ms 19512 KB Output is correct
58 Correct 121 ms 19392 KB Output is correct
59 Correct 119 ms 18620 KB Output is correct
60 Correct 112 ms 18108 KB Output is correct
61 Correct 111 ms 18880 KB Output is correct
62 Correct 116 ms 20156 KB Output is correct
63 Correct 119 ms 17968 KB Output is correct
64 Correct 122 ms 19904 KB Output is correct
65 Correct 121 ms 18748 KB Output is correct
66 Correct 141 ms 18368 KB Output is correct
67 Correct 133 ms 18624 KB Output is correct
68 Correct 121 ms 18364 KB Output is correct
69 Correct 448 ms 18612 KB Output is correct
70 Correct 467 ms 19540 KB Output is correct
71 Correct 434 ms 19640 KB Output is correct
72 Correct 426 ms 18872 KB Output is correct
73 Correct 521 ms 19388 KB Output is correct
74 Correct 523 ms 18724 KB Output is correct
75 Correct 529 ms 18616 KB Output is correct
76 Correct 401 ms 17780 KB Output is correct
77 Correct 461 ms 18616 KB Output is correct
78 Correct 496 ms 19640 KB Output is correct
79 Correct 291 ms 17596 KB Output is correct
80 Correct 547 ms 18872 KB Output is correct
81 Correct 584 ms 22680 KB Output is correct
82 Correct 548 ms 23992 KB Output is correct
83 Correct 681 ms 17340 KB Output is correct
84 Correct 1375 ms 17856 KB Output is correct
85 Correct 841 ms 20272 KB Output is correct
86 Correct 1028 ms 17344 KB Output is correct
87 Execution timed out 2081 ms 18088 KB Time limit exceeded
88 Halted 0 ms 0 KB -