oj.uz

답안 #932656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932656 2024-02-24T02:07:23 Z Programmer123 분수 공원 (IOI21_parks) C++17
55 / 100
 3074 ms 85328 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;
        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}};
            }
        };
        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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 KB Output is correct
17 Correct 4 ms 17496 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 280 ms 77240 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 6 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 113 ms 40976 KB Output is correct
29 Correct 158 ms 52892 KB Output is correct
30 Correct 205 ms 64308 KB Output is correct
31 Correct 276 ms 77036 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 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 17752 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 5 ms 17500 KB Output is correct
45 Correct 128 ms 47476 KB Output is correct
46 Correct 194 ms 59932 KB Output is correct
47 Correct 187 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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 KB Output is correct
17 Correct 4 ms 17496 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 280 ms 77240 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 6 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 113 ms 40976 KB Output is correct
29 Correct 158 ms 52892 KB Output is correct
30 Correct 205 ms 64308 KB Output is correct
31 Correct 276 ms 77036 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 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 17752 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 5 ms 17500 KB Output is correct
45 Correct 128 ms 47476 KB Output is correct
46 Correct 194 ms 59932 KB Output is correct
47 Correct 187 ms 60060 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17500 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 4 ms 17340 KB Output is correct
55 Correct 282 ms 76512 KB Output is correct
56 Correct 5 ms 17496 KB Output is correct
57 Correct 2814 ms 18036 KB Output is correct
58 Correct 12 ms 19292 KB Output is correct
59 Correct 7 ms 18012 KB Output is correct
60 Correct 130 ms 46996 KB Output is correct
61 Correct 211 ms 59612 KB Output is correct
62 Correct 229 ms 66476 KB Output is correct
63 Incorrect 3074 ms 68244 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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 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 17496 KB Output is correct
20 Correct 353 ms 85328 KB Output is correct
21 Correct 296 ms 79848 KB Output is correct
22 Correct 308 ms 79640 KB Output is correct
23 Correct 271 ms 71832 KB Output is correct
24 Correct 56 ms 28756 KB Output is correct
25 Correct 56 ms 28752 KB Output is correct
26 Correct 57 ms 28784 KB Output is correct
27 Correct 325 ms 76020 KB Output is correct
28 Correct 301 ms 76008 KB Output is correct
29 Correct 312 ms 76528 KB Output is correct
30 Correct 324 ms 76344 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct
32 Correct 26 ms 22108 KB Output is correct
33 Correct 65 ms 33172 KB Output is correct
34 Correct 330 ms 85300 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 18 ms 20572 KB Output is correct
37 Correct 33 ms 23636 KB Output is correct
38 Correct 129 ms 41204 KB Output is correct
39 Correct 188 ms 50120 KB Output is correct
40 Correct 238 ms 59108 KB Output is correct
41 Correct 307 ms 68096 KB Output is correct
42 Correct 373 ms 76776 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 17500 KB Output is correct
47 Correct 4 ms 17500 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17500 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 17584 KB Output is correct
55 Correct 5 ms 17500 KB Output is correct
56 Correct 135 ms 47340 KB Output is correct
57 Correct 212 ms 60060 KB Output is correct
58 Correct 195 ms 60060 KB Output is correct
59 Correct 4 ms 17500 KB Output is correct
60 Correct 5 ms 17500 KB Output is correct
61 Correct 5 ms 17500 KB Output is correct
62 Correct 259 ms 77004 KB Output is correct
63 Correct 259 ms 76944 KB Output is correct
64 Correct 254 ms 76688 KB Output is correct
65 Correct 5 ms 17756 KB Output is correct
66 Correct 6 ms 17784 KB Output is correct
67 Correct 139 ms 47152 KB Output is correct
68 Correct 203 ms 62120 KB Output is correct
69 Correct 334 ms 76240 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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 KB Output is correct
17 Correct 325 ms 80972 KB Output is correct
18 Correct 329 ms 80952 KB Output is correct
19 Correct 312 ms 79852 KB Output is correct
20 Correct 347 ms 75000 KB Output is correct
21 Correct 297 ms 69896 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 48 ms 27236 KB Output is correct
24 Correct 11 ms 18780 KB Output is correct
25 Correct 25 ms 21860 KB Output is correct
26 Correct 38 ms 24660 KB Output is correct
27 Correct 169 ms 47264 KB Output is correct
28 Correct 211 ms 54984 KB Output is correct
29 Correct 260 ms 61844 KB Output is correct
30 Correct 300 ms 69352 KB Output is correct
31 Correct 347 ms 76664 KB Output is correct
32 Correct 281 ms 76020 KB Output is correct
33 Correct 274 ms 77020 KB Output is correct
34 Correct 5 ms 17756 KB Output is correct
35 Correct 6 ms 18012 KB Output is correct
36 Correct 132 ms 46956 KB Output is correct
37 Correct 201 ms 62068 KB Output is correct
38 Correct 269 ms 76224 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 17492 KB Output is correct
5 Correct 5 ms 17496 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 127 ms 48880 KB Output is correct
10 Correct 16 ms 20572 KB Output is correct
11 Correct 63 ms 34236 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 14 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 127 ms 48976 KB Output is correct
17 Correct 4 ms 17496 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 5 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 280 ms 77240 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 6 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 113 ms 40976 KB Output is correct
29 Correct 158 ms 52892 KB Output is correct
30 Correct 205 ms 64308 KB Output is correct
31 Correct 276 ms 77036 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 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 17752 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 5 ms 17500 KB Output is correct
45 Correct 128 ms 47476 KB Output is correct
46 Correct 194 ms 59932 KB Output is correct
47 Correct 187 ms 60060 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17500 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 4 ms 17340 KB Output is correct
55 Correct 282 ms 76512 KB Output is correct
56 Correct 5 ms 17496 KB Output is correct
57 Correct 2814 ms 18036 KB Output is correct
58 Correct 12 ms 19292 KB Output is correct
59 Correct 7 ms 18012 KB Output is correct
60 Correct 130 ms 46996 KB Output is correct
61 Correct 211 ms 59612 KB Output is correct
62 Correct 229 ms 66476 KB Output is correct
63 Incorrect 3074 ms 68244 KB Solution announced impossible, but it is possible.
64 Halted 0 ms 0 KB -