oj.uz

Submission #932665

# Submission time Handle Problem Language Result Execution time Memory
932665 2024-02-24T02:28:43 Z Programmer123 Fountain Parks (IOI21_parks) C++17
55 / 100
 2828 ms 85324 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;
std::default_random_engine Rand(std::random_device{}());

bool shuffle = false;

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.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;
    }
    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 (shuffle && vld[i].size() == 2 && Rand() % 2) {
                std::swap(vld[i][0], vld[i][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;
            }
        }
        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;
#ifdef LOCAL
        printf("Retrying...\n");
#endif
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17492 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17348 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 272 ms 77044 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17792 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17568 KB Output is correct
28 Correct 105 ms 41004 KB Output is correct
29 Correct 161 ms 53044 KB Output is correct
30 Correct 236 ms 64152 KB Output is correct
31 Correct 284 ms 77020 KB Output is correct
32 Correct 4 ms 17496 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 5 ms 17500 KB Output is correct
37 Correct 5 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17496 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 5 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17528 KB Output is correct
45 Correct 156 ms 47388 KB Output is correct
46 Correct 190 ms 60056 KB Output is correct
47 Correct 212 ms 59964 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17492 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17348 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 272 ms 77044 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17792 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17568 KB Output is correct
28 Correct 105 ms 41004 KB Output is correct
29 Correct 161 ms 53044 KB Output is correct
30 Correct 236 ms 64152 KB Output is correct
31 Correct 284 ms 77020 KB Output is correct
32 Correct 4 ms 17496 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 5 ms 17500 KB Output is correct
37 Correct 5 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17496 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 5 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17528 KB Output is correct
45 Correct 156 ms 47388 KB Output is correct
46 Correct 190 ms 60056 KB Output is correct
47 Correct 212 ms 59964 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 5 ms 17500 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 5 ms 17496 KB Output is correct
53 Correct 4 ms 17500 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 284 ms 76328 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2828 ms 18032 KB Output is correct
58 Incorrect 14 ms 19288 KB Tree (a[0], b[0]) = (3, 88801) is not adjacent to edge between u[0]=644 @(2, 88156) and v[0]=5513 @(2, 88154)
59 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct
17 Correct 4 ms 17496 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 4 ms 17496 KB Output is correct
20 Correct 327 ms 85324 KB Output is correct
21 Correct 301 ms 79820 KB Output is correct
22 Correct 327 ms 79740 KB Output is correct
23 Correct 268 ms 71816 KB Output is correct
24 Correct 60 ms 28668 KB Output is correct
25 Correct 60 ms 28752 KB Output is correct
26 Correct 58 ms 28764 KB Output is correct
27 Correct 304 ms 76012 KB Output is correct
28 Correct 333 ms 75952 KB Output is correct
29 Correct 354 ms 76704 KB Output is correct
30 Correct 371 ms 76648 KB Output is correct
31 Correct 4 ms 17496 KB Output is correct
32 Correct 24 ms 22108 KB Output is correct
33 Correct 48 ms 33108 KB Output is correct
34 Correct 320 ms 85148 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 19 ms 20572 KB Output is correct
37 Correct 33 ms 23656 KB Output is correct
38 Correct 136 ms 41428 KB Output is correct
39 Correct 188 ms 50120 KB Output is correct
40 Correct 262 ms 59148 KB Output is correct
41 Correct 319 ms 67988 KB Output is correct
42 Correct 373 ms 76708 KB Output is correct
43 Correct 4 ms 17500 KB Output is correct
44 Correct 4 ms 17752 KB Output is correct
45 Correct 4 ms 17500 KB Output is correct
46 Correct 4 ms 17344 KB Output is correct
47 Correct 4 ms 17332 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17336 KB Output is correct
50 Correct 4 ms 17336 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 5 ms 17500 KB Output is correct
53 Correct 5 ms 17500 KB Output is correct
54 Correct 5 ms 17756 KB Output is correct
55 Correct 6 ms 17752 KB Output is correct
56 Correct 139 ms 47280 KB Output is correct
57 Correct 187 ms 60124 KB Output is correct
58 Correct 197 ms 60056 KB Output is correct
59 Correct 4 ms 17500 KB Output is correct
60 Correct 4 ms 17484 KB Output is correct
61 Correct 4 ms 17500 KB Output is correct
62 Correct 269 ms 76944 KB Output is correct
63 Correct 268 ms 76940 KB Output is correct
64 Correct 302 ms 76728 KB Output is correct
65 Correct 5 ms 17756 KB Output is correct
66 Correct 6 ms 18024 KB Output is correct
67 Correct 139 ms 47140 KB Output is correct
68 Correct 207 ms 62120 KB Output is correct
69 Correct 296 ms 76196 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct
17 Correct 318 ms 81032 KB Output is correct
18 Correct 311 ms 81052 KB Output is correct
19 Correct 327 ms 79848 KB Output is correct
20 Correct 333 ms 74804 KB Output is correct
21 Correct 301 ms 69644 KB Output is correct
22 Correct 4 ms 17496 KB Output is correct
23 Correct 47 ms 27256 KB Output is correct
24 Correct 10 ms 18780 KB Output is correct
25 Correct 24 ms 21848 KB Output is correct
26 Correct 44 ms 24848 KB Output is correct
27 Correct 170 ms 47332 KB Output is correct
28 Correct 211 ms 54840 KB Output is correct
29 Correct 272 ms 61928 KB Output is correct
30 Correct 310 ms 69292 KB Output is correct
31 Correct 361 ms 76516 KB Output is correct
32 Correct 298 ms 76020 KB Output is correct
33 Correct 266 ms 76944 KB Output is correct
34 Correct 5 ms 17756 KB Output is correct
35 Correct 8 ms 18012 KB Output is correct
36 Correct 143 ms 47404 KB Output is correct
37 Correct 210 ms 62120 KB Output is correct
38 Correct 282 ms 76456 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 5 ms 17652 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 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 17500 KB Output is correct
9 Correct 127 ms 49080 KB Output is correct
10 Correct 15 ms 20668 KB Output is correct
11 Correct 63 ms 34232 KB Output is correct
12 Correct 20 ms 22108 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17496 KB Output is correct
16 Correct 134 ms 48996 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17492 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17348 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 272 ms 77044 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17792 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17568 KB Output is correct
28 Correct 105 ms 41004 KB Output is correct
29 Correct 161 ms 53044 KB Output is correct
30 Correct 236 ms 64152 KB Output is correct
31 Correct 284 ms 77020 KB Output is correct
32 Correct 4 ms 17496 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 5 ms 17500 KB Output is correct
37 Correct 5 ms 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17496 KB Output is correct
40 Correct 4 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 5 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 5 ms 17528 KB Output is correct
45 Correct 156 ms 47388 KB Output is correct
46 Correct 190 ms 60056 KB Output is correct
47 Correct 212 ms 59964 KB Output is correct
48 Correct 4 ms 17500 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 5 ms 17500 KB Output is correct
51 Correct 4 ms 17500 KB Output is correct
52 Correct 5 ms 17496 KB Output is correct
53 Correct 4 ms 17500 KB Output is correct
54 Correct 4 ms 17500 KB Output is correct
55 Correct 284 ms 76328 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2828 ms 18032 KB Output is correct
58 Incorrect 14 ms 19288 KB Tree (a[0], b[0]) = (3, 88801) is not adjacent to edge between u[0]=644 @(2, 88156) and v[0]=5513 @(2, 88154)
59 Halted 0 ms 0 KB -