oj.uz

답안 #932652

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

std::unordered_map<int, int> map[200001];
int N;
std::vector<std::pair<int, int>> vld[200000];
std::pair<int, int> assigned[200000];
std::set<std::pair<int, int>> taken;
time_t stop;

bool backtrack(int n) {
    if (n == N - 1) return true;
//    if (clock() > stop) return false;
    for (auto a: vld[n]) {
        if (taken.count(a)) continue;
        taken.insert(a);
        if (backtrack(n + 1)) {
            assigned[n] = a;
            return true;
        }
        taken.erase(a);
    }
    return false;
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    stop = clock() + 3 * 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;
    }
    bool shuffle = false;
    std::default_random_engine Rand(std::random_device{}());
    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;
        bfs.push(0);
        seen[0] = 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}};
            }
        };
        for (int i = 0; i < N - 1; ++i) {
            vld[i] = valid(u[i], v[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;
        }
        if (clock() > stop) break;
        shuffle = true;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17496 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 253 ms 77076 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 6 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17496 KB Output is correct
28 Correct 75 ms 41132 KB Output is correct
29 Correct 122 ms 52872 KB Output is correct
30 Correct 152 ms 64152 KB Output is correct
31 Correct 235 ms 77224 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17500 KB Output is correct
34 Correct 4 ms 17500 KB Output is correct
35 Correct 4 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 5 ms 17348 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17752 KB Output is correct
45 Correct 98 ms 47320 KB Output is correct
46 Correct 143 ms 60056 KB Output is correct
47 Correct 137 ms 60140 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17496 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 253 ms 77076 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 6 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17496 KB Output is correct
28 Correct 75 ms 41132 KB Output is correct
29 Correct 122 ms 52872 KB Output is correct
30 Correct 152 ms 64152 KB Output is correct
31 Correct 235 ms 77224 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17500 KB Output is correct
34 Correct 4 ms 17500 KB Output is correct
35 Correct 4 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 5 ms 17348 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17752 KB Output is correct
45 Correct 98 ms 47320 KB Output is correct
46 Correct 143 ms 60056 KB Output is correct
47 Correct 137 ms 60140 KB Output is correct
48 Correct 4 ms 17496 KB Output is correct
49 Correct 4 ms 17496 KB Output is correct
50 Correct 5 ms 17496 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 4 ms 17500 KB Output is correct
53 Correct 4 ms 17496 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 221 ms 76288 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 1165 ms 18036 KB Output is correct
58 Correct 14 ms 19292 KB Output is correct
59 Correct 8 ms 18012 KB Output is correct
60 Correct 93 ms 47684 KB Output is correct
61 Correct 173 ms 60784 KB Output is correct
62 Correct 163 ms 67896 KB Output is correct
63 Execution timed out 3572 ms 69764 KB Time limit exceeded
64 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 268 ms 85100 KB Output is correct
21 Correct 241 ms 79844 KB Output is correct
22 Correct 250 ms 79848 KB Output is correct
23 Correct 203 ms 71836 KB Output is correct
24 Correct 57 ms 28796 KB Output is correct
25 Correct 55 ms 28576 KB Output is correct
26 Correct 63 ms 28800 KB Output is correct
27 Correct 238 ms 76048 KB Output is correct
28 Correct 251 ms 76068 KB Output is correct
29 Correct 254 ms 76724 KB Output is correct
30 Correct 283 ms 76412 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct
32 Correct 20 ms 22124 KB Output is correct
33 Correct 65 ms 33104 KB Output is correct
34 Correct 282 ms 85080 KB Output is correct
35 Correct 7 ms 18012 KB Output is correct
36 Correct 18 ms 20572 KB Output is correct
37 Correct 33 ms 23644 KB Output is correct
38 Correct 102 ms 41208 KB Output is correct
39 Correct 155 ms 50120 KB Output is correct
40 Correct 224 ms 59200 KB Output is correct
41 Correct 244 ms 68212 KB Output is correct
42 Correct 279 ms 76700 KB Output is correct
43 Correct 4 ms 17500 KB Output is correct
44 Correct 5 ms 17500 KB Output is correct
45 Correct 4 ms 17496 KB Output is correct
46 Correct 4 ms 17500 KB Output is correct
47 Correct 4 ms 17500 KB Output is correct
48 Correct 5 ms 17488 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 5 ms 17496 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 4 ms 17336 KB Output is correct
53 Correct 4 ms 17500 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 5 ms 17500 KB Output is correct
56 Correct 93 ms 47380 KB Output is correct
57 Correct 136 ms 60060 KB Output is correct
58 Correct 137 ms 60056 KB Output is correct
59 Correct 4 ms 17496 KB Output is correct
60 Correct 4 ms 17500 KB Output is correct
61 Correct 4 ms 17500 KB Output is correct
62 Correct 200 ms 76944 KB Output is correct
63 Correct 187 ms 76944 KB Output is correct
64 Correct 190 ms 76972 KB Output is correct
65 Correct 5 ms 17752 KB Output is correct
66 Correct 6 ms 18012 KB Output is correct
67 Correct 104 ms 46996 KB Output is correct
68 Correct 155 ms 62108 KB Output is correct
69 Correct 210 ms 76192 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct
17 Correct 272 ms 81100 KB Output is correct
18 Correct 247 ms 80960 KB Output is correct
19 Correct 235 ms 79852 KB Output is correct
20 Correct 251 ms 74712 KB Output is correct
21 Correct 224 ms 69660 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 38 ms 27116 KB Output is correct
24 Correct 12 ms 18776 KB Output is correct
25 Correct 24 ms 21844 KB Output is correct
26 Correct 41 ms 24844 KB Output is correct
27 Correct 138 ms 47348 KB Output is correct
28 Correct 169 ms 55012 KB Output is correct
29 Correct 201 ms 62076 KB Output is correct
30 Correct 291 ms 69284 KB Output is correct
31 Correct 275 ms 76548 KB Output is correct
32 Correct 191 ms 75804 KB Output is correct
33 Correct 194 ms 76948 KB Output is correct
34 Correct 5 ms 17752 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 98 ms 46856 KB Output is correct
37 Correct 157 ms 62256 KB Output is correct
38 Correct 201 ms 76156 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 5 ms 17500 KB Output is correct
5 Correct 4 ms 17496 KB Output is correct
6 Correct 5 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 94 ms 49076 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 46 ms 34236 KB Output is correct
12 Correct 15 ms 22360 KB Output is correct
13 Correct 16 ms 20584 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17492 KB Output is correct
16 Correct 91 ms 49036 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17496 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 253 ms 77076 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 6 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17496 KB Output is correct
28 Correct 75 ms 41132 KB Output is correct
29 Correct 122 ms 52872 KB Output is correct
30 Correct 152 ms 64152 KB Output is correct
31 Correct 235 ms 77224 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17500 KB Output is correct
34 Correct 4 ms 17500 KB Output is correct
35 Correct 4 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 5 ms 17348 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17752 KB Output is correct
45 Correct 98 ms 47320 KB Output is correct
46 Correct 143 ms 60056 KB Output is correct
47 Correct 137 ms 60140 KB Output is correct
48 Correct 4 ms 17496 KB Output is correct
49 Correct 4 ms 17496 KB Output is correct
50 Correct 5 ms 17496 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 4 ms 17500 KB Output is correct
53 Correct 4 ms 17496 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 221 ms 76288 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 1165 ms 18036 KB Output is correct
58 Correct 14 ms 19292 KB Output is correct
59 Correct 8 ms 18012 KB Output is correct
60 Correct 93 ms 47684 KB Output is correct
61 Correct 173 ms 60784 KB Output is correct
62 Correct 163 ms 67896 KB Output is correct
63 Execution timed out 3572 ms 69764 KB Time limit exceeded
64 Halted 0 ms 0 KB -