oj.uz

답안 #932673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932673 2024-02-24T02:46:07 Z Programmer123 분수 공원 (IOI21_parks) C++17
55 / 100
 3500 ms 147864 KB 
#include <bits/stdc++.h>
#include "parks.h"

std::unordered_map<int, int> map[200001];
int N;
std::unordered_map<int, std::vector<int>> rely[200002];
std::vector<std::pair<int, int>> vld[200000];
std::pair<int, int> assigned[200000];
std::unordered_set<int> taken[200002];
time_t stop;
std::default_random_engine Rand(std::random_device{}());

bool shuffle = false;
bool Shuffle = false;

bool doomed(int x) {
    for (auto a: vld[x]) if (!taken[a.first].count(a.second)) return false;
    return true;
}

bool cantake(std::pair<int, int> a, int n) {
    for (auto x: rely[a.first][a.second]) if (x > n && doomed(x)) return false;
    return true;
}

bool backtrack(int n) {
    if (n == N - 1) return true;
    if (clock() > stop) return false;
    if (Shuffle && vld[n].size() == 2 && Rand() % 2) {
        std::swap(vld[n][0], vld[n][1]);
    }
    for (auto a: vld[n]) {
        if (taken[a.first].count(a.second)) continue;
        taken[a.first].insert(a.second);
        if (!cantake(a, n)) {
            taken[a.first].erase(a.second);
            continue;
        }
        if (backtrack(n + 1)) {
            assigned[n] = a;
            return true;
        }
        taken[a.first].erase(a.second);
    }
    return false;
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    stop = clock() + 3.4 * CLOCKS_PER_SEC;
    N = (int) x.size();
    if (N == 1) {
        build({}, {}, {}, {});
        return 1;
    }
    int maxx = x[0];
    int minx = x[0];
    int maxy = y[0];
    int miny = y[0];
    for (int i = 0; i < N; ++i) {
        maxx = std::max(maxx, x[i]);
        minx = std::min(minx, x[i]);
        maxy = std::max(maxy, y[i]);
        miny = std::min(miny, y[i]);
    }
    for (int i = 0; i < N; ++i) {
        map[x[i]][y[i]] = i;
    }
    while (true) {
        std::vector<int> u, v, a, b;
        bool seen[N];
        for (int i = 0; i < N; ++i) {
            seen[i] = false;
        }
        std::queue<int> bfs;
        int start = 0;
        if (shuffle) start = Rand() % N;
        bfs.push(start);
        seen[start] = true;
        auto add = [&](int x, int y, std::vector<int> &data) {
            if (x < 0 || x > 200000) return;
            if (map[x].count(y)) data.push_back(map[x][y]);
        };
        auto edges = [&](int x, int y) {
            std::vector<int> result;
            add(x, y + 2, result);
            add(x, y - 2, result);
            add(x + 2, y, result);
            add(x - 2, y, result);
            if (Shuffle) {
                std::shuffle(result.begin(), result.end(), Rand);
            }
            return result;
        };
        int rem = N - 1;
        while (!bfs.empty()) {
            auto next = bfs.front();
            bfs.pop();
            for (auto n: edges(x[next], y[next])) {
                if (!seen[n]) {
                    seen[n] = true;
                    bfs.push(n);
                    rem--;
                    u.push_back(next);
                    v.push_back(n);
                }
            }
        }
        if (rem)
            return 0;

        std::function<std::vector<std::pair<int, int>>(int, int)> valid = [&x, &y, minx, maxx, miny, maxy](int u,
                                                                                                           int v) -> std::vector<std::pair<int, int>> {
            if (x[u] == x[v]) {
                int _y = (y[u] + y[v]) / 2;
                if (x[u] == minx) return {{minx - 1, _y}};
                if (x[u] == maxx) return {{maxx + 1, _y}};
                return {{x[u] + 1, _y},
                        {x[u] - 1, _y}};
            } else {
                int _x = (x[u] + x[v]) / 2;
                if (y[u] == miny) return {{_x, miny - 1}};
                if (y[u] == maxy) return {{_x, maxy + 1}};
                return {{_x, y[u] + 1},
                        {_x, y[u] - 1}};
            }
        };
        if (shuffle) {
            std::vector<std::pair<int, int>> Edges;
            for (int i = 0; i < N - 1; ++i) {
                Edges.emplace_back(u[i], v[i]);
            }
            std::sort(Edges.begin(), Edges.end(), [&](std::pair<int, int> a, std::pair<int, int> b) {
                int A = a.first;
                int B = b.first;
                if (x[A] == x[B]) return y[A] < y[B];
                return x[A] < x[B];
            });
            for (int i = 0; i < N - 1; ++i) {
                u[i] = Edges[i].first;
                v[i] = Edges[i].second;
            }
        }
        for (int i = 0; i < N - 1; ++i) {
            vld[i] = valid(u[i], v[i]);
            if (Shuffle && vld[i].size() == 2 && Rand() % 2) {
                std::swap(vld[i][0], vld[i][1]);
            }
        }
        for (int i = 0; i < N - 1; ++i) {
            for (auto n: vld[i]) {
                rely[n.first][n.second].push_back(i);
            }
        }
        if (backtrack(0)) {
            for (int i = 0; i < N - 1; ++i) {
                a.push_back(assigned[i].first);
                b.push_back(assigned[i].second);
            }
            build(u, v, a, b);
            return 1;
        }
        for (auto _x: x) {
            rely[_x - 1].clear();
            rely[_x + 1].clear();
        }
        if (clock() > stop) break;
        Shuffle = shuffle;
        shuffle = true;
#ifdef LOCAL
        printf("Retrying...\n");
#endif
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct
17 Correct 10 ms 39512 KB Output is correct
18 Correct 12 ms 39512 KB Output is correct
19 Correct 11 ms 39516 KB Output is correct
20 Correct 11 ms 39516 KB Output is correct
21 Correct 10 ms 39512 KB Output is correct
22 Correct 10 ms 39516 KB Output is correct
23 Correct 288 ms 123396 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39772 KB Output is correct
27 Correct 11 ms 39772 KB Output is correct
28 Correct 110 ms 71984 KB Output is correct
29 Correct 166 ms 88692 KB Output is correct
30 Correct 222 ms 103832 KB Output is correct
31 Correct 278 ms 123472 KB Output is correct
32 Correct 11 ms 39516 KB Output is correct
33 Correct 11 ms 39516 KB Output is correct
34 Correct 10 ms 39516 KB Output is correct
35 Correct 10 ms 39512 KB Output is correct
36 Correct 10 ms 39564 KB Output is correct
37 Correct 13 ms 39360 KB Output is correct
38 Correct 10 ms 39516 KB Output is correct
39 Correct 10 ms 39512 KB Output is correct
40 Correct 10 ms 39516 KB Output is correct
41 Correct 10 ms 39512 KB Output is correct
42 Correct 10 ms 39516 KB Output is correct
43 Correct 10 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 157 ms 83492 KB Output is correct
46 Correct 238 ms 104632 KB Output is correct
47 Correct 232 ms 104632 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct
17 Correct 10 ms 39512 KB Output is correct
18 Correct 12 ms 39512 KB Output is correct
19 Correct 11 ms 39516 KB Output is correct
20 Correct 11 ms 39516 KB Output is correct
21 Correct 10 ms 39512 KB Output is correct
22 Correct 10 ms 39516 KB Output is correct
23 Correct 288 ms 123396 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39772 KB Output is correct
27 Correct 11 ms 39772 KB Output is correct
28 Correct 110 ms 71984 KB Output is correct
29 Correct 166 ms 88692 KB Output is correct
30 Correct 222 ms 103832 KB Output is correct
31 Correct 278 ms 123472 KB Output is correct
32 Correct 11 ms 39516 KB Output is correct
33 Correct 11 ms 39516 KB Output is correct
34 Correct 10 ms 39516 KB Output is correct
35 Correct 10 ms 39512 KB Output is correct
36 Correct 10 ms 39564 KB Output is correct
37 Correct 13 ms 39360 KB Output is correct
38 Correct 10 ms 39516 KB Output is correct
39 Correct 10 ms 39512 KB Output is correct
40 Correct 10 ms 39516 KB Output is correct
41 Correct 10 ms 39512 KB Output is correct
42 Correct 10 ms 39516 KB Output is correct
43 Correct 10 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 157 ms 83492 KB Output is correct
46 Correct 238 ms 104632 KB Output is correct
47 Correct 232 ms 104632 KB Output is correct
48 Correct 10 ms 39516 KB Output is correct
49 Correct 10 ms 39560 KB Output is correct
50 Correct 11 ms 39516 KB Output is correct
51 Correct 10 ms 39516 KB Output is correct
52 Correct 10 ms 39512 KB Output is correct
53 Correct 10 ms 39516 KB Output is correct
54 Correct 10 ms 39516 KB Output is correct
55 Correct 312 ms 121072 KB Output is correct
56 Correct 10 ms 39516 KB Output is correct
57 Correct 2091 ms 40292 KB Output is correct
58 Correct 21 ms 41940 KB Output is correct
59 Correct 13 ms 40028 KB Output is correct
60 Correct 150 ms 80540 KB Output is correct
61 Correct 2039 ms 100124 KB Output is correct
62 Correct 251 ms 107880 KB Output is correct
63 Execution timed out 3574 ms 112892 KB Time limit exceeded
64 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct
17 Correct 10 ms 39768 KB Output is correct
18 Correct 10 ms 39516 KB Output is correct
19 Correct 10 ms 39516 KB Output is correct
20 Correct 387 ms 147864 KB Output is correct
21 Correct 350 ms 131308 KB Output is correct
22 Correct 379 ms 131376 KB Output is correct
23 Correct 306 ms 125080 KB Output is correct
24 Correct 69 ms 50876 KB Output is correct
25 Correct 67 ms 50768 KB Output is correct
26 Correct 72 ms 50752 KB Output is correct
27 Correct 438 ms 137524 KB Output is correct
28 Correct 417 ms 137296 KB Output is correct
29 Correct 411 ms 139004 KB Output is correct
30 Correct 416 ms 139176 KB Output is correct
31 Correct 10 ms 39516 KB Output is correct
32 Correct 37 ms 46284 KB Output is correct
33 Correct 81 ms 55120 KB Output is correct
34 Correct 387 ms 147716 KB Output is correct
35 Correct 13 ms 40024 KB Output is correct
36 Correct 26 ms 42588 KB Output is correct
37 Correct 51 ms 45692 KB Output is correct
38 Correct 161 ms 74024 KB Output is correct
39 Correct 235 ms 86960 KB Output is correct
40 Correct 311 ms 100060 KB Output is correct
41 Correct 389 ms 112948 KB Output is correct
42 Correct 484 ms 125196 KB Output is correct
43 Correct 10 ms 39512 KB Output is correct
44 Correct 10 ms 39516 KB Output is correct
45 Correct 10 ms 39516 KB Output is correct
46 Correct 10 ms 39516 KB Output is correct
47 Correct 10 ms 39516 KB Output is correct
48 Correct 13 ms 39516 KB Output is correct
49 Correct 10 ms 39516 KB Output is correct
50 Correct 10 ms 39512 KB Output is correct
51 Correct 11 ms 39516 KB Output is correct
52 Correct 10 ms 39512 KB Output is correct
53 Correct 10 ms 39516 KB Output is correct
54 Correct 11 ms 39516 KB Output is correct
55 Correct 11 ms 39512 KB Output is correct
56 Correct 162 ms 83572 KB Output is correct
57 Correct 236 ms 104548 KB Output is correct
58 Correct 231 ms 104556 KB Output is correct
59 Correct 10 ms 39516 KB Output is correct
60 Correct 10 ms 39360 KB Output is correct
61 Correct 10 ms 39516 KB Output is correct
62 Correct 281 ms 123680 KB Output is correct
63 Correct 264 ms 123412 KB Output is correct
64 Correct 309 ms 123752 KB Output is correct
65 Correct 12 ms 39648 KB Output is correct
66 Correct 12 ms 40112 KB Output is correct
67 Correct 157 ms 82788 KB Output is correct
68 Correct 253 ms 103960 KB Output is correct
69 Correct 332 ms 125888 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct
17 Correct 350 ms 135288 KB Output is correct
18 Correct 446 ms 143844 KB Output is correct
19 Correct 374 ms 131540 KB Output is correct
20 Correct 421 ms 124356 KB Output is correct
21 Correct 399 ms 125148 KB Output is correct
22 Correct 10 ms 39512 KB Output is correct
23 Correct 73 ms 53844 KB Output is correct
24 Correct 17 ms 40752 KB Output is correct
25 Correct 35 ms 43868 KB Output is correct
26 Correct 53 ms 46672 KB Output is correct
27 Correct 215 ms 83684 KB Output is correct
28 Correct 243 ms 94664 KB Output is correct
29 Correct 305 ms 105172 KB Output is correct
30 Correct 392 ms 115880 KB Output is correct
31 Correct 440 ms 126368 KB Output is correct
32 Correct 308 ms 127004 KB Output is correct
33 Correct 269 ms 123484 KB Output is correct
34 Correct 11 ms 39772 KB Output is correct
35 Correct 12 ms 40028 KB Output is correct
36 Correct 154 ms 82276 KB Output is correct
37 Correct 251 ms 103920 KB Output is correct
38 Correct 318 ms 125104 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39928 KB Output is correct
2 Correct 10 ms 39512 KB Output is correct
3 Correct 10 ms 39512 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 10 ms 39516 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39516 KB Output is correct
8 Correct 10 ms 39512 KB Output is correct
9 Correct 134 ms 83052 KB Output is correct
10 Correct 22 ms 43608 KB Output is correct
11 Correct 71 ms 62652 KB Output is correct
12 Correct 29 ms 45912 KB Output is correct
13 Correct 24 ms 42808 KB Output is correct
14 Correct 12 ms 39516 KB Output is correct
15 Correct 11 ms 39700 KB Output is correct
16 Correct 133 ms 83064 KB Output is correct
17 Correct 10 ms 39512 KB Output is correct
18 Correct 12 ms 39512 KB Output is correct
19 Correct 11 ms 39516 KB Output is correct
20 Correct 11 ms 39516 KB Output is correct
21 Correct 10 ms 39512 KB Output is correct
22 Correct 10 ms 39516 KB Output is correct
23 Correct 288 ms 123396 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39772 KB Output is correct
27 Correct 11 ms 39772 KB Output is correct
28 Correct 110 ms 71984 KB Output is correct
29 Correct 166 ms 88692 KB Output is correct
30 Correct 222 ms 103832 KB Output is correct
31 Correct 278 ms 123472 KB Output is correct
32 Correct 11 ms 39516 KB Output is correct
33 Correct 11 ms 39516 KB Output is correct
34 Correct 10 ms 39516 KB Output is correct
35 Correct 10 ms 39512 KB Output is correct
36 Correct 10 ms 39564 KB Output is correct
37 Correct 13 ms 39360 KB Output is correct
38 Correct 10 ms 39516 KB Output is correct
39 Correct 10 ms 39512 KB Output is correct
40 Correct 10 ms 39516 KB Output is correct
41 Correct 10 ms 39512 KB Output is correct
42 Correct 10 ms 39516 KB Output is correct
43 Correct 10 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 157 ms 83492 KB Output is correct
46 Correct 238 ms 104632 KB Output is correct
47 Correct 232 ms 104632 KB Output is correct
48 Correct 10 ms 39516 KB Output is correct
49 Correct 10 ms 39560 KB Output is correct
50 Correct 11 ms 39516 KB Output is correct
51 Correct 10 ms 39516 KB Output is correct
52 Correct 10 ms 39512 KB Output is correct
53 Correct 10 ms 39516 KB Output is correct
54 Correct 10 ms 39516 KB Output is correct
55 Correct 312 ms 121072 KB Output is correct
56 Correct 10 ms 39516 KB Output is correct
57 Correct 2091 ms 40292 KB Output is correct
58 Correct 21 ms 41940 KB Output is correct
59 Correct 13 ms 40028 KB Output is correct
60 Correct 150 ms 80540 KB Output is correct
61 Correct 2039 ms 100124 KB Output is correct
62 Correct 251 ms 107880 KB Output is correct
63 Execution timed out 3574 ms 112892 KB Time limit exceeded
64 Halted 0 ms 0 KB -