oj.uz

Submission #1072025

# Submission time Handle Problem Language Result Execution time Memory
1072025 2024-08-23T13:30:47 Z shmax Fountain Parks (IOI21_parks) C++17
55 / 100
 3366 ms 96696 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;
using i32 = int;
#define int long long
#define len(x) (int)(x.size())
template<typename T>
using vec = vector<T>;

struct DSU {
public:
    DSU() : _n(0) {}

    explicit DSU(int n) : _n(n), parent_or_size(n, -1) {}

    int unite(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool one(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
                std::remove_if(result.begin(), result.end(),
                               [&](const std::vector<int> &v) { return v.empty(); }),
                result.end());
        return result;
    }

private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};


i32 construct_roads(std::vector<i32> _x, std::vector<i32> _y) {
    int n = len(_x);
    map<pair<int, int>, int> mp;
    for (int i = 0; i < n; i++) {
        mp[{_x[i], _y[i]}] = i;
    }
    mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
    vec<pair<int, int>> edges;
    for (int i = 0; i < n; i++) {
        vec<pair<int, int>> moves = {{-2, 0},
                                     {2,  0},
                                     {0,  -2},
                                     {0,  2}};
        for (auto [dx, dy]: moves) {
            int nx = _x[i] + dx;
            int ny = _y[i] + dy;
            if (!mp.count({nx, ny})) continue;
            edges.push_back({i, mp[{nx, ny}]});
        }
    }
    for (int times = 0; times < 10; times++) {
        DSU dsu(n);

        shuffle(edges.begin(), edges.end(), rnd);

        vec<pair<int, int>> used_edges;
        for (auto [a, b]: edges) {
            if (dsu.one(a, b)) continue;
            dsu.unite(a, b);
            used_edges.emplace_back(a, b);
        }
        if (dsu.size(0) != n) continue;
        map<pair<int, int>, int> benches;
        vec<pair<int, int>> benches_pos;
        int idx = 0;
        for (auto [a, b]: used_edges) {
            auto [x1, y1] = pair<int, int>{_x[a], _y[a]};
            auto [x2, y2] = pair<int, int>{_x[b], _y[b]};
            if (x1 == x2) {
                if (!benches.count({x1 - 1, (y1 + y2) / 2}))
                    benches[{x1 - 1, (y1 + y2) / 2}] = idx++, benches_pos.emplace_back(x1 - 1, (y1 + y2) / 2);
                if (!benches.count({x1 + 1, (y1 + y2) / 2}))
                    benches[{x1 + 1, (y1 + y2) / 2}] = idx++, benches_pos.emplace_back(x1 + 1, (y1 + y2) / 2);
            } else {
                if (!benches.count({(x1 + x2) / 2, y1 - 1}))
                    benches[{(x1 + x2) / 2, y1 - 1}] = idx++, benches_pos.emplace_back((x1 + x2) / 2, y1 - 1);
                if (!benches.count({(x1 + x2) / 2, y1 + 1}))
                    benches[{(x1 + x2) / 2, y1 + 1}] = idx++, benches_pos.emplace_back((x1 + x2) / 2, y1 + 1);
            }
        }
        vec<vec<int>> g(n - 1 + len(benches));
        int idt = 0;
        for (auto [a, b]: used_edges) {
            auto [x1, y1] = pair<int, int>{_x[a], _y[a]};
            auto [x2, y2] = pair<int, int>{_x[b], _y[b]};
            if (x1 == x2) {
                g[idt].push_back(n - 1 + benches[{x1 - 1, (y1 + y2) / 2}]);
                g[idt].push_back(n - 1 + benches[{x1 + 1, (y1 + y2) / 2}]);
            } else {
                g[idt].push_back(n - 1 + benches[{(x1 + x2) / 2, y1 - 1}]);
                g[idt].push_back(n - 1 + benches[{(x1 + x2) / 2, y1 + 1}]);
            }
            idt++;
        }

//        matching
//        shuffle
        for (int i = 0; i < n - 1; i++) {
            shuffle(g[i].begin(), g[i].end(), rnd);
        }
        vec<int> match(n - 1 + len(benches), -1);
        vec<bool> used(n - 1 + len(benches), false);
        function<bool(int)> dfs = [&](int v) -> bool {
            if (used[v]) return false;
            used[v] = true;
            for (auto u: g[v]) {
                if (match[u] == -1 || dfs(match[u])) {
                    match[u] = v;
                    match[v] = u;
                    return true;
                }
            }
            return false;
        };

        bool flag = true;
        do {
            flag = false;
            fill(used.begin(), used.end(), false);
            for (int i = 0; i < n - 1; i++) {
                if (match[i] == -1) {
                    if (dfs(i)) {
                        flag = true;
                    }
                }
            }
        } while (flag);

        int cnt = 0;
        for (int i = 0; i < n - 1; i++) {
            if (match[i] != -1) cnt++;
        }

        if (cnt == n - 1) {
            vec<i32> x_benches, y_benches;
            vec<i32> u, v;
            for (int i = 0; i < n - 1; i++) {
                x_benches.push_back(benches_pos[match[i] - n + 1].first);
                y_benches.push_back(benches_pos[match[i] - n + 1].second);
                u.push_back(used_edges[i].first);
                v.push_back(used_edges[i].second);
            }
            build(u, v, x_benches, y_benches);
            return 1;
        }


    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 699 ms 79332 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 5 ms 956 KB Output is correct
27 Correct 7 ms 1080 KB Output is correct
28 Correct 224 ms 32104 KB Output is correct
29 Correct 367 ms 49336 KB Output is correct
30 Correct 532 ms 64444 KB Output is correct
31 Correct 697 ms 81180 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 289 ms 40544 KB Output is correct
46 Correct 475 ms 60836 KB Output is correct
47 Correct 485 ms 62388 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 699 ms 79332 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 5 ms 956 KB Output is correct
27 Correct 7 ms 1080 KB Output is correct
28 Correct 224 ms 32104 KB Output is correct
29 Correct 367 ms 49336 KB Output is correct
30 Correct 532 ms 64444 KB Output is correct
31 Correct 697 ms 81180 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 289 ms 40544 KB Output is correct
46 Correct 475 ms 60836 KB Output is correct
47 Correct 485 ms 62388 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Incorrect 3366 ms 70104 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 654 ms 80696 KB Output is correct
21 Correct 659 ms 75964 KB Output is correct
22 Correct 661 ms 76220 KB Output is correct
23 Correct 572 ms 82864 KB Output is correct
24 Correct 220 ms 17492 KB Output is correct
25 Correct 522 ms 31328 KB Output is correct
26 Correct 506 ms 31120 KB Output is correct
27 Correct 758 ms 94756 KB Output is correct
28 Correct 838 ms 95876 KB Output is correct
29 Correct 860 ms 95928 KB Output is correct
30 Correct 831 ms 95416 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 37 ms 5740 KB Output is correct
33 Correct 100 ms 8864 KB Output is correct
34 Correct 723 ms 75832 KB Output is correct
35 Correct 16 ms 2012 KB Output is correct
36 Correct 110 ms 8136 KB Output is correct
37 Correct 275 ms 15784 KB Output is correct
38 Correct 261 ms 31172 KB Output is correct
39 Correct 400 ms 41516 KB Output is correct
40 Correct 506 ms 54628 KB Output is correct
41 Correct 682 ms 65624 KB Output is correct
42 Correct 869 ms 77352 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 5 ms 860 KB Output is correct
56 Correct 332 ms 42428 KB Output is correct
57 Correct 606 ms 63456 KB Output is correct
58 Correct 594 ms 60448 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 774 ms 94356 KB Output is correct
63 Correct 726 ms 94752 KB Output is correct
64 Correct 788 ms 94132 KB Output is correct
65 Correct 8 ms 1028 KB Output is correct
66 Correct 12 ms 1636 KB Output is correct
67 Correct 336 ms 39612 KB Output is correct
68 Correct 574 ms 61268 KB Output is correct
69 Correct 891 ms 79744 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct
17 Correct 830 ms 96696 KB Output is correct
18 Correct 936 ms 95808 KB Output is correct
19 Correct 819 ms 78592 KB Output is correct
20 Correct 909 ms 79132 KB Output is correct
21 Correct 757 ms 77692 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 93 ms 12480 KB Output is correct
24 Correct 48 ms 3728 KB Output is correct
25 Correct 196 ms 13616 KB Output is correct
26 Correct 332 ms 19648 KB Output is correct
27 Correct 344 ms 39244 KB Output is correct
28 Correct 451 ms 49328 KB Output is correct
29 Correct 613 ms 63664 KB Output is correct
30 Correct 682 ms 69920 KB Output is correct
31 Correct 823 ms 79972 KB Output is correct
32 Correct 831 ms 83772 KB Output is correct
33 Correct 732 ms 94388 KB Output is correct
34 Correct 8 ms 1248 KB Output is correct
35 Correct 15 ms 1924 KB Output is correct
36 Correct 308 ms 40112 KB Output is correct
37 Correct 552 ms 62280 KB Output is correct
38 Correct 815 ms 80052 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 272 ms 46964 KB Output is correct
10 Correct 22 ms 5084 KB Output is correct
11 Correct 120 ms 25352 KB Output is correct
12 Correct 27 ms 7376 KB Output is correct
13 Correct 61 ms 7368 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 744 KB Output is correct
16 Correct 280 ms 46988 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 699 ms 79332 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 5 ms 956 KB Output is correct
27 Correct 7 ms 1080 KB Output is correct
28 Correct 224 ms 32104 KB Output is correct
29 Correct 367 ms 49336 KB Output is correct
30 Correct 532 ms 64444 KB Output is correct
31 Correct 697 ms 81180 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 289 ms 40544 KB Output is correct
46 Correct 475 ms 60836 KB Output is correct
47 Correct 485 ms 62388 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Incorrect 3366 ms 70104 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -