oj.uz

답안 #768173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768173 2023-06-27T16:13:04 Z jakobrs Joker (BOI20_joker) C++17
71 / 100
 2000 ms 10836 KB 
    #include <algorithm>
    #include <iostream>
    #include <vector>

#pragma GCC optimize("O3")
     
    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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 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 320 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 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 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 320 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 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 14 ms 340 KB Output is correct
30 Correct 14 ms 476 KB Output is correct
31 Correct 16 ms 464 KB Output is correct
32 Correct 17 ms 468 KB Output is correct
33 Correct 17 ms 472 KB Output is correct
34 Correct 16 ms 456 KB Output is correct
35 Correct 16 ms 468 KB Output is correct
36 Correct 16 ms 484 KB Output is correct
37 Correct 15 ms 368 KB Output is correct
38 Correct 15 ms 484 KB Output is correct
39 Correct 15 ms 484 KB Output is correct
40 Correct 17 ms 468 KB Output is correct
41 Correct 17 ms 484 KB Output is correct
42 Correct 16 ms 368 KB Output is correct
43 Correct 17 ms 472 KB Output is correct
44 Correct 17 ms 488 KB Output is correct
45 Correct 17 ms 480 KB Output is correct
46 Correct 17 ms 368 KB Output is correct
47 Correct 17 ms 460 KB Output is correct
48 Correct 17 ms 372 KB Output is correct
49 Correct 16 ms 476 KB Output is correct
50 Correct 15 ms 468 KB Output is correct
51 Correct 17 ms 468 KB Output is correct
52 Correct 16 ms 476 KB Output is correct
53 Correct 16 ms 464 KB Output is correct
54 Correct 16 ms 468 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 80 ms 10368 KB Output is correct
4 Correct 81 ms 10784 KB Output is correct
5 Correct 78 ms 10692 KB Output is correct
6 Correct 76 ms 10448 KB Output is correct
7 Correct 78 ms 10404 KB Output is correct
8 Correct 75 ms 10216 KB Output is correct
9 Correct 76 ms 10416 KB Output is correct
10 Correct 80 ms 10784 KB Output is correct
11 Correct 77 ms 10432 KB Output is correct
12 Correct 78 ms 10684 KB Output is correct
13 Correct 77 ms 10048 KB Output is correct
14 Correct 77 ms 10212 KB Output is correct
15 Correct 81 ms 10548 KB Output is correct
16 Correct 81 ms 10780 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 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 320 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 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 80 ms 10368 KB Output is correct
30 Correct 81 ms 10784 KB Output is correct
31 Correct 78 ms 10692 KB Output is correct
32 Correct 76 ms 10448 KB Output is correct
33 Correct 78 ms 10404 KB Output is correct
34 Correct 75 ms 10216 KB Output is correct
35 Correct 76 ms 10416 KB Output is correct
36 Correct 80 ms 10784 KB Output is correct
37 Correct 77 ms 10432 KB Output is correct
38 Correct 78 ms 10684 KB Output is correct
39 Correct 77 ms 10048 KB Output is correct
40 Correct 77 ms 10212 KB Output is correct
41 Correct 81 ms 10548 KB Output is correct
42 Correct 81 ms 10780 KB Output is correct
43 Correct 362 ms 10412 KB Output is correct
44 Correct 345 ms 10816 KB Output is correct
45 Correct 348 ms 10788 KB Output is correct
46 Correct 363 ms 10536 KB Output is correct
47 Correct 401 ms 10396 KB Output is correct
48 Correct 452 ms 10388 KB Output is correct
49 Correct 454 ms 10776 KB Output is correct
50 Correct 406 ms 10296 KB Output is correct
51 Correct 376 ms 10600 KB Output is correct
52 Correct 390 ms 10744 KB Output is correct
53 Correct 440 ms 10024 KB Output is correct
54 Correct 434 ms 10280 KB Output is correct
55 Correct 448 ms 10544 KB Output is correct
56 Correct 425 ms 10836 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 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 320 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 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 14 ms 340 KB Output is correct
30 Correct 14 ms 476 KB Output is correct
31 Correct 16 ms 464 KB Output is correct
32 Correct 17 ms 468 KB Output is correct
33 Correct 17 ms 472 KB Output is correct
34 Correct 16 ms 456 KB Output is correct
35 Correct 16 ms 468 KB Output is correct
36 Correct 16 ms 484 KB Output is correct
37 Correct 15 ms 368 KB Output is correct
38 Correct 15 ms 484 KB Output is correct
39 Correct 15 ms 484 KB Output is correct
40 Correct 17 ms 468 KB Output is correct
41 Correct 17 ms 484 KB Output is correct
42 Correct 16 ms 368 KB Output is correct
43 Correct 17 ms 472 KB Output is correct
44 Correct 17 ms 488 KB Output is correct
45 Correct 17 ms 480 KB Output is correct
46 Correct 17 ms 368 KB Output is correct
47 Correct 17 ms 460 KB Output is correct
48 Correct 17 ms 372 KB Output is correct
49 Correct 16 ms 476 KB Output is correct
50 Correct 15 ms 468 KB Output is correct
51 Correct 17 ms 468 KB Output is correct
52 Correct 16 ms 476 KB Output is correct
53 Correct 16 ms 464 KB Output is correct
54 Correct 16 ms 468 KB Output is correct
55 Correct 305 ms 8076 KB Output is correct
56 Correct 453 ms 8460 KB Output is correct
57 Correct 362 ms 8392 KB Output is correct
58 Correct 403 ms 8028 KB Output is correct
59 Correct 691 ms 8048 KB Output is correct
60 Correct 812 ms 8252 KB Output is correct
61 Correct 474 ms 7988 KB Output is correct
62 Correct 516 ms 8384 KB Output is correct
63 Correct 365 ms 7752 KB Output is correct
64 Correct 536 ms 8124 KB Output is correct
65 Correct 575 ms 8388 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 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 320 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 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 14 ms 340 KB Output is correct
30 Correct 14 ms 476 KB Output is correct
31 Correct 16 ms 464 KB Output is correct
32 Correct 17 ms 468 KB Output is correct
33 Correct 17 ms 472 KB Output is correct
34 Correct 16 ms 456 KB Output is correct
35 Correct 16 ms 468 KB Output is correct
36 Correct 16 ms 484 KB Output is correct
37 Correct 15 ms 368 KB Output is correct
38 Correct 15 ms 484 KB Output is correct
39 Correct 15 ms 484 KB Output is correct
40 Correct 17 ms 468 KB Output is correct
41 Correct 17 ms 484 KB Output is correct
42 Correct 16 ms 368 KB Output is correct
43 Correct 17 ms 472 KB Output is correct
44 Correct 17 ms 488 KB Output is correct
45 Correct 17 ms 480 KB Output is correct
46 Correct 17 ms 368 KB Output is correct
47 Correct 17 ms 460 KB Output is correct
48 Correct 17 ms 372 KB Output is correct
49 Correct 16 ms 476 KB Output is correct
50 Correct 15 ms 468 KB Output is correct
51 Correct 17 ms 468 KB Output is correct
52 Correct 16 ms 476 KB Output is correct
53 Correct 16 ms 464 KB Output is correct
54 Correct 16 ms 468 KB Output is correct
55 Correct 80 ms 10368 KB Output is correct
56 Correct 81 ms 10784 KB Output is correct
57 Correct 78 ms 10692 KB Output is correct
58 Correct 76 ms 10448 KB Output is correct
59 Correct 78 ms 10404 KB Output is correct
60 Correct 75 ms 10216 KB Output is correct
61 Correct 76 ms 10416 KB Output is correct
62 Correct 80 ms 10784 KB Output is correct
63 Correct 77 ms 10432 KB Output is correct
64 Correct 78 ms 10684 KB Output is correct
65 Correct 77 ms 10048 KB Output is correct
66 Correct 77 ms 10212 KB Output is correct
67 Correct 81 ms 10548 KB Output is correct
68 Correct 81 ms 10780 KB Output is correct
69 Correct 362 ms 10412 KB Output is correct
70 Correct 345 ms 10816 KB Output is correct
71 Correct 348 ms 10788 KB Output is correct
72 Correct 363 ms 10536 KB Output is correct
73 Correct 401 ms 10396 KB Output is correct
74 Correct 452 ms 10388 KB Output is correct
75 Correct 454 ms 10776 KB Output is correct
76 Correct 406 ms 10296 KB Output is correct
77 Correct 376 ms 10600 KB Output is correct
78 Correct 390 ms 10744 KB Output is correct
79 Correct 440 ms 10024 KB Output is correct
80 Correct 434 ms 10280 KB Output is correct
81 Correct 448 ms 10544 KB Output is correct
82 Correct 425 ms 10836 KB Output is correct
83 Correct 305 ms 8076 KB Output is correct
84 Correct 453 ms 8460 KB Output is correct
85 Correct 362 ms 8392 KB Output is correct
86 Correct 403 ms 8028 KB Output is correct
87 Correct 691 ms 8048 KB Output is correct
88 Correct 812 ms 8252 KB Output is correct
89 Correct 474 ms 7988 KB Output is correct
90 Correct 516 ms 8384 KB Output is correct
91 Correct 365 ms 7752 KB Output is correct
92 Correct 536 ms 8124 KB Output is correct
93 Correct 575 ms 8388 KB Output is correct
94 Execution timed out 2004 ms 10388 KB Time limit exceeded
95 Halted 0 ms 0 KB -