oj.uz

Submission #768674

# Submission time Handle Problem Language Result Execution time Memory
768674 2023-06-28T11:21:49 Z jakobrs Joker (BOI20_joker) C++17
39 / 100
 2000 ms 13344 KB 
#include <algorithm>
#include <iostream>
#include <vector>

#pragma GCC optimize("O3")

using i64 = int64_t;
using i32 = int32_t;

struct Operation {
    i32 l1, r1;
    bool is_bipartite;
};

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:
    bool is_bipartite = true;

    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,
            .is_bipartite = is_bipartite,
        });

        if (l1 == r1) {
            return !(is_bipartite &= 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 false;
        }
    }

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

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

        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"

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;

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

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

            for (i32 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 (i32 g = start; g < queries[i].l; g++) dsu.tvungen_lønnsnemnd();
        }

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

        for (i32 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 312 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 340 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 312 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 340 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 412 KB Output is correct
30 Correct 48 ms 436 KB Output is correct
31 Correct 129 ms 436 KB Output is correct
32 Correct 94 ms 432 KB Output is correct
33 Correct 66 ms 424 KB Output is correct
34 Correct 92 ms 440 KB Output is correct
35 Correct 89 ms 436 KB Output is correct
36 Correct 14 ms 468 KB Output is correct
37 Correct 13 ms 452 KB Output is correct
38 Correct 15 ms 464 KB Output is correct
39 Correct 72 ms 448 KB Output is correct
40 Correct 44 ms 340 KB Output is correct
41 Correct 35 ms 432 KB Output is correct
42 Correct 35 ms 456 KB Output is correct
43 Correct 169 ms 428 KB Output is correct
44 Correct 264 ms 448 KB Output is correct
45 Correct 280 ms 376 KB Output is correct
46 Correct 196 ms 340 KB Output is correct
47 Correct 47 ms 444 KB Output is correct
48 Correct 61 ms 428 KB Output is correct
49 Correct 86 ms 368 KB Output is correct
50 Correct 78 ms 444 KB Output is correct
51 Correct 88 ms 340 KB Output is correct
52 Correct 106 ms 444 KB Output is correct
53 Correct 118 ms 448 KB Output is correct
54 Correct 81 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 76 ms 12236 KB Output is correct
4 Correct 75 ms 12580 KB Output is correct
5 Correct 79 ms 13056 KB Output is correct
6 Correct 81 ms 12284 KB Output is correct
7 Correct 80 ms 12292 KB Output is correct
8 Correct 75 ms 11276 KB Output is correct
9 Correct 77 ms 11584 KB Output is correct
10 Correct 81 ms 12620 KB Output is correct
11 Correct 92 ms 12096 KB Output is correct
12 Correct 84 ms 13004 KB Output is correct
13 Correct 99 ms 11428 KB Output is correct
14 Correct 89 ms 11896 KB Output is correct
15 Correct 96 ms 12484 KB Output is correct
16 Correct 84 ms 13120 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 312 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 340 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 76 ms 12236 KB Output is correct
30 Correct 75 ms 12580 KB Output is correct
31 Correct 79 ms 13056 KB Output is correct
32 Correct 81 ms 12284 KB Output is correct
33 Correct 80 ms 12292 KB Output is correct
34 Correct 75 ms 11276 KB Output is correct
35 Correct 77 ms 11584 KB Output is correct
36 Correct 81 ms 12620 KB Output is correct
37 Correct 92 ms 12096 KB Output is correct
38 Correct 84 ms 13004 KB Output is correct
39 Correct 99 ms 11428 KB Output is correct
40 Correct 89 ms 11896 KB Output is correct
41 Correct 96 ms 12484 KB Output is correct
42 Correct 84 ms 13120 KB Output is correct
43 Correct 466 ms 12480 KB Output is correct
44 Correct 320 ms 13100 KB Output is correct
45 Correct 361 ms 13344 KB Output is correct
46 Execution timed out 2059 ms 10260 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 312 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 340 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 412 KB Output is correct
30 Correct 48 ms 436 KB Output is correct
31 Correct 129 ms 436 KB Output is correct
32 Correct 94 ms 432 KB Output is correct
33 Correct 66 ms 424 KB Output is correct
34 Correct 92 ms 440 KB Output is correct
35 Correct 89 ms 436 KB Output is correct
36 Correct 14 ms 468 KB Output is correct
37 Correct 13 ms 452 KB Output is correct
38 Correct 15 ms 464 KB Output is correct
39 Correct 72 ms 448 KB Output is correct
40 Correct 44 ms 340 KB Output is correct
41 Correct 35 ms 432 KB Output is correct
42 Correct 35 ms 456 KB Output is correct
43 Correct 169 ms 428 KB Output is correct
44 Correct 264 ms 448 KB Output is correct
45 Correct 280 ms 376 KB Output is correct
46 Correct 196 ms 340 KB Output is correct
47 Correct 47 ms 444 KB Output is correct
48 Correct 61 ms 428 KB Output is correct
49 Correct 86 ms 368 KB Output is correct
50 Correct 78 ms 444 KB Output is correct
51 Correct 88 ms 340 KB Output is correct
52 Correct 106 ms 444 KB Output is correct
53 Correct 118 ms 448 KB Output is correct
54 Correct 81 ms 340 KB Output is correct
55 Execution timed out 2063 ms 8136 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 312 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 340 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 15 ms 412 KB Output is correct
30 Correct 48 ms 436 KB Output is correct
31 Correct 129 ms 436 KB Output is correct
32 Correct 94 ms 432 KB Output is correct
33 Correct 66 ms 424 KB Output is correct
34 Correct 92 ms 440 KB Output is correct
35 Correct 89 ms 436 KB Output is correct
36 Correct 14 ms 468 KB Output is correct
37 Correct 13 ms 452 KB Output is correct
38 Correct 15 ms 464 KB Output is correct
39 Correct 72 ms 448 KB Output is correct
40 Correct 44 ms 340 KB Output is correct
41 Correct 35 ms 432 KB Output is correct
42 Correct 35 ms 456 KB Output is correct
43 Correct 169 ms 428 KB Output is correct
44 Correct 264 ms 448 KB Output is correct
45 Correct 280 ms 376 KB Output is correct
46 Correct 196 ms 340 KB Output is correct
47 Correct 47 ms 444 KB Output is correct
48 Correct 61 ms 428 KB Output is correct
49 Correct 86 ms 368 KB Output is correct
50 Correct 78 ms 444 KB Output is correct
51 Correct 88 ms 340 KB Output is correct
52 Correct 106 ms 444 KB Output is correct
53 Correct 118 ms 448 KB Output is correct
54 Correct 81 ms 340 KB Output is correct
55 Correct 76 ms 12236 KB Output is correct
56 Correct 75 ms 12580 KB Output is correct
57 Correct 79 ms 13056 KB Output is correct
58 Correct 81 ms 12284 KB Output is correct
59 Correct 80 ms 12292 KB Output is correct
60 Correct 75 ms 11276 KB Output is correct
61 Correct 77 ms 11584 KB Output is correct
62 Correct 81 ms 12620 KB Output is correct
63 Correct 92 ms 12096 KB Output is correct
64 Correct 84 ms 13004 KB Output is correct
65 Correct 99 ms 11428 KB Output is correct
66 Correct 89 ms 11896 KB Output is correct
67 Correct 96 ms 12484 KB Output is correct
68 Correct 84 ms 13120 KB Output is correct
69 Correct 466 ms 12480 KB Output is correct
70 Correct 320 ms 13100 KB Output is correct
71 Correct 361 ms 13344 KB Output is correct
72 Execution timed out 2059 ms 10260 KB Time limit exceeded
73 Halted 0 ms 0 KB -