oj.uz

Submission #1072024

# Submission time Handle Problem Language Result Execution time Memory
1072024 2024-08-23T13:28:42 Z shmax Fountain Parks (IOI21_parks) C++17
55 / 100
 3500 ms 116504 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;
    }

    for (int times = 0; times < 10; times++) {
        vec<pair<int, int>> edges;
        DSU dsu(n);
        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}]});
            }
        }
        mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
        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;
        map<int, 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[idx - 1] = {x1 - 1, (y1 + y2) / 2};
                if (!benches.count({x1 + 1, (y1 + y2) / 2}))
                    benches[{x1 + 1, (y1 + y2) / 2}] = idx++, benches_pos[idx - 1] = {x1 + 1, (y1 + y2) / 2};
            } else {
                if (!benches.count({(x1 + x2) / 2, y1 - 1}))
                    benches[{(x1 + x2) / 2, y1 - 1}] = idx++, benches_pos[idx - 1] = {(x1 + x2) / 2, y1 - 1};
                if (!benches.count({(x1 + x2) / 2, y1 + 1}))
                    benches[{(x1 + x2) / 2, y1 + 1}] = idx++, benches_pos[idx - 1] = {(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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 926 ms 93604 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 19 ms 1116 KB Output is correct
27 Correct 27 ms 1264 KB Output is correct
28 Correct 304 ms 37524 KB Output is correct
29 Correct 500 ms 56824 KB Output is correct
30 Correct 701 ms 75368 KB Output is correct
31 Correct 918 ms 93084 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 11 ms 744 KB Output is correct
44 Correct 16 ms 924 KB Output is correct
45 Correct 379 ms 48272 KB Output is correct
46 Correct 588 ms 71012 KB Output is correct
47 Correct 597 ms 70324 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 926 ms 93604 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 19 ms 1116 KB Output is correct
27 Correct 27 ms 1264 KB Output is correct
28 Correct 304 ms 37524 KB Output is correct
29 Correct 500 ms 56824 KB Output is correct
30 Correct 701 ms 75368 KB Output is correct
31 Correct 918 ms 93084 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 11 ms 744 KB Output is correct
44 Correct 16 ms 924 KB Output is correct
45 Correct 379 ms 48272 KB Output is correct
46 Correct 588 ms 71012 KB Output is correct
47 Correct 597 ms 70324 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 432 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 1 ms 348 KB Output is correct
55 Execution timed out 3570 ms 86104 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 846 ms 88932 KB Output is correct
21 Correct 860 ms 89020 KB Output is correct
22 Correct 900 ms 86712 KB Output is correct
23 Correct 754 ms 99748 KB Output is correct
24 Correct 1322 ms 19364 KB Output is correct
25 Correct 2797 ms 35352 KB Output is correct
26 Correct 2280 ms 34492 KB Output is correct
27 Correct 1020 ms 114764 KB Output is correct
28 Correct 1043 ms 114872 KB Output is correct
29 Correct 981 ms 115324 KB Output is correct
30 Correct 992 ms 114748 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 40 ms 6856 KB Output is correct
33 Correct 550 ms 10300 KB Output is correct
34 Correct 835 ms 88936 KB Output is correct
35 Correct 79 ms 2480 KB Output is correct
36 Correct 522 ms 9148 KB Output is correct
37 Correct 1131 ms 18164 KB Output is correct
38 Correct 287 ms 36420 KB Output is correct
39 Correct 446 ms 49080 KB Output is correct
40 Correct 556 ms 64436 KB Output is correct
41 Correct 733 ms 77236 KB Output is correct
42 Correct 939 ms 91072 KB Output is correct
43 Correct 1 ms 344 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 432 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 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 10 ms 744 KB Output is correct
55 Correct 15 ms 936 KB Output is correct
56 Correct 401 ms 47724 KB Output is correct
57 Correct 602 ms 71864 KB Output is correct
58 Correct 618 ms 71088 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 885 ms 114336 KB Output is correct
63 Correct 890 ms 114108 KB Output is correct
64 Correct 899 ms 114336 KB Output is correct
65 Correct 23 ms 1008 KB Output is correct
66 Correct 50 ms 1640 KB Output is correct
67 Correct 369 ms 47460 KB Output is correct
68 Correct 633 ms 72816 KB Output is correct
69 Correct 906 ms 95764 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct
17 Correct 879 ms 115640 KB Output is correct
18 Correct 918 ms 116504 KB Output is correct
19 Correct 824 ms 87476 KB Output is correct
20 Correct 933 ms 90928 KB Output is correct
21 Correct 837 ms 91688 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 98 ms 14764 KB Output is correct
24 Correct 183 ms 4152 KB Output is correct
25 Correct 782 ms 14868 KB Output is correct
26 Correct 1475 ms 25168 KB Output is correct
27 Correct 396 ms 46520 KB Output is correct
28 Correct 537 ms 58576 KB Output is correct
29 Correct 703 ms 72232 KB Output is correct
30 Correct 820 ms 82620 KB Output is correct
31 Correct 946 ms 92664 KB Output is correct
32 Correct 988 ms 98736 KB Output is correct
33 Correct 945 ms 116212 KB Output is correct
34 Correct 34 ms 1300 KB Output is correct
35 Correct 61 ms 2084 KB Output is correct
36 Correct 383 ms 47292 KB Output is correct
37 Correct 641 ms 74672 KB Output is correct
38 Correct 930 ms 94904 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 406 ms 57092 KB Output is correct
10 Correct 24 ms 6100 KB Output is correct
11 Correct 174 ms 30924 KB Output is correct
12 Correct 36 ms 8824 KB Output is correct
13 Correct 236 ms 8040 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 8 ms 628 KB Output is correct
16 Correct 395 ms 57620 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 926 ms 93604 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 19 ms 1116 KB Output is correct
27 Correct 27 ms 1264 KB Output is correct
28 Correct 304 ms 37524 KB Output is correct
29 Correct 500 ms 56824 KB Output is correct
30 Correct 701 ms 75368 KB Output is correct
31 Correct 918 ms 93084 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 11 ms 744 KB Output is correct
44 Correct 16 ms 924 KB Output is correct
45 Correct 379 ms 48272 KB Output is correct
46 Correct 588 ms 71012 KB Output is correct
47 Correct 597 ms 70324 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 432 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 1 ms 348 KB Output is correct
55 Execution timed out 3570 ms 86104 KB Time limit exceeded
56 Halted 0 ms 0 KB -