oj.uz

답안 #767480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767480 2023-06-26T19:34:22 Z jakobrs Joker (BOI20_joker) C++17
71 / 100
 2000 ms 10688 KB 
#include <algorithm>
#include <iostream>
#include <vector>

using i64 = int32_t;

struct Operation {
    i64 l1, parent_l1, r1, parent_r1;
    bool is_bipartite;
};

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

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

    std::vector<Operation> operations;

   public:
    bool is_bipartite = true;

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

    template <bool PATH_COMPRESSION>
    i64 find(i64 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(i64 idx) {
        if (parent[idx] < 0)
            return false;
        else
            return parity(parent[idx]) ^ edge_parity[idx];
    }

    template <bool PATH_COMPRESSION>
    std::pair<i64, bool> both(i64 idx) {
        if constexpr (PATH_COMPRESSION) {
            return {find<true>(idx), parity(idx)};
        } else {
            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(i64 l, i64 r) {
        auto [l1, lp] = both<PATH_COMPRESSION>(l);
        auto [r1, rp] = both<PATH_COMPRESSION>(r);

        operations.push_back({
            .l1 = l1,
            .parent_l1 = parent[l1],
            .r1 = r1,
            .parent_r1 = parent[r1],
            .is_bipartite = is_bipartite,
        });

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

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

            edge_parity[r1] = 1 ^ lp ^ rp;

            return false;
        }
    }

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

        parent[l1] = parent_l1;
        parent[r1] = parent_r1;

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

        is_bipartite = bpt;
    }
};

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"

template <class T, class U>
struct SwapComparator {
    void operator()(std::pair<T, U> const &lhs, std::pair<T, U> const &rhs) {
        return std::tie(lhs.second, lhs.first) <
               std::tie(rhs.second, rhs.first);
    }
};

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

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

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

    UnionFind dsu(n);

    static constexpr i64 root_m = 1024;

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

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

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

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

    i64 l = 0;
    i64 r = 0;

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

        i64 w = m;
        for (i64 i = l; i < r; i++) {
            for (i64 o = queries[i].r; o < w; o++)
                dsu.lag_fagforening<false>(edges[o].first, edges[o].second);
            w = queries[i].r;

            for (i64 g = start; g < queries[i].l; g++)
                dsu.lag_fagforening<false>(edges[g].first, edges[g].second);

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

            for (i64 g = start; g < queries[i].l; g++) dsu.tvungen_lønnsnemnd();
        }

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

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

    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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct
29 Correct 15 ms 340 KB Output is correct
30 Correct 15 ms 468 KB Output is correct
31 Correct 17 ms 468 KB Output is correct
32 Correct 20 ms 472 KB Output is correct
33 Correct 18 ms 456 KB Output is correct
34 Correct 18 ms 488 KB Output is correct
35 Correct 17 ms 460 KB Output is correct
36 Correct 18 ms 480 KB Output is correct
37 Correct 16 ms 484 KB Output is correct
38 Correct 16 ms 484 KB Output is correct
39 Correct 16 ms 472 KB Output is correct
40 Correct 18 ms 480 KB Output is correct
41 Correct 18 ms 468 KB Output is correct
42 Correct 17 ms 468 KB Output is correct
43 Correct 21 ms 464 KB Output is correct
44 Correct 19 ms 468 KB Output is correct
45 Correct 18 ms 488 KB Output is correct
46 Correct 18 ms 468 KB Output is correct
47 Correct 18 ms 464 KB Output is correct
48 Correct 18 ms 468 KB Output is correct
49 Correct 17 ms 380 KB Output is correct
50 Correct 16 ms 488 KB Output is correct
51 Correct 18 ms 440 KB Output is correct
52 Correct 18 ms 480 KB Output is correct
53 Correct 17 ms 464 KB Output is correct
54 Correct 17 ms 460 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 75 ms 10072 KB Output is correct
4 Correct 77 ms 10576 KB Output is correct
5 Correct 78 ms 10440 KB Output is correct
6 Correct 74 ms 10132 KB Output is correct
7 Correct 75 ms 10128 KB Output is correct
8 Correct 71 ms 9916 KB Output is correct
9 Correct 91 ms 10076 KB Output is correct
10 Correct 80 ms 10532 KB Output is correct
11 Correct 74 ms 10176 KB Output is correct
12 Correct 77 ms 10468 KB Output is correct
13 Correct 74 ms 9808 KB Output is correct
14 Correct 78 ms 9972 KB Output is correct
15 Correct 77 ms 10304 KB Output is correct
16 Correct 77 ms 10580 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct
29 Correct 75 ms 10072 KB Output is correct
30 Correct 77 ms 10576 KB Output is correct
31 Correct 78 ms 10440 KB Output is correct
32 Correct 74 ms 10132 KB Output is correct
33 Correct 75 ms 10128 KB Output is correct
34 Correct 71 ms 9916 KB Output is correct
35 Correct 91 ms 10076 KB Output is correct
36 Correct 80 ms 10532 KB Output is correct
37 Correct 74 ms 10176 KB Output is correct
38 Correct 77 ms 10468 KB Output is correct
39 Correct 74 ms 9808 KB Output is correct
40 Correct 78 ms 9972 KB Output is correct
41 Correct 77 ms 10304 KB Output is correct
42 Correct 77 ms 10580 KB Output is correct
43 Correct 386 ms 10096 KB Output is correct
44 Correct 368 ms 10552 KB Output is correct
45 Correct 375 ms 10564 KB Output is correct
46 Correct 389 ms 10068 KB Output is correct
47 Correct 427 ms 10152 KB Output is correct
48 Correct 489 ms 10156 KB Output is correct
49 Correct 494 ms 10688 KB Output is correct
50 Correct 411 ms 10200 KB Output is correct
51 Correct 410 ms 10348 KB Output is correct
52 Correct 385 ms 10496 KB Output is correct
53 Correct 441 ms 9804 KB Output is correct
54 Correct 440 ms 10136 KB Output is correct
55 Correct 480 ms 10248 KB Output is correct
56 Correct 440 ms 10584 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct
29 Correct 15 ms 340 KB Output is correct
30 Correct 15 ms 468 KB Output is correct
31 Correct 17 ms 468 KB Output is correct
32 Correct 20 ms 472 KB Output is correct
33 Correct 18 ms 456 KB Output is correct
34 Correct 18 ms 488 KB Output is correct
35 Correct 17 ms 460 KB Output is correct
36 Correct 18 ms 480 KB Output is correct
37 Correct 16 ms 484 KB Output is correct
38 Correct 16 ms 484 KB Output is correct
39 Correct 16 ms 472 KB Output is correct
40 Correct 18 ms 480 KB Output is correct
41 Correct 18 ms 468 KB Output is correct
42 Correct 17 ms 468 KB Output is correct
43 Correct 21 ms 464 KB Output is correct
44 Correct 19 ms 468 KB Output is correct
45 Correct 18 ms 488 KB Output is correct
46 Correct 18 ms 468 KB Output is correct
47 Correct 18 ms 464 KB Output is correct
48 Correct 18 ms 468 KB Output is correct
49 Correct 17 ms 380 KB Output is correct
50 Correct 16 ms 488 KB Output is correct
51 Correct 18 ms 440 KB Output is correct
52 Correct 18 ms 480 KB Output is correct
53 Correct 17 ms 464 KB Output is correct
54 Correct 17 ms 460 KB Output is correct
55 Correct 308 ms 7768 KB Output is correct
56 Correct 458 ms 8272 KB Output is correct
57 Correct 378 ms 8272 KB Output is correct
58 Correct 400 ms 7876 KB Output is correct
59 Correct 712 ms 7868 KB Output is correct
60 Correct 882 ms 8144 KB Output is correct
61 Correct 494 ms 7872 KB Output is correct
62 Correct 530 ms 8280 KB Output is correct
63 Correct 422 ms 7484 KB Output is correct
64 Correct 575 ms 7888 KB Output is correct
65 Correct 593 ms 8108 KB Output is correct

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 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 340 KB Output is correct
29 Correct 15 ms 340 KB Output is correct
30 Correct 15 ms 468 KB Output is correct
31 Correct 17 ms 468 KB Output is correct
32 Correct 20 ms 472 KB Output is correct
33 Correct 18 ms 456 KB Output is correct
34 Correct 18 ms 488 KB Output is correct
35 Correct 17 ms 460 KB Output is correct
36 Correct 18 ms 480 KB Output is correct
37 Correct 16 ms 484 KB Output is correct
38 Correct 16 ms 484 KB Output is correct
39 Correct 16 ms 472 KB Output is correct
40 Correct 18 ms 480 KB Output is correct
41 Correct 18 ms 468 KB Output is correct
42 Correct 17 ms 468 KB Output is correct
43 Correct 21 ms 464 KB Output is correct
44 Correct 19 ms 468 KB Output is correct
45 Correct 18 ms 488 KB Output is correct
46 Correct 18 ms 468 KB Output is correct
47 Correct 18 ms 464 KB Output is correct
48 Correct 18 ms 468 KB Output is correct
49 Correct 17 ms 380 KB Output is correct
50 Correct 16 ms 488 KB Output is correct
51 Correct 18 ms 440 KB Output is correct
52 Correct 18 ms 480 KB Output is correct
53 Correct 17 ms 464 KB Output is correct
54 Correct 17 ms 460 KB Output is correct
55 Correct 75 ms 10072 KB Output is correct
56 Correct 77 ms 10576 KB Output is correct
57 Correct 78 ms 10440 KB Output is correct
58 Correct 74 ms 10132 KB Output is correct
59 Correct 75 ms 10128 KB Output is correct
60 Correct 71 ms 9916 KB Output is correct
61 Correct 91 ms 10076 KB Output is correct
62 Correct 80 ms 10532 KB Output is correct
63 Correct 74 ms 10176 KB Output is correct
64 Correct 77 ms 10468 KB Output is correct
65 Correct 74 ms 9808 KB Output is correct
66 Correct 78 ms 9972 KB Output is correct
67 Correct 77 ms 10304 KB Output is correct
68 Correct 77 ms 10580 KB Output is correct
69 Correct 386 ms 10096 KB Output is correct
70 Correct 368 ms 10552 KB Output is correct
71 Correct 375 ms 10564 KB Output is correct
72 Correct 389 ms 10068 KB Output is correct
73 Correct 427 ms 10152 KB Output is correct
74 Correct 489 ms 10156 KB Output is correct
75 Correct 494 ms 10688 KB Output is correct
76 Correct 411 ms 10200 KB Output is correct
77 Correct 410 ms 10348 KB Output is correct
78 Correct 385 ms 10496 KB Output is correct
79 Correct 441 ms 9804 KB Output is correct
80 Correct 440 ms 10136 KB Output is correct
81 Correct 480 ms 10248 KB Output is correct
82 Correct 440 ms 10584 KB Output is correct
83 Correct 308 ms 7768 KB Output is correct
84 Correct 458 ms 8272 KB Output is correct
85 Correct 378 ms 8272 KB Output is correct
86 Correct 400 ms 7876 KB Output is correct
87 Correct 712 ms 7868 KB Output is correct
88 Correct 882 ms 8144 KB Output is correct
89 Correct 494 ms 7872 KB Output is correct
90 Correct 530 ms 8280 KB Output is correct
91 Correct 422 ms 7484 KB Output is correct
92 Correct 575 ms 7888 KB Output is correct
93 Correct 593 ms 8108 KB Output is correct
94 Execution timed out 2067 ms 10068 KB Time limit exceeded
95 Halted 0 ms 0 KB -