oj.uz

Submission #932661

# Submission time Handle Problem Language Result Execution time Memory
932661 2024-02-24T02:24:49 Z Programmer123 Fountain Parks (IOI21_parks) C++17
55 / 100
 3081 ms 85224 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 (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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17340 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17496 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 274 ms 77032 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 125 ms 41176 KB Output is correct
29 Correct 183 ms 53040 KB Output is correct
30 Correct 236 ms 64360 KB Output is correct
31 Correct 298 ms 77072 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 5 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17336 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 6 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17336 KB Output is correct
43 Correct 12 ms 17500 KB Output is correct
44 Correct 5 ms 17496 KB Output is correct
45 Correct 166 ms 47480 KB Output is correct
46 Correct 208 ms 60172 KB Output is correct
47 Correct 246 ms 59928 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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17340 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17496 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 274 ms 77032 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 125 ms 41176 KB Output is correct
29 Correct 183 ms 53040 KB Output is correct
30 Correct 236 ms 64360 KB Output is correct
31 Correct 298 ms 77072 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 5 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17336 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 6 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17336 KB Output is correct
43 Correct 12 ms 17500 KB Output is correct
44 Correct 5 ms 17496 KB Output is correct
45 Correct 166 ms 47480 KB Output is correct
46 Correct 208 ms 60172 KB Output is correct
47 Correct 246 ms 59928 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 17496 KB Output is correct
51 Correct 5 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 17500 KB Output is correct
55 Correct 285 ms 76232 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2848 ms 18028 KB Output is correct
58 Correct 13 ms 19292 KB Output is correct
59 Correct 7 ms 18008 KB Output is correct
60 Correct 130 ms 46888 KB Output is correct
61 Correct 227 ms 59640 KB Output is correct
62 Correct 228 ms 66472 KB Output is correct
63 Incorrect 3081 ms 68240 KB Solution announced impossible, but it is possible.
64 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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 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 340 ms 85196 KB Output is correct
21 Correct 304 ms 79596 KB Output is correct
22 Correct 316 ms 79624 KB Output is correct
23 Correct 266 ms 71836 KB Output is correct
24 Correct 57 ms 28552 KB Output is correct
25 Correct 56 ms 28756 KB Output is correct
26 Correct 57 ms 28752 KB Output is correct
27 Correct 335 ms 76104 KB Output is correct
28 Correct 318 ms 76012 KB Output is correct
29 Correct 347 ms 76464 KB Output is correct
30 Correct 342 ms 76288 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct
32 Correct 23 ms 22108 KB Output is correct
33 Correct 75 ms 33104 KB Output is correct
34 Correct 338 ms 85224 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 20 ms 20588 KB Output is correct
37 Correct 34 ms 23632 KB Output is correct
38 Correct 131 ms 41208 KB Output is correct
39 Correct 186 ms 50216 KB Output is correct
40 Correct 258 ms 59032 KB Output is correct
41 Correct 333 ms 67892 KB Output is correct
42 Correct 366 ms 76780 KB Output is correct
43 Correct 4 ms 17496 KB Output is correct
44 Correct 4 ms 17496 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 5 ms 17496 KB Output is correct
54 Correct 4 ms 17652 KB Output is correct
55 Correct 5 ms 17496 KB Output is correct
56 Correct 138 ms 47416 KB Output is correct
57 Correct 235 ms 59920 KB Output is correct
58 Correct 196 ms 60048 KB Output is correct
59 Correct 4 ms 17496 KB Output is correct
60 Correct 4 ms 17496 KB Output is correct
61 Correct 4 ms 17496 KB Output is correct
62 Correct 327 ms 76936 KB Output is correct
63 Correct 270 ms 76948 KB Output is correct
64 Correct 271 ms 76676 KB Output is correct
65 Correct 5 ms 17756 KB Output is correct
66 Correct 6 ms 18012 KB Output is correct
67 Correct 148 ms 47116 KB Output is correct
68 Correct 212 ms 62232 KB Output is correct
69 Correct 307 ms 76276 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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 KB Output is correct
17 Correct 327 ms 81104 KB Output is correct
18 Correct 319 ms 80960 KB Output is correct
19 Correct 322 ms 79816 KB Output is correct
20 Correct 350 ms 74728 KB Output is correct
21 Correct 295 ms 69656 KB Output is correct
22 Correct 4 ms 17496 KB Output is correct
23 Correct 49 ms 27236 KB Output is correct
24 Correct 11 ms 18776 KB Output is correct
25 Correct 24 ms 21776 KB Output is correct
26 Correct 39 ms 24656 KB Output is correct
27 Correct 175 ms 47212 KB Output is correct
28 Correct 215 ms 54864 KB Output is correct
29 Correct 300 ms 61888 KB Output is correct
30 Correct 325 ms 69340 KB Output is correct
31 Correct 378 ms 76772 KB Output is correct
32 Correct 279 ms 76020 KB Output is correct
33 Correct 273 ms 76860 KB Output is correct
34 Correct 5 ms 17756 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 138 ms 46860 KB Output is correct
37 Correct 224 ms 62140 KB Output is correct
38 Correct 320 ms 76204 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 17496 KB Output is correct
3 Correct 5 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 ms 17320 KB Output is correct
6 Correct 4 ms 17340 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 139 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 63 ms 34208 KB Output is correct
12 Correct 20 ms 22108 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 150 ms 48972 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17340 KB Output is correct
19 Correct 5 ms 17500 KB Output is correct
20 Correct 4 ms 17496 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 274 ms 77032 KB Output is correct
24 Correct 4 ms 17496 KB Output is correct
25 Correct 5 ms 17756 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 125 ms 41176 KB Output is correct
29 Correct 183 ms 53040 KB Output is correct
30 Correct 236 ms 64360 KB Output is correct
31 Correct 298 ms 77072 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 5 ms 17500 KB Output is correct
36 Correct 4 ms 17500 KB Output is correct
37 Correct 4 ms 17336 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17500 KB Output is correct
40 Correct 6 ms 17500 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17336 KB Output is correct
43 Correct 12 ms 17500 KB Output is correct
44 Correct 5 ms 17496 KB Output is correct
45 Correct 166 ms 47480 KB Output is correct
46 Correct 208 ms 60172 KB Output is correct
47 Correct 246 ms 59928 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 17496 KB Output is correct
51 Correct 5 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 17500 KB Output is correct
55 Correct 285 ms 76232 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 2848 ms 18028 KB Output is correct
58 Correct 13 ms 19292 KB Output is correct
59 Correct 7 ms 18008 KB Output is correct
60 Correct 130 ms 46888 KB Output is correct
61 Correct 227 ms 59640 KB Output is correct
62 Correct 228 ms 66472 KB Output is correct
63 Incorrect 3081 ms 68240 KB Solution announced impossible, but it is possible.
64 Halted 0 ms 0 KB -