oj.uz

답안 #1072031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072031 2024-08-23T13:32:56 Z shmax 분수 공원 (IOI21_parks) C++17
55 / 100
 3500 ms 82628 KB 
#include "parks.h"
#include <bits/stdc++.h>


#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")

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) return 0;
        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;
}

Compilation message

parks.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("unroll-loops")
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 728 ms 68288 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 880 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 229 ms 28064 KB Output is correct
29 Correct 379 ms 40900 KB Output is correct
30 Correct 529 ms 55224 KB Output is correct
31 Correct 703 ms 68384 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 344 KB Output is correct
37 Correct 0 ms 344 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 2 ms 604 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 302 ms 35380 KB Output is correct
46 Correct 473 ms 51908 KB Output is correct
47 Correct 461 ms 52156 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 728 ms 68288 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 880 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 229 ms 28064 KB Output is correct
29 Correct 379 ms 40900 KB Output is correct
30 Correct 529 ms 55224 KB Output is correct
31 Correct 703 ms 68384 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 344 KB Output is correct
37 Correct 0 ms 344 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 2 ms 604 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 302 ms 35380 KB Output is correct
46 Correct 473 ms 51908 KB Output is correct
47 Correct 461 ms 52156 KB Output is correct
48 Correct 0 ms 600 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 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 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Execution timed out 3603 ms 57356 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 694 ms 69028 KB Output is correct
21 Correct 679 ms 64704 KB Output is correct
22 Correct 711 ms 65220 KB Output is correct
23 Correct 556 ms 70584 KB Output is correct
24 Correct 222 ms 16724 KB Output is correct
25 Correct 365 ms 23364 KB Output is correct
26 Correct 344 ms 23488 KB Output is correct
27 Correct 752 ms 82564 KB Output is correct
28 Correct 764 ms 82372 KB Output is correct
29 Correct 765 ms 82372 KB Output is correct
30 Correct 797 ms 82420 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 36 ms 5196 KB Output is correct
33 Correct 94 ms 8604 KB Output is correct
34 Correct 665 ms 71500 KB Output is correct
35 Correct 12 ms 1500 KB Output is correct
36 Correct 69 ms 6096 KB Output is correct
37 Correct 155 ms 11972 KB Output is correct
38 Correct 240 ms 27080 KB Output is correct
39 Correct 343 ms 36548 KB Output is correct
40 Correct 526 ms 47800 KB Output is correct
41 Correct 624 ms 57272 KB Output is correct
42 Correct 768 ms 66756 KB Output is correct
43 Correct 1 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 344 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 2 ms 604 KB Output is correct
55 Correct 3 ms 600 KB Output is correct
56 Correct 287 ms 35364 KB Output is correct
57 Correct 464 ms 51908 KB Output is correct
58 Correct 512 ms 52072 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 727 ms 82500 KB Output is correct
63 Correct 701 ms 82544 KB Output is correct
64 Correct 669 ms 82184 KB Output is correct
65 Correct 4 ms 856 KB Output is correct
66 Correct 7 ms 1184 KB Output is correct
67 Correct 312 ms 34932 KB Output is correct
68 Correct 499 ms 52972 KB Output is correct
69 Correct 773 ms 69572 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct
17 Correct 689 ms 82576 KB Output is correct
18 Correct 714 ms 82500 KB Output is correct
19 Correct 736 ms 69044 KB Output is correct
20 Correct 714 ms 67764 KB Output is correct
21 Correct 706 ms 67000 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 78 ms 10948 KB Output is correct
24 Correct 24 ms 2764 KB Output is correct
25 Correct 107 ms 8932 KB Output is correct
26 Correct 204 ms 14280 KB Output is correct
27 Correct 330 ms 34496 KB Output is correct
28 Correct 440 ms 42468 KB Output is correct
29 Correct 594 ms 52204 KB Output is correct
30 Correct 788 ms 60304 KB Output is correct
31 Correct 872 ms 68488 KB Output is correct
32 Correct 893 ms 73868 KB Output is correct
33 Correct 856 ms 82628 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 11 ms 1516 KB Output is correct
36 Correct 321 ms 35380 KB Output is correct
37 Correct 631 ms 53496 KB Output is correct
38 Correct 917 ms 72680 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 283 ms 41412 KB Output is correct
10 Correct 18 ms 4444 KB Output is correct
11 Correct 122 ms 22496 KB Output is correct
12 Correct 32 ms 6420 KB Output is correct
13 Correct 38 ms 5584 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 289 ms 41372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 728 ms 68288 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 3 ms 880 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 229 ms 28064 KB Output is correct
29 Correct 379 ms 40900 KB Output is correct
30 Correct 529 ms 55224 KB Output is correct
31 Correct 703 ms 68384 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 344 KB Output is correct
37 Correct 0 ms 344 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 2 ms 604 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 302 ms 35380 KB Output is correct
46 Correct 473 ms 51908 KB Output is correct
47 Correct 461 ms 52156 KB Output is correct
48 Correct 0 ms 600 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 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 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Execution timed out 3603 ms 57356 KB Time limit exceeded
56 Halted 0 ms 0 KB -