oj.uz

Submission #768679

# Submission time Handle Problem Language Result Execution time Memory
768679 2023-06-28T11:32:10 Z jakobrs Joker (BOI20_joker) C++17
71 / 100
 2000 ms 14028 KB 
#pragma GCC optimize("O3")

#include <algorithm>
#include <iostream>
#include <vector>

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 if (parent[l1] == r1) {
            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 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 212 KB Output is correct
13 Correct 1 ms 324 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 212 KB Output is correct
17 Correct 1 ms 212 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 212 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 212 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

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 212 KB Output is correct
13 Correct 1 ms 324 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 212 KB Output is correct
17 Correct 1 ms 212 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 212 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 212 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 12 ms 392 KB Output is correct
30 Correct 12 ms 340 KB Output is correct
31 Correct 14 ms 416 KB Output is correct
32 Correct 14 ms 468 KB Output is correct
33 Correct 14 ms 412 KB Output is correct
34 Correct 14 ms 420 KB Output is correct
35 Correct 14 ms 340 KB Output is correct
36 Correct 13 ms 388 KB Output is correct
37 Correct 13 ms 424 KB Output is correct
38 Correct 13 ms 420 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 14 ms 416 KB Output is correct
41 Correct 14 ms 392 KB Output is correct
42 Correct 13 ms 340 KB Output is correct
43 Correct 14 ms 412 KB Output is correct
44 Correct 14 ms 412 KB Output is correct
45 Correct 14 ms 424 KB Output is correct
46 Correct 14 ms 424 KB Output is correct
47 Correct 14 ms 416 KB Output is correct
48 Correct 14 ms 340 KB Output is correct
49 Correct 13 ms 412 KB Output is correct
50 Correct 16 ms 476 KB Output is correct
51 Correct 14 ms 388 KB Output is correct
52 Correct 14 ms 340 KB Output is correct
53 Correct 13 ms 416 KB Output is correct
54 Correct 13 ms 424 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 68 ms 8212 KB Output is correct
4 Correct 68 ms 9016 KB Output is correct
5 Correct 73 ms 8792 KB Output is correct
6 Correct 89 ms 8260 KB Output is correct
7 Correct 84 ms 8148 KB Output is correct
8 Correct 67 ms 7904 KB Output is correct
9 Correct 67 ms 8260 KB Output is correct
10 Correct 75 ms 9108 KB Output is correct
11 Correct 79 ms 8280 KB Output is correct
12 Correct 72 ms 8796 KB Output is correct
13 Correct 68 ms 7576 KB Output is correct
14 Correct 73 ms 7924 KB Output is correct
15 Correct 74 ms 8528 KB Output is correct
16 Correct 79 ms 9044 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 212 KB Output is correct
13 Correct 1 ms 324 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 212 KB Output is correct
17 Correct 1 ms 212 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 212 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 212 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 68 ms 8212 KB Output is correct
30 Correct 68 ms 9016 KB Output is correct
31 Correct 73 ms 8792 KB Output is correct
32 Correct 89 ms 8260 KB Output is correct
33 Correct 84 ms 8148 KB Output is correct
34 Correct 67 ms 7904 KB Output is correct
35 Correct 67 ms 8260 KB Output is correct
36 Correct 75 ms 9108 KB Output is correct
37 Correct 79 ms 8280 KB Output is correct
38 Correct 72 ms 8796 KB Output is correct
39 Correct 68 ms 7576 KB Output is correct
40 Correct 73 ms 7924 KB Output is correct
41 Correct 74 ms 8528 KB Output is correct
42 Correct 79 ms 9044 KB Output is correct
43 Correct 311 ms 8220 KB Output is correct
44 Correct 308 ms 9012 KB Output is correct
45 Correct 306 ms 8964 KB Output is correct
46 Correct 321 ms 8220 KB Output is correct
47 Correct 354 ms 8276 KB Output is correct
48 Correct 387 ms 8260 KB Output is correct
49 Correct 398 ms 9172 KB Output is correct
50 Correct 329 ms 8000 KB Output is correct
51 Correct 335 ms 8468 KB Output is correct
52 Correct 323 ms 9032 KB Output is correct
53 Correct 358 ms 7632 KB Output is correct
54 Correct 369 ms 8124 KB Output is correct
55 Correct 429 ms 8548 KB Output is correct
56 Correct 380 ms 9004 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 212 KB Output is correct
13 Correct 1 ms 324 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 212 KB Output is correct
17 Correct 1 ms 212 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 212 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 212 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 12 ms 392 KB Output is correct
30 Correct 12 ms 340 KB Output is correct
31 Correct 14 ms 416 KB Output is correct
32 Correct 14 ms 468 KB Output is correct
33 Correct 14 ms 412 KB Output is correct
34 Correct 14 ms 420 KB Output is correct
35 Correct 14 ms 340 KB Output is correct
36 Correct 13 ms 388 KB Output is correct
37 Correct 13 ms 424 KB Output is correct
38 Correct 13 ms 420 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 14 ms 416 KB Output is correct
41 Correct 14 ms 392 KB Output is correct
42 Correct 13 ms 340 KB Output is correct
43 Correct 14 ms 412 KB Output is correct
44 Correct 14 ms 412 KB Output is correct
45 Correct 14 ms 424 KB Output is correct
46 Correct 14 ms 424 KB Output is correct
47 Correct 14 ms 416 KB Output is correct
48 Correct 14 ms 340 KB Output is correct
49 Correct 13 ms 412 KB Output is correct
50 Correct 16 ms 476 KB Output is correct
51 Correct 14 ms 388 KB Output is correct
52 Correct 14 ms 340 KB Output is correct
53 Correct 13 ms 416 KB Output is correct
54 Correct 13 ms 424 KB Output is correct
55 Correct 293 ms 5840 KB Output is correct
56 Correct 579 ms 6620 KB Output is correct
57 Correct 428 ms 6492 KB Output is correct
58 Correct 398 ms 5824 KB Output is correct
59 Correct 668 ms 5856 KB Output is correct
60 Correct 850 ms 6356 KB Output is correct
61 Correct 475 ms 5952 KB Output is correct
62 Correct 606 ms 6468 KB Output is correct
63 Correct 315 ms 5444 KB Output is correct
64 Correct 548 ms 5992 KB Output is correct
65 Correct 624 ms 6564 KB Output is correct

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 212 KB Output is correct
13 Correct 1 ms 324 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 212 KB Output is correct
17 Correct 1 ms 212 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 212 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 212 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 12 ms 392 KB Output is correct
30 Correct 12 ms 340 KB Output is correct
31 Correct 14 ms 416 KB Output is correct
32 Correct 14 ms 468 KB Output is correct
33 Correct 14 ms 412 KB Output is correct
34 Correct 14 ms 420 KB Output is correct
35 Correct 14 ms 340 KB Output is correct
36 Correct 13 ms 388 KB Output is correct
37 Correct 13 ms 424 KB Output is correct
38 Correct 13 ms 420 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 14 ms 416 KB Output is correct
41 Correct 14 ms 392 KB Output is correct
42 Correct 13 ms 340 KB Output is correct
43 Correct 14 ms 412 KB Output is correct
44 Correct 14 ms 412 KB Output is correct
45 Correct 14 ms 424 KB Output is correct
46 Correct 14 ms 424 KB Output is correct
47 Correct 14 ms 416 KB Output is correct
48 Correct 14 ms 340 KB Output is correct
49 Correct 13 ms 412 KB Output is correct
50 Correct 16 ms 476 KB Output is correct
51 Correct 14 ms 388 KB Output is correct
52 Correct 14 ms 340 KB Output is correct
53 Correct 13 ms 416 KB Output is correct
54 Correct 13 ms 424 KB Output is correct
55 Correct 68 ms 8212 KB Output is correct
56 Correct 68 ms 9016 KB Output is correct
57 Correct 73 ms 8792 KB Output is correct
58 Correct 89 ms 8260 KB Output is correct
59 Correct 84 ms 8148 KB Output is correct
60 Correct 67 ms 7904 KB Output is correct
61 Correct 67 ms 8260 KB Output is correct
62 Correct 75 ms 9108 KB Output is correct
63 Correct 79 ms 8280 KB Output is correct
64 Correct 72 ms 8796 KB Output is correct
65 Correct 68 ms 7576 KB Output is correct
66 Correct 73 ms 7924 KB Output is correct
67 Correct 74 ms 8528 KB Output is correct
68 Correct 79 ms 9044 KB Output is correct
69 Correct 311 ms 8220 KB Output is correct
70 Correct 308 ms 9012 KB Output is correct
71 Correct 306 ms 8964 KB Output is correct
72 Correct 321 ms 8220 KB Output is correct
73 Correct 354 ms 8276 KB Output is correct
74 Correct 387 ms 8260 KB Output is correct
75 Correct 398 ms 9172 KB Output is correct
76 Correct 329 ms 8000 KB Output is correct
77 Correct 335 ms 8468 KB Output is correct
78 Correct 323 ms 9032 KB Output is correct
79 Correct 358 ms 7632 KB Output is correct
80 Correct 369 ms 8124 KB Output is correct
81 Correct 429 ms 8548 KB Output is correct
82 Correct 380 ms 9004 KB Output is correct
83 Correct 293 ms 5840 KB Output is correct
84 Correct 579 ms 6620 KB Output is correct
85 Correct 428 ms 6492 KB Output is correct
86 Correct 398 ms 5824 KB Output is correct
87 Correct 668 ms 5856 KB Output is correct
88 Correct 850 ms 6356 KB Output is correct
89 Correct 475 ms 5952 KB Output is correct
90 Correct 606 ms 6468 KB Output is correct
91 Correct 315 ms 5444 KB Output is correct
92 Correct 548 ms 5992 KB Output is correct
93 Correct 624 ms 6564 KB Output is correct
94 Correct 1767 ms 8260 KB Output is correct
95 Execution timed out 2072 ms 14028 KB Time limit exceeded
96 Halted 0 ms 0 KB -