oj.uz

Submission #765479

# Submission time Handle Problem Language Result Execution time Memory
765479 2023-06-24T14:34:04 Z jakobrs Joker (BOI20_joker) C++17
49 / 100
 2000 ms 10332 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() {}
 
    i64 find(i64 idx) const {
        if (parent[idx] < 0)
            return idx;
        else
            return find(parent[idx]);
    }
 
    bool parity(i64 idx) {
        if (parent[idx] < 0)
            return false;
        else
            return parity(parent[idx]) ^ edge_parity[idx];
    }
 
    std::pair<i64, bool> both(i64 idx) { return {find(idx), parity(idx)}; }
 
    bool lag_fagforening(i64 l, i64 r) {
        auto [l1, lp] = both(l);
        auto [r1, rp] = both(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;
 
        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 = 450;
 
    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(edges[o].first, edges[o].second);
            w = queries[i].r;
 
            for (i64 g = start; g < queries[i].l; g++)
                dsu.lag_fagforening(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(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 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 212 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 212 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 1 ms 212 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 340 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

# 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 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 212 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 212 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 1 ms 212 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 7 ms 400 KB Output is correct
30 Correct 9 ms 444 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 444 KB Output is correct
33 Correct 9 ms 340 KB Output is correct
34 Correct 9 ms 444 KB Output is correct
35 Correct 9 ms 444 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 8 ms 448 KB Output is correct
39 Correct 8 ms 456 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 9 ms 360 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 9 ms 340 KB Output is correct
44 Correct 9 ms 444 KB Output is correct
45 Correct 9 ms 448 KB Output is correct
46 Correct 9 ms 340 KB Output is correct
47 Correct 8 ms 340 KB Output is correct
48 Correct 8 ms 444 KB Output is correct
49 Correct 8 ms 444 KB Output is correct
50 Correct 8 ms 340 KB Output is correct
51 Correct 9 ms 340 KB Output is correct
52 Correct 9 ms 340 KB Output is correct
53 Correct 9 ms 340 KB Output is correct
54 Correct 9 ms 444 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 71 ms 9872 KB Output is correct
4 Correct 71 ms 10332 KB Output is correct
5 Correct 75 ms 10204 KB Output is correct
6 Correct 75 ms 9868 KB Output is correct
7 Correct 81 ms 9880 KB Output is correct
8 Correct 74 ms 9684 KB Output is correct
9 Correct 75 ms 9924 KB Output is correct
10 Correct 77 ms 10324 KB Output is correct
11 Correct 75 ms 9808 KB Output is correct
12 Correct 74 ms 10200 KB Output is correct
13 Correct 77 ms 9536 KB Output is correct
14 Correct 79 ms 9740 KB Output is correct
15 Correct 79 ms 10028 KB Output is correct
16 Correct 80 ms 10324 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 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 212 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 212 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 1 ms 212 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 71 ms 9872 KB Output is correct
30 Correct 71 ms 10332 KB Output is correct
31 Correct 75 ms 10204 KB Output is correct
32 Correct 75 ms 9868 KB Output is correct
33 Correct 81 ms 9880 KB Output is correct
34 Correct 74 ms 9684 KB Output is correct
35 Correct 75 ms 9924 KB Output is correct
36 Correct 77 ms 10324 KB Output is correct
37 Correct 75 ms 9808 KB Output is correct
38 Correct 74 ms 10200 KB Output is correct
39 Correct 77 ms 9536 KB Output is correct
40 Correct 79 ms 9740 KB Output is correct
41 Correct 79 ms 10028 KB Output is correct
42 Correct 80 ms 10324 KB Output is correct
43 Correct 382 ms 9900 KB Output is correct
44 Correct 368 ms 10264 KB Output is correct
45 Correct 373 ms 10268 KB Output is correct
46 Correct 397 ms 9976 KB Output is correct
47 Correct 491 ms 9892 KB Output is correct
48 Correct 587 ms 9888 KB Output is correct
49 Correct 539 ms 10304 KB Output is correct
50 Correct 424 ms 9872 KB Output is correct
51 Correct 414 ms 10068 KB Output is correct
52 Correct 389 ms 10316 KB Output is correct
53 Correct 471 ms 9564 KB Output is correct
54 Correct 478 ms 9808 KB Output is correct
55 Correct 503 ms 10088 KB Output is correct
56 Correct 474 ms 10304 KB Output is correct

Subtask #5
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 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 212 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 212 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 1 ms 212 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 7 ms 400 KB Output is correct
30 Correct 9 ms 444 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 444 KB Output is correct
33 Correct 9 ms 340 KB Output is correct
34 Correct 9 ms 444 KB Output is correct
35 Correct 9 ms 444 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 8 ms 448 KB Output is correct
39 Correct 8 ms 456 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 9 ms 360 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 9 ms 340 KB Output is correct
44 Correct 9 ms 444 KB Output is correct
45 Correct 9 ms 448 KB Output is correct
46 Correct 9 ms 340 KB Output is correct
47 Correct 8 ms 340 KB Output is correct
48 Correct 8 ms 444 KB Output is correct
49 Correct 8 ms 444 KB Output is correct
50 Correct 8 ms 340 KB Output is correct
51 Correct 9 ms 340 KB Output is correct
52 Correct 9 ms 340 KB Output is correct
53 Correct 9 ms 340 KB Output is correct
54 Correct 9 ms 444 KB Output is correct
55 Correct 450 ms 7516 KB Output is correct
56 Correct 953 ms 7868 KB Output is correct
57 Correct 498 ms 7872 KB Output is correct
58 Correct 760 ms 7552 KB Output is correct
59 Correct 1912 ms 7484 KB Output is correct
60 Execution timed out 2087 ms 7772 KB Time limit exceeded
61 Halted 0 ms 0 KB -

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 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 212 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 212 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 1 ms 212 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 7 ms 400 KB Output is correct
30 Correct 9 ms 444 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 444 KB Output is correct
33 Correct 9 ms 340 KB Output is correct
34 Correct 9 ms 444 KB Output is correct
35 Correct 9 ms 444 KB Output is correct
36 Correct 8 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 8 ms 448 KB Output is correct
39 Correct 8 ms 456 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 9 ms 360 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 9 ms 340 KB Output is correct
44 Correct 9 ms 444 KB Output is correct
45 Correct 9 ms 448 KB Output is correct
46 Correct 9 ms 340 KB Output is correct
47 Correct 8 ms 340 KB Output is correct
48 Correct 8 ms 444 KB Output is correct
49 Correct 8 ms 444 KB Output is correct
50 Correct 8 ms 340 KB Output is correct
51 Correct 9 ms 340 KB Output is correct
52 Correct 9 ms 340 KB Output is correct
53 Correct 9 ms 340 KB Output is correct
54 Correct 9 ms 444 KB Output is correct
55 Correct 71 ms 9872 KB Output is correct
56 Correct 71 ms 10332 KB Output is correct
57 Correct 75 ms 10204 KB Output is correct
58 Correct 75 ms 9868 KB Output is correct
59 Correct 81 ms 9880 KB Output is correct
60 Correct 74 ms 9684 KB Output is correct
61 Correct 75 ms 9924 KB Output is correct
62 Correct 77 ms 10324 KB Output is correct
63 Correct 75 ms 9808 KB Output is correct
64 Correct 74 ms 10200 KB Output is correct
65 Correct 77 ms 9536 KB Output is correct
66 Correct 79 ms 9740 KB Output is correct
67 Correct 79 ms 10028 KB Output is correct
68 Correct 80 ms 10324 KB Output is correct
69 Correct 382 ms 9900 KB Output is correct
70 Correct 368 ms 10264 KB Output is correct
71 Correct 373 ms 10268 KB Output is correct
72 Correct 397 ms 9976 KB Output is correct
73 Correct 491 ms 9892 KB Output is correct
74 Correct 587 ms 9888 KB Output is correct
75 Correct 539 ms 10304 KB Output is correct
76 Correct 424 ms 9872 KB Output is correct
77 Correct 414 ms 10068 KB Output is correct
78 Correct 389 ms 10316 KB Output is correct
79 Correct 471 ms 9564 KB Output is correct
80 Correct 478 ms 9808 KB Output is correct
81 Correct 503 ms 10088 KB Output is correct
82 Correct 474 ms 10304 KB Output is correct
83 Correct 450 ms 7516 KB Output is correct
84 Correct 953 ms 7868 KB Output is correct
85 Correct 498 ms 7872 KB Output is correct
86 Correct 760 ms 7552 KB Output is correct
87 Correct 1912 ms 7484 KB Output is correct
88 Execution timed out 2087 ms 7772 KB Time limit exceeded
89 Halted 0 ms 0 KB -