oj.uz

Submission #932650

# Submission time Handle Problem Language Result Execution time Memory
932650 2024-02-24T01:54:25 Z Programmer123 Fountain Parks (IOI21_parks) C++17
55 / 100
 1096 ms 85240 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]);
    }
    std::vector<int> u, v, a, b;
    for (int i = 0; i < N; ++i) {
        map[x[i]][y[i]] = i;
    }
    bool seen[N];
    for (int i = 0; i < N; ++i) {
        seen[i] = false;
    }
    std::queue<int> bfs;
    bfs.push(0);
    seen[0] = 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);
        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;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17492 KB Output is correct
21 Correct 4 ms 17496 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 215 ms 76988 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17732 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 84 ms 41812 KB Output is correct
29 Correct 118 ms 52848 KB Output is correct
30 Correct 156 ms 64376 KB Output is correct
31 Correct 205 ms 76972 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17340 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 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17488 KB Output is correct
40 Correct 4 ms 17244 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17496 KB Output is correct
43 Correct 5 ms 17516 KB Output is correct
44 Correct 5 ms 17500 KB Output is correct
45 Correct 95 ms 47472 KB Output is correct
46 Correct 138 ms 60056 KB Output is correct
47 Correct 137 ms 60060 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17492 KB Output is correct
21 Correct 4 ms 17496 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 215 ms 76988 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17732 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 84 ms 41812 KB Output is correct
29 Correct 118 ms 52848 KB Output is correct
30 Correct 156 ms 64376 KB Output is correct
31 Correct 205 ms 76972 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17340 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 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17488 KB Output is correct
40 Correct 4 ms 17244 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17496 KB Output is correct
43 Correct 5 ms 17516 KB Output is correct
44 Correct 5 ms 17500 KB Output is correct
45 Correct 95 ms 47472 KB Output is correct
46 Correct 138 ms 60056 KB Output is correct
47 Correct 137 ms 60060 KB Output is correct
48 Correct 6 ms 17500 KB Output is correct
49 Correct 5 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 17500 KB Output is correct
55 Correct 202 ms 76196 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 1096 ms 18028 KB Output is correct
58 Incorrect 6 ms 18012 KB Solution announced impossible, but it is possible.
59 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 6 ms 17500 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 297 ms 85188 KB Output is correct
21 Correct 227 ms 79780 KB Output is correct
22 Correct 240 ms 79628 KB Output is correct
23 Correct 224 ms 71856 KB Output is correct
24 Correct 59 ms 28756 KB Output is correct
25 Correct 57 ms 28804 KB Output is correct
26 Correct 59 ms 28752 KB Output is correct
27 Correct 255 ms 76008 KB Output is correct
28 Correct 227 ms 76008 KB Output is correct
29 Correct 246 ms 76520 KB Output is correct
30 Correct 259 ms 76524 KB Output is correct
31 Correct 4 ms 17496 KB Output is correct
32 Correct 19 ms 22108 KB Output is correct
33 Correct 68 ms 33108 KB Output is correct
34 Correct 274 ms 85240 KB Output is correct
35 Correct 7 ms 18008 KB Output is correct
36 Correct 19 ms 20568 KB Output is correct
37 Correct 34 ms 23664 KB Output is correct
38 Correct 105 ms 41128 KB Output is correct
39 Correct 150 ms 50180 KB Output is correct
40 Correct 201 ms 59276 KB Output is correct
41 Correct 264 ms 67816 KB Output is correct
42 Correct 288 ms 76724 KB Output is correct
43 Correct 4 ms 17500 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 17752 KB Output is correct
47 Correct 4 ms 17500 KB Output is correct
48 Correct 4 ms 17244 KB Output is correct
49 Correct 4 ms 17496 KB Output is correct
50 Correct 5 ms 17500 KB Output is correct
51 Correct 4 ms 17752 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 102 ms 47900 KB Output is correct
57 Correct 136 ms 60060 KB Output is correct
58 Correct 139 ms 60052 KB Output is correct
59 Correct 4 ms 17500 KB Output is correct
60 Correct 5 ms 17500 KB Output is correct
61 Correct 4 ms 17500 KB Output is correct
62 Correct 193 ms 76892 KB Output is correct
63 Correct 194 ms 76948 KB Output is correct
64 Correct 214 ms 76752 KB Output is correct
65 Correct 5 ms 17756 KB Output is correct
66 Correct 6 ms 18004 KB Output is correct
67 Correct 104 ms 46916 KB Output is correct
68 Correct 151 ms 61996 KB Output is correct
69 Correct 211 ms 76300 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct
17 Correct 293 ms 81060 KB Output is correct
18 Correct 261 ms 81164 KB Output is correct
19 Correct 254 ms 79592 KB Output is correct
20 Correct 274 ms 74644 KB Output is correct
21 Correct 228 ms 69660 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 37 ms 27304 KB Output is correct
24 Correct 11 ms 18776 KB Output is correct
25 Correct 25 ms 21852 KB Output is correct
26 Correct 43 ms 24808 KB Output is correct
27 Correct 132 ms 47180 KB Output is correct
28 Correct 160 ms 54980 KB Output is correct
29 Correct 198 ms 61956 KB Output is correct
30 Correct 236 ms 69216 KB Output is correct
31 Correct 298 ms 76516 KB Output is correct
32 Correct 203 ms 75960 KB Output is correct
33 Correct 199 ms 76944 KB Output is correct
34 Correct 6 ms 17756 KB Output is correct
35 Correct 7 ms 18012 KB Output is correct
36 Correct 99 ms 46816 KB Output is correct
37 Correct 149 ms 62204 KB Output is correct
38 Correct 215 ms 76488 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17496 KB Output is correct
2 Correct 5 ms 17496 KB Output is correct
3 Correct 4 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 5 ms 17348 KB Output is correct
7 Correct 4 ms 17496 KB Output is correct
8 Correct 4 ms 17500 KB Output is correct
9 Correct 97 ms 48976 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 47 ms 34168 KB Output is correct
12 Correct 16 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 17500 KB Output is correct
16 Correct 92 ms 49092 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17496 KB Output is correct
19 Correct 4 ms 17500 KB Output is correct
20 Correct 4 ms 17492 KB Output is correct
21 Correct 4 ms 17496 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 215 ms 76988 KB Output is correct
24 Correct 4 ms 17500 KB Output is correct
25 Correct 6 ms 17732 KB Output is correct
26 Correct 5 ms 17500 KB Output is correct
27 Correct 5 ms 17500 KB Output is correct
28 Correct 84 ms 41812 KB Output is correct
29 Correct 118 ms 52848 KB Output is correct
30 Correct 156 ms 64376 KB Output is correct
31 Correct 205 ms 76972 KB Output is correct
32 Correct 4 ms 17500 KB Output is correct
33 Correct 5 ms 17340 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 17500 KB Output is correct
38 Correct 4 ms 17500 KB Output is correct
39 Correct 4 ms 17488 KB Output is correct
40 Correct 4 ms 17244 KB Output is correct
41 Correct 5 ms 17500 KB Output is correct
42 Correct 4 ms 17496 KB Output is correct
43 Correct 5 ms 17516 KB Output is correct
44 Correct 5 ms 17500 KB Output is correct
45 Correct 95 ms 47472 KB Output is correct
46 Correct 138 ms 60056 KB Output is correct
47 Correct 137 ms 60060 KB Output is correct
48 Correct 6 ms 17500 KB Output is correct
49 Correct 5 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 17500 KB Output is correct
55 Correct 202 ms 76196 KB Output is correct
56 Correct 4 ms 17500 KB Output is correct
57 Correct 1096 ms 18028 KB Output is correct
58 Incorrect 6 ms 18012 KB Solution announced impossible, but it is possible.
59 Halted 0 ms 0 KB -