oj.uz

답안 #932653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932653 2024-02-24T02:00:31 Z Programmer123 분수 공원 (IOI21_parks) C++17
55 / 100
 3088 ms 85148 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 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17752 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 311 ms 77204 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17844 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17524 KB Output is correct
28 Correct 105 ms 41180 KB Output is correct
29 Correct 159 ms 52920 KB Output is correct
30 Correct 212 ms 64448 KB Output is correct
31 Correct 302 ms 77200 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 4 ms 17496 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 17496 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 17496 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17500 KB Output is correct
45 Correct 131 ms 47476 KB Output is correct
46 Correct 201 ms 59932 KB Output is correct
47 Correct 191 ms 60060 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17752 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 311 ms 77204 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17844 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17524 KB Output is correct
28 Correct 105 ms 41180 KB Output is correct
29 Correct 159 ms 52920 KB Output is correct
30 Correct 212 ms 64448 KB Output is correct
31 Correct 302 ms 77200 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 4 ms 17496 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 17496 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 17496 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17500 KB Output is correct
45 Correct 131 ms 47476 KB Output is correct
46 Correct 201 ms 59932 KB Output is correct
47 Correct 191 ms 60060 KB Output is correct
48 Correct 4 ms 17496 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 4 ms 17500 KB Output is correct
51 Correct 5 ms 17500 KB Output is correct
52 Correct 5 ms 17500 KB Output is correct
53 Correct 5 ms 17496 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 280 ms 76236 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2861 ms 18040 KB Output is correct
58 Correct 12 ms 19288 KB Output is correct
59 Correct 7 ms 18008 KB Output is correct
60 Correct 130 ms 46948 KB Output is correct
61 Correct 265 ms 59704 KB Output is correct
62 Correct 237 ms 66252 KB Output is correct
63 Incorrect 3088 ms 68252 KB Solution announced impossible, but it is possible.
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 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct
17 Correct 6 ms 17496 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 4 ms 17316 KB Output is correct
20 Correct 341 ms 85148 KB Output is correct
21 Correct 338 ms 79752 KB Output is correct
22 Correct 323 ms 79708 KB Output is correct
23 Correct 290 ms 71804 KB Output is correct
24 Correct 57 ms 28756 KB Output is correct
25 Correct 59 ms 28588 KB Output is correct
26 Correct 58 ms 28756 KB Output is correct
27 Correct 312 ms 76156 KB Output is correct
28 Correct 317 ms 76012 KB Output is correct
29 Correct 340 ms 76352 KB Output is correct
30 Correct 319 ms 76452 KB Output is correct
31 Correct 5 ms 17500 KB Output is correct
32 Correct 23 ms 22108 KB Output is correct
33 Correct 63 ms 33052 KB Output is correct
34 Correct 339 ms 85128 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 19 ms 20572 KB Output is correct
37 Correct 34 ms 23644 KB Output is correct
38 Correct 134 ms 41220 KB Output is correct
39 Correct 203 ms 50080 KB Output is correct
40 Correct 255 ms 59108 KB Output is correct
41 Correct 306 ms 67892 KB Output is correct
42 Correct 366 ms 77168 KB Output is correct
43 Correct 4 ms 17496 KB Output is correct
44 Correct 4 ms 17500 KB Output is correct
45 Correct 4 ms 17500 KB Output is correct
46 Correct 4 ms 17496 KB Output is correct
47 Correct 4 ms 17500 KB Output is correct
48 Correct 4 ms 17488 KB Output is correct
49 Correct 4 ms 17356 KB Output is correct
50 Correct 4 ms 17500 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 17500 KB Output is correct
54 Correct 5 ms 17500 KB Output is correct
55 Correct 5 ms 17500 KB Output is correct
56 Correct 129 ms 47336 KB Output is correct
57 Correct 194 ms 60312 KB Output is correct
58 Correct 189 ms 60060 KB Output is correct
59 Correct 4 ms 17484 KB Output is correct
60 Correct 4 ms 17500 KB Output is correct
61 Correct 4 ms 17332 KB Output is correct
62 Correct 262 ms 76908 KB Output is correct
63 Correct 266 ms 76872 KB Output is correct
64 Correct 258 ms 76692 KB Output is correct
65 Correct 7 ms 17756 KB Output is correct
66 Correct 6 ms 18012 KB Output is correct
67 Correct 139 ms 46984 KB Output is correct
68 Correct 231 ms 62124 KB Output is correct
69 Correct 289 ms 76196 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct
17 Correct 352 ms 81068 KB Output is correct
18 Correct 335 ms 81136 KB Output is correct
19 Correct 315 ms 79844 KB Output is correct
20 Correct 320 ms 74800 KB Output is correct
21 Correct 288 ms 69532 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 48 ms 27156 KB Output is correct
24 Correct 10 ms 18776 KB Output is correct
25 Correct 25 ms 21852 KB Output is correct
26 Correct 38 ms 24848 KB Output is correct
27 Correct 164 ms 47304 KB Output is correct
28 Correct 229 ms 55052 KB Output is correct
29 Correct 257 ms 61864 KB Output is correct
30 Correct 299 ms 69356 KB Output is correct
31 Correct 362 ms 76724 KB Output is correct
32 Correct 279 ms 76020 KB Output is correct
33 Correct 266 ms 76992 KB Output is correct
34 Correct 7 ms 18008 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 137 ms 46896 KB Output is correct
37 Correct 218 ms 62124 KB Output is correct
38 Correct 278 ms 76240 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17492 KB Output is correct
6 Correct 5 ms 17496 KB Output is correct
7 Correct 5 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 127 ms 49020 KB Output is correct
10 Correct 16 ms 20568 KB Output is correct
11 Correct 66 ms 34132 KB Output is correct
12 Correct 20 ms 22128 KB Output is correct
13 Correct 16 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48984 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17496 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17752 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 311 ms 77204 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17844 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17524 KB Output is correct
28 Correct 105 ms 41180 KB Output is correct
29 Correct 159 ms 52920 KB Output is correct
30 Correct 212 ms 64448 KB Output is correct
31 Correct 302 ms 77200 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 4 ms 17496 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 17496 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 17496 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17500 KB Output is correct
45 Correct 131 ms 47476 KB Output is correct
46 Correct 201 ms 59932 KB Output is correct
47 Correct 191 ms 60060 KB Output is correct
48 Correct 4 ms 17496 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 4 ms 17500 KB Output is correct
51 Correct 5 ms 17500 KB Output is correct
52 Correct 5 ms 17500 KB Output is correct
53 Correct 5 ms 17496 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 280 ms 76236 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2861 ms 18040 KB Output is correct
58 Correct 12 ms 19288 KB Output is correct
59 Correct 7 ms 18008 KB Output is correct
60 Correct 130 ms 46948 KB Output is correct
61 Correct 265 ms 59704 KB Output is correct
62 Correct 237 ms 66252 KB Output is correct
63 Incorrect 3088 ms 68252 KB Solution announced impossible, but it is possible.
64 Halted 0 ms 0 KB -