oj.uz

Submission #932654

# Submission time Handle Problem Language Result Execution time Memory
932654 2024-02-24T02:04:41 Z Programmer123 Fountain Parks (IOI21_parks) C++17
55 / 100
 3005 ms 85432 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) {
    auto 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) {
        stop = std::min(clock() + CLOCKS_PER_SEC, Stop);
        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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 4 ms 17348 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 280 ms 77036 KB Output is correct
24 Correct 5 ms 17496 KB Output is correct
25 Correct 6 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 105 ms 41056 KB Output is correct
29 Correct 171 ms 52968 KB Output is correct
30 Correct 209 ms 64408 KB Output is correct
31 Correct 289 ms 77004 KB Output is correct
32 Correct 4 ms 17496 KB Output is correct
33 Correct 6 ms 17484 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 5 ms 17328 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17484 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17912 KB Output is correct
45 Correct 131 ms 47444 KB Output is correct
46 Correct 188 ms 59948 KB Output is correct
47 Correct 202 ms 59932 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 4 ms 17348 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 280 ms 77036 KB Output is correct
24 Correct 5 ms 17496 KB Output is correct
25 Correct 6 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 105 ms 41056 KB Output is correct
29 Correct 171 ms 52968 KB Output is correct
30 Correct 209 ms 64408 KB Output is correct
31 Correct 289 ms 77004 KB Output is correct
32 Correct 4 ms 17496 KB Output is correct
33 Correct 6 ms 17484 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 5 ms 17328 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17484 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17912 KB Output is correct
45 Correct 131 ms 47444 KB Output is correct
46 Correct 188 ms 59948 KB Output is correct
47 Correct 202 ms 59932 KB Output is correct
48 Correct 5 ms 17496 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 4 ms 17496 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 5 ms 17500 KB Output is correct
55 Correct 281 ms 76252 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Incorrect 3005 ms 17944 KB Solution announced impossible, but it is possible.
58 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct
17 Correct 4 ms 17496 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 343 ms 85116 KB Output is correct
21 Correct 299 ms 79852 KB Output is correct
22 Correct 307 ms 79656 KB Output is correct
23 Correct 265 ms 71828 KB Output is correct
24 Correct 66 ms 28752 KB Output is correct
25 Correct 58 ms 28784 KB Output is correct
26 Correct 72 ms 28800 KB Output is correct
27 Correct 320 ms 76044 KB Output is correct
28 Correct 316 ms 75992 KB Output is correct
29 Correct 331 ms 76324 KB Output is correct
30 Correct 332 ms 76520 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct
32 Correct 23 ms 21988 KB Output is correct
33 Correct 60 ms 33108 KB Output is correct
34 Correct 334 ms 85432 KB Output is correct
35 Correct 9 ms 18012 KB Output is correct
36 Correct 20 ms 20572 KB Output is correct
37 Correct 34 ms 23636 KB Output is correct
38 Correct 135 ms 41372 KB Output is correct
39 Correct 199 ms 50248 KB Output is correct
40 Correct 249 ms 59256 KB Output is correct
41 Correct 308 ms 67892 KB Output is correct
42 Correct 380 ms 76656 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 17348 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 17752 KB Output is correct
51 Correct 5 ms 17500 KB Output is correct
52 Correct 4 ms 17500 KB Output is correct
53 Correct 5 ms 17500 KB Output is correct
54 Correct 5 ms 17496 KB Output is correct
55 Correct 5 ms 17500 KB Output is correct
56 Correct 137 ms 47744 KB Output is correct
57 Correct 210 ms 60056 KB Output is correct
58 Correct 196 ms 60156 KB Output is correct
59 Correct 4 ms 17500 KB Output is correct
60 Correct 4 ms 17500 KB Output is correct
61 Correct 4 ms 17500 KB Output is correct
62 Correct 279 ms 76924 KB Output is correct
63 Correct 276 ms 76952 KB Output is correct
64 Correct 275 ms 76576 KB Output is correct
65 Correct 5 ms 17756 KB Output is correct
66 Correct 6 ms 18012 KB Output is correct
67 Correct 139 ms 46892 KB Output is correct
68 Correct 209 ms 62228 KB Output is correct
69 Correct 326 ms 76436 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct
17 Correct 317 ms 81092 KB Output is correct
18 Correct 342 ms 81056 KB Output is correct
19 Correct 314 ms 79756 KB Output is correct
20 Correct 348 ms 74696 KB Output is correct
21 Correct 299 ms 69660 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 47 ms 27256 KB Output is correct
24 Correct 13 ms 18776 KB Output is correct
25 Correct 25 ms 21852 KB Output is correct
26 Correct 46 ms 24648 KB Output is correct
27 Correct 175 ms 47260 KB Output is correct
28 Correct 207 ms 54984 KB Output is correct
29 Correct 262 ms 61924 KB Output is correct
30 Correct 303 ms 69352 KB Output is correct
31 Correct 350 ms 76460 KB Output is correct
32 Correct 278 ms 76024 KB Output is correct
33 Correct 278 ms 77200 KB Output is correct
34 Correct 6 ms 17756 KB Output is correct
35 Correct 7 ms 18012 KB Output is correct
36 Correct 144 ms 46984 KB Output is correct
37 Correct 205 ms 62120 KB Output is correct
38 Correct 286 ms 76252 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 5 ms 17500 KB Output is correct
3 Correct 4 ms 17288 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 5 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 17496 KB Output is correct
9 Correct 142 ms 49076 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 66 ms 34236 KB Output is correct
12 Correct 24 ms 22104 KB Output is correct
13 Correct 15 ms 20584 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 5 ms 17608 KB Output is correct
16 Correct 132 ms 49080 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 5 ms 17500 KB Output is correct
21 Correct 4 ms 17348 KB Output is correct
22 Correct 5 ms 17500 KB Output is correct
23 Correct 280 ms 77036 KB Output is correct
24 Correct 5 ms 17496 KB Output is correct
25 Correct 6 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 6 ms 17500 KB Output is correct
28 Correct 105 ms 41056 KB Output is correct
29 Correct 171 ms 52968 KB Output is correct
30 Correct 209 ms 64408 KB Output is correct
31 Correct 289 ms 77004 KB Output is correct
32 Correct 4 ms 17496 KB Output is correct
33 Correct 6 ms 17484 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 5 ms 17328 KB Output is correct
41 Correct 4 ms 17496 KB Output is correct
42 Correct 4 ms 17484 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 6 ms 17912 KB Output is correct
45 Correct 131 ms 47444 KB Output is correct
46 Correct 188 ms 59948 KB Output is correct
47 Correct 202 ms 59932 KB Output is correct
48 Correct 5 ms 17496 KB Output is correct
49 Correct 4 ms 17500 KB Output is correct
50 Correct 4 ms 17496 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 5 ms 17500 KB Output is correct
55 Correct 281 ms 76252 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Incorrect 3005 ms 17944 KB Solution announced impossible, but it is possible.
58 Halted 0 ms 0 KB -