oj.uz

답안 #768692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768692 2023-06-28T12:05:21 Z jakobrs Joker (BOI20_joker) C++17
71 / 100
 2000 ms 8540 KB 
#include <algorithm>
#include <iostream>
#include <vector>

using i64 = int64_t;
using i32 = int32_t;

struct Operation {
    i32 l1, r1;
};

constexpr i64 root(i64 n) {
    i64 i = 0;
    for (; i * i <= n; i++)
        ;
    return i - 1;
}

class UnionFind {
    std::vector<i32> parent;
    std::vector<i32> sizes;
    std::vector<bool> edge_parity;

    std::vector<Operation> operations;

   public:
    UnionFind(size_t sz)
        : parent(sz, -1), sizes(sz, 1), edge_parity(sz, false), operations() {}

    template <bool PATH_COMPRESSION>
    i32 find(i32 idx) {
        if (parent[idx] < 0)
            return idx;
        else if constexpr (PATH_COMPRESSION) {
            i64 root = find<PATH_COMPRESSION>(parent[idx]);
            edge_parity[idx] = edge_parity[idx] ^ edge_parity[parent[idx]];
            return parent[idx] = root;
        } else
            return find<PATH_COMPRESSION>(parent[idx]);
    }

    bool parity(i32 idx) {
        if (parent[idx] < 0)
            return false;
        else
            return parity(parent[idx]) ^ edge_parity[idx];
    }

    template <bool PATH_COMPRESSION>
    std::pair<i32, bool> both(i32 idx) {
        if constexpr (PATH_COMPRESSION) {
            return {find<true>(idx), parity(idx)};
        } else {
            // in this case there's an easy iterative version
            bool parity = false;

            while (parent[idx] >= 0) {
                parity = parity ^ edge_parity[idx];
                idx = parent[idx];
            }

            return {idx, parity};
        }
    }

    template <bool PATH_COMPRESSION>
    bool lag_fagforening(i32 l, i32 r) {
        auto [l1, lp] = both<PATH_COMPRESSION>(l);
        auto [r1, rp] = both<PATH_COMPRESSION>(r);

        operations.push_back({
            .l1 = l1,
            .r1 = r1,
        });

        if (l1 == r1) {
            return lp != rp;
        } else {
            if (sizes[l1] < sizes[r1]) {
                std::swap(l1, r1);
                std::swap(lp, rp);
            }

            sizes[l1] += sizes[r1];
            parent[r1] = l1;

            edge_parity[r1] = 1 ^ lp ^ rp;

            return true;
        }
    }

    void tvungen_lønnsnemnd() {
        auto [l1, r1] = operations.back();
        operations.pop_back();

        if (parent[r1] == l1) {
            parent[r1] = -1;
            sizes[l1] -= sizes[r1];
        } else if (parent[l1] == r1) {
            parent[l1] = -1;
            sizes[r1] -= sizes[l1];
        }

        edge_parity[l1] = edge_parity[r1] = false;
    }
};

struct {
    template <typename T>
    operator T() const {
        T x;
        std::cin >> x;
        return x;
    }
} in;

#define entire(v) std::begin(v), std::end(v)

#pragma GCC diagnostic ignored "-Wreturn-type"

main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    i32 n, m, q;
    std::cin >> n >> m >> q;

    std::vector<std::pair<i32, i32>> edges(m);
    for (i32 i = 0; i < m; i++) {
        edges[i] = {(i32)in - 1, (i32)in - 1};
    }

    UnionFind dsu(n);

    static constexpr i32 root_m = 1024;

    struct Query {
        i32 l, r, i;
    };

    std::vector<Query> queries(q);
    for (i32 i = 0; i < q; i++) queries[i] = {(i32)in - 1, (i32)in, i};

    std::sort(entire(queries), [](auto &&lhs, auto &&rhs) {
        return std::pair<i32, i32>{lhs.l / root_m, -lhs.r} <
               std::pair<i32, i32>{rhs.l / root_m, -rhs.r};
    });

    std::vector<bool> answers(q);

    i32 l = 0;
    i32 r = 0;

    bool is_bipartite_left = true;
    for (i32 start = 0; start < m && is_bipartite_left; start += root_m) {
        while (r < q && queries[r].l < start + root_m) r++;

        bool is_bipartite_right = true;
        i32 w = m;
        for (; l < r && is_bipartite_right; l++) {
            for (; w > queries[l].r && is_bipartite_right; w--)
                is_bipartite_right &= dsu.lag_fagforening<false>(edges[w - 1].first, edges[w - 1].second);

            if (!is_bipartite_right) break;

            bool is_bipartite = true;
            i32 g = start;
            for (; g < queries[l].l && is_bipartite; g++)
                is_bipartite &= dsu.lag_fagforening<false>(edges[g].first, edges[g].second);

            answers[queries[l].i] = is_bipartite;

            for (i32 u = start; u < g; u++) dsu.tvungen_lønnsnemnd();
        }

        for (; l < r; l++)
            answers[queries[l].i] = false;

        for (i32 x = w; x < m; x++) dsu.tvungen_lønnsnemnd();

        for (i32 y = start; y < start + root_m && y < m; y++)
            is_bipartite_left &= dsu.lag_fagforening<true>(edges[y].first, edges[y].second);
    }

    for (; l < q; l++)
        answers[queries[l].i] = false;

    for (auto x : answers) {
        std::cout << (x ? "NO\n" : "YES\n");
    }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 408 KB Output is correct
30 Correct 8 ms 372 KB Output is correct
31 Correct 8 ms 428 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 6 ms 368 KB Output is correct
35 Correct 8 ms 340 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 17 ms 368 KB Output is correct
38 Correct 15 ms 444 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 7 ms 424 KB Output is correct
42 Correct 7 ms 328 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 2 ms 328 KB Output is correct
46 Correct 3 ms 336 KB Output is correct
47 Correct 7 ms 412 KB Output is correct
48 Correct 8 ms 328 KB Output is correct
49 Correct 8 ms 436 KB Output is correct
50 Correct 7 ms 368 KB Output is correct
51 Correct 7 ms 340 KB Output is correct
52 Correct 7 ms 376 KB Output is correct
53 Correct 7 ms 328 KB Output is correct
54 Correct 9 ms 436 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 65 ms 6676 KB Output is correct
4 Correct 83 ms 8296 KB Output is correct
5 Correct 68 ms 7964 KB Output is correct
6 Correct 65 ms 6612 KB Output is correct
7 Correct 67 ms 6772 KB Output is correct
8 Correct 63 ms 6620 KB Output is correct
9 Correct 62 ms 7000 KB Output is correct
10 Correct 65 ms 7728 KB Output is correct
11 Correct 66 ms 6800 KB Output is correct
12 Correct 70 ms 7376 KB Output is correct
13 Correct 64 ms 6108 KB Output is correct
14 Correct 66 ms 6484 KB Output is correct
15 Correct 66 ms 7104 KB Output is correct
16 Correct 66 ms 7628 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 65 ms 6676 KB Output is correct
30 Correct 83 ms 8296 KB Output is correct
31 Correct 68 ms 7964 KB Output is correct
32 Correct 65 ms 6612 KB Output is correct
33 Correct 67 ms 6772 KB Output is correct
34 Correct 63 ms 6620 KB Output is correct
35 Correct 62 ms 7000 KB Output is correct
36 Correct 65 ms 7728 KB Output is correct
37 Correct 66 ms 6800 KB Output is correct
38 Correct 70 ms 7376 KB Output is correct
39 Correct 64 ms 6108 KB Output is correct
40 Correct 66 ms 6484 KB Output is correct
41 Correct 66 ms 7104 KB Output is correct
42 Correct 66 ms 7628 KB Output is correct
43 Correct 310 ms 6744 KB Output is correct
44 Correct 361 ms 8236 KB Output is correct
45 Correct 354 ms 8412 KB Output is correct
46 Correct 265 ms 6808 KB Output is correct
47 Correct 269 ms 6940 KB Output is correct
48 Correct 94 ms 7112 KB Output is correct
49 Correct 120 ms 7872 KB Output is correct
50 Correct 320 ms 6708 KB Output is correct
51 Correct 326 ms 7236 KB Output is correct
52 Correct 320 ms 7780 KB Output is correct
53 Correct 333 ms 6432 KB Output is correct
54 Correct 379 ms 6704 KB Output is correct
55 Correct 358 ms 7272 KB Output is correct
56 Correct 384 ms 7788 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 408 KB Output is correct
30 Correct 8 ms 372 KB Output is correct
31 Correct 8 ms 428 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 6 ms 368 KB Output is correct
35 Correct 8 ms 340 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 17 ms 368 KB Output is correct
38 Correct 15 ms 444 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 7 ms 424 KB Output is correct
42 Correct 7 ms 328 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 2 ms 328 KB Output is correct
46 Correct 3 ms 336 KB Output is correct
47 Correct 7 ms 412 KB Output is correct
48 Correct 8 ms 328 KB Output is correct
49 Correct 8 ms 436 KB Output is correct
50 Correct 7 ms 368 KB Output is correct
51 Correct 7 ms 340 KB Output is correct
52 Correct 7 ms 376 KB Output is correct
53 Correct 7 ms 328 KB Output is correct
54 Correct 9 ms 436 KB Output is correct
55 Correct 166 ms 4072 KB Output is correct
56 Correct 677 ms 5940 KB Output is correct
57 Correct 45 ms 5696 KB Output is correct
58 Correct 38 ms 4072 KB Output is correct
59 Correct 76 ms 4164 KB Output is correct
60 Correct 144 ms 4712 KB Output is correct
61 Correct 100 ms 4188 KB Output is correct
62 Correct 179 ms 4816 KB Output is correct
63 Correct 44 ms 3540 KB Output is correct
64 Correct 100 ms 4304 KB Output is correct
65 Correct 184 ms 4844 KB Output is correct

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 408 KB Output is correct
30 Correct 8 ms 372 KB Output is correct
31 Correct 8 ms 428 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 6 ms 368 KB Output is correct
35 Correct 8 ms 340 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 17 ms 368 KB Output is correct
38 Correct 15 ms 444 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 7 ms 424 KB Output is correct
42 Correct 7 ms 328 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 2 ms 328 KB Output is correct
46 Correct 3 ms 336 KB Output is correct
47 Correct 7 ms 412 KB Output is correct
48 Correct 8 ms 328 KB Output is correct
49 Correct 8 ms 436 KB Output is correct
50 Correct 7 ms 368 KB Output is correct
51 Correct 7 ms 340 KB Output is correct
52 Correct 7 ms 376 KB Output is correct
53 Correct 7 ms 328 KB Output is correct
54 Correct 9 ms 436 KB Output is correct
55 Correct 65 ms 6676 KB Output is correct
56 Correct 83 ms 8296 KB Output is correct
57 Correct 68 ms 7964 KB Output is correct
58 Correct 65 ms 6612 KB Output is correct
59 Correct 67 ms 6772 KB Output is correct
60 Correct 63 ms 6620 KB Output is correct
61 Correct 62 ms 7000 KB Output is correct
62 Correct 65 ms 7728 KB Output is correct
63 Correct 66 ms 6800 KB Output is correct
64 Correct 70 ms 7376 KB Output is correct
65 Correct 64 ms 6108 KB Output is correct
66 Correct 66 ms 6484 KB Output is correct
67 Correct 66 ms 7104 KB Output is correct
68 Correct 66 ms 7628 KB Output is correct
69 Correct 310 ms 6744 KB Output is correct
70 Correct 361 ms 8236 KB Output is correct
71 Correct 354 ms 8412 KB Output is correct
72 Correct 265 ms 6808 KB Output is correct
73 Correct 269 ms 6940 KB Output is correct
74 Correct 94 ms 7112 KB Output is correct
75 Correct 120 ms 7872 KB Output is correct
76 Correct 320 ms 6708 KB Output is correct
77 Correct 326 ms 7236 KB Output is correct
78 Correct 320 ms 7780 KB Output is correct
79 Correct 333 ms 6432 KB Output is correct
80 Correct 379 ms 6704 KB Output is correct
81 Correct 358 ms 7272 KB Output is correct
82 Correct 384 ms 7788 KB Output is correct
83 Correct 166 ms 4072 KB Output is correct
84 Correct 677 ms 5940 KB Output is correct
85 Correct 45 ms 5696 KB Output is correct
86 Correct 38 ms 4072 KB Output is correct
87 Correct 76 ms 4164 KB Output is correct
88 Correct 144 ms 4712 KB Output is correct
89 Correct 100 ms 4188 KB Output is correct
90 Correct 179 ms 4816 KB Output is correct
91 Correct 44 ms 3540 KB Output is correct
92 Correct 100 ms 4304 KB Output is correct
93 Correct 184 ms 4844 KB Output is correct
94 Correct 819 ms 7104 KB Output is correct
95 Execution timed out 2031 ms 8540 KB Time limit exceeded
96 Halted 0 ms 0 KB -