oj.uz

Submission #932655

# Submission time Handle Problem Language Result Execution time Memory
932655 2024-02-24T02:05:49 Z Programmer123 Fountain Parks (IOI21_parks) C++17
55 / 100
 3084 ms 85428 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 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 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 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 4 ms 17500 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 273 ms 76980 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 109 ms 40980 KB Output is correct
29 Correct 163 ms 53032 KB Output is correct
30 Correct 236 ms 64232 KB Output is correct
31 Correct 268 ms 77000 KB Output is correct
32 Correct 5 ms 17496 KB Output is correct
33 Correct 4 ms 17496 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 4 ms 17500 KB Output is correct
41 Correct 4 ms 17500 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 7 ms 17500 KB Output is correct
45 Correct 132 ms 47384 KB Output is correct
46 Correct 194 ms 60060 KB Output is correct
47 Correct 188 ms 59980 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 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 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 4 ms 17500 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 273 ms 76980 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 109 ms 40980 KB Output is correct
29 Correct 163 ms 53032 KB Output is correct
30 Correct 236 ms 64232 KB Output is correct
31 Correct 268 ms 77000 KB Output is correct
32 Correct 5 ms 17496 KB Output is correct
33 Correct 4 ms 17496 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 4 ms 17500 KB Output is correct
41 Correct 4 ms 17500 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 7 ms 17500 KB Output is correct
45 Correct 132 ms 47384 KB Output is correct
46 Correct 194 ms 60060 KB Output is correct
47 Correct 188 ms 59980 KB Output is correct
48 Correct 4 ms 17256 KB Output is correct
49 Correct 5 ms 17500 KB Output is correct
50 Correct 5 ms 17500 KB Output is correct
51 Correct 5 ms 17488 KB Output is correct
52 Correct 4 ms 17500 KB Output is correct
53 Correct 4 ms 17488 KB Output is correct
54 Correct 4 ms 17496 KB Output is correct
55 Correct 278 ms 76248 KB Output is correct
56 Correct 4 ms 17496 KB Output is correct
57 Correct 2825 ms 18040 KB Output is correct
58 Correct 13 ms 19292 KB Output is correct
59 Correct 7 ms 18012 KB Output is correct
60 Correct 130 ms 46860 KB Output is correct
61 Correct 230 ms 59708 KB Output is correct
62 Correct 230 ms 66608 KB Output is correct
63 Incorrect 3084 ms 68272 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 17496 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 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 17496 KB Output is correct
20 Correct 327 ms 85300 KB Output is correct
21 Correct 294 ms 79636 KB Output is correct
22 Correct 297 ms 79760 KB Output is correct
23 Correct 251 ms 71836 KB Output is correct
24 Correct 71 ms 28756 KB Output is correct
25 Correct 58 ms 28752 KB Output is correct
26 Correct 59 ms 28804 KB Output is correct
27 Correct 338 ms 76012 KB Output is correct
28 Correct 322 ms 75908 KB Output is correct
29 Correct 331 ms 76780 KB Output is correct
30 Correct 327 ms 76380 KB Output is correct
31 Correct 4 ms 17500 KB Output is correct
32 Correct 24 ms 22108 KB Output is correct
33 Correct 48 ms 33108 KB Output is correct
34 Correct 347 ms 85428 KB Output is correct
35 Correct 7 ms 18012 KB Output is correct
36 Correct 19 ms 20716 KB Output is correct
37 Correct 32 ms 23744 KB Output is correct
38 Correct 136 ms 41360 KB Output is correct
39 Correct 185 ms 50116 KB Output is correct
40 Correct 248 ms 59112 KB Output is correct
41 Correct 301 ms 68032 KB Output is correct
42 Correct 354 ms 76776 KB Output is correct
43 Correct 4 ms 17500 KB Output is correct
44 Correct 4 ms 17500 KB Output is correct
45 Correct 5 ms 17500 KB Output is correct
46 Correct 4 ms 17500 KB Output is correct
47 Correct 5 ms 17296 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 17336 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 127 ms 47384 KB Output is correct
57 Correct 187 ms 59924 KB Output is correct
58 Correct 188 ms 59928 KB Output is correct
59 Correct 4 ms 17500 KB Output is correct
60 Correct 4 ms 17496 KB Output is correct
61 Correct 4 ms 17500 KB Output is correct
62 Correct 255 ms 76952 KB Output is correct
63 Correct 255 ms 76944 KB Output is correct
64 Correct 261 ms 76808 KB Output is correct
65 Correct 5 ms 17752 KB Output is correct
66 Correct 6 ms 18012 KB Output is correct
67 Correct 138 ms 46860 KB Output is correct
68 Correct 213 ms 62120 KB Output is correct
69 Correct 304 ms 76200 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 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 KB Output is correct
17 Correct 311 ms 81128 KB Output is correct
18 Correct 313 ms 81160 KB Output is correct
19 Correct 325 ms 80288 KB Output is correct
20 Correct 326 ms 74644 KB Output is correct
21 Correct 285 ms 69656 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 48 ms 27352 KB Output is correct
24 Correct 11 ms 18780 KB Output is correct
25 Correct 24 ms 21796 KB Output is correct
26 Correct 37 ms 24676 KB Output is correct
27 Correct 163 ms 47108 KB Output is correct
28 Correct 206 ms 54980 KB Output is correct
29 Correct 251 ms 62096 KB Output is correct
30 Correct 300 ms 69192 KB Output is correct
31 Correct 346 ms 76516 KB Output is correct
32 Correct 272 ms 76176 KB Output is correct
33 Correct 265 ms 76944 KB Output is correct
34 Correct 6 ms 17752 KB Output is correct
35 Correct 6 ms 18012 KB Output is correct
36 Correct 134 ms 46976 KB Output is correct
37 Correct 207 ms 62060 KB Output is correct
38 Correct 304 ms 76168 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 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 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17752 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 124 ms 48916 KB Output is correct
10 Correct 15 ms 20572 KB Output is correct
11 Correct 64 ms 34200 KB Output is correct
12 Correct 20 ms 22104 KB Output is correct
13 Correct 15 ms 20588 KB Output is correct
14 Correct 5 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 128 ms 48924 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 4 ms 17500 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 273 ms 76980 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 5 ms 17752 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 109 ms 40980 KB Output is correct
29 Correct 163 ms 53032 KB Output is correct
30 Correct 236 ms 64232 KB Output is correct
31 Correct 268 ms 77000 KB Output is correct
32 Correct 5 ms 17496 KB Output is correct
33 Correct 4 ms 17496 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 4 ms 17500 KB Output is correct
41 Correct 4 ms 17500 KB Output is correct
42 Correct 4 ms 17500 KB Output is correct
43 Correct 5 ms 17500 KB Output is correct
44 Correct 7 ms 17500 KB Output is correct
45 Correct 132 ms 47384 KB Output is correct
46 Correct 194 ms 60060 KB Output is correct
47 Correct 188 ms 59980 KB Output is correct
48 Correct 4 ms 17256 KB Output is correct
49 Correct 5 ms 17500 KB Output is correct
50 Correct 5 ms 17500 KB Output is correct
51 Correct 5 ms 17488 KB Output is correct
52 Correct 4 ms 17500 KB Output is correct
53 Correct 4 ms 17488 KB Output is correct
54 Correct 4 ms 17496 KB Output is correct
55 Correct 278 ms 76248 KB Output is correct
56 Correct 4 ms 17496 KB Output is correct
57 Correct 2825 ms 18040 KB Output is correct
58 Correct 13 ms 19292 KB Output is correct
59 Correct 7 ms 18012 KB Output is correct
60 Correct 130 ms 46860 KB Output is correct
61 Correct 230 ms 59708 KB Output is correct
62 Correct 230 ms 66608 KB Output is correct
63 Incorrect 3084 ms 68272 KB Solution announced impossible, but it is possible.
64 Halted 0 ms 0 KB -