oj.uz

답안 #932677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932677 2024-02-24T02:50:00 Z Programmer123 분수 공원 (IOI21_parks) C++17
55 / 100
 3500 ms 147980 KB 
#ifndef LOCAL
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,sse4.2")
#endif

#include <bits/stdc++.h>
#include "parks.h"

std::unordered_map<int, int> map[200001];
int N;
std::unordered_map<int, std::vector<int>> rely[200002];
std::vector<std::pair<int, int>> vld[200000];
std::pair<int, int> assigned[200000];
std::unordered_set<int> taken[200002];
time_t stop;
std::default_random_engine Rand(std::random_device{}());

bool shuffle = false;
bool Shuffle = false;

bool doomed(int x) {
    for (auto a: vld[x]) if (!taken[a.first].count(a.second)) return false;
    return true;
}

bool cantake(std::pair<int, int> a, int n) {
    for (auto x: rely[a.first][a.second]) if (x > n && doomed(x)) return false;
    return true;
}

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[a.first].count(a.second)) continue;
        taken[a.first].insert(a.second);
        if (!cantake(a, n)) {
            taken[a.first].erase(a.second);
            continue;
        }
        if (backtrack(n + 1)) {
            assigned[n] = a;
            return true;
        }
        taken[a.first].erase(a.second);
    }
    return false;
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    stop = clock() + 3.4 * 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}};
            }
        };
        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;
            }
        }
        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]);
            }
        }
        for (int i = 0; i < N - 1; ++i) {
            for (auto n: vld[i]) {
                rely[n.first][n.second].push_back(i);
            }
        }
        stop = clock() + 2 * CLOCKS_PER_SEC;
        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;
        }
        for (auto _x: x) {
            rely[_x - 1].clear();
            rely[_x + 1].clear();
        }
        Shuffle = shuffle;
        shuffle = true;

#ifdef LOCAL
        printf("Retrying...\n");
#endif
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct
17 Correct 11 ms 39516 KB Output is correct
18 Correct 10 ms 39516 KB Output is correct
19 Correct 14 ms 39516 KB Output is correct
20 Correct 11 ms 39512 KB Output is correct
21 Correct 11 ms 39516 KB Output is correct
22 Correct 11 ms 39768 KB Output is correct
23 Correct 309 ms 123616 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39636 KB Output is correct
27 Correct 13 ms 40024 KB Output is correct
28 Correct 107 ms 71976 KB Output is correct
29 Correct 175 ms 89060 KB Output is correct
30 Correct 210 ms 103868 KB Output is correct
31 Correct 319 ms 123588 KB Output is correct
32 Correct 11 ms 39512 KB Output is correct
33 Correct 11 ms 39512 KB Output is correct
34 Correct 11 ms 39516 KB Output is correct
35 Correct 11 ms 39512 KB Output is correct
36 Correct 10 ms 39512 KB Output is correct
37 Correct 10 ms 39544 KB Output is correct
38 Correct 11 ms 39516 KB Output is correct
39 Correct 11 ms 39516 KB Output is correct
40 Correct 12 ms 39512 KB Output is correct
41 Correct 10 ms 39516 KB Output is correct
42 Correct 10 ms 39556 KB Output is correct
43 Correct 11 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 162 ms 83416 KB Output is correct
46 Correct 220 ms 104552 KB Output is correct
47 Correct 246 ms 104812 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct
17 Correct 11 ms 39516 KB Output is correct
18 Correct 10 ms 39516 KB Output is correct
19 Correct 14 ms 39516 KB Output is correct
20 Correct 11 ms 39512 KB Output is correct
21 Correct 11 ms 39516 KB Output is correct
22 Correct 11 ms 39768 KB Output is correct
23 Correct 309 ms 123616 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39636 KB Output is correct
27 Correct 13 ms 40024 KB Output is correct
28 Correct 107 ms 71976 KB Output is correct
29 Correct 175 ms 89060 KB Output is correct
30 Correct 210 ms 103868 KB Output is correct
31 Correct 319 ms 123588 KB Output is correct
32 Correct 11 ms 39512 KB Output is correct
33 Correct 11 ms 39512 KB Output is correct
34 Correct 11 ms 39516 KB Output is correct
35 Correct 11 ms 39512 KB Output is correct
36 Correct 10 ms 39512 KB Output is correct
37 Correct 10 ms 39544 KB Output is correct
38 Correct 11 ms 39516 KB Output is correct
39 Correct 11 ms 39516 KB Output is correct
40 Correct 12 ms 39512 KB Output is correct
41 Correct 10 ms 39516 KB Output is correct
42 Correct 10 ms 39556 KB Output is correct
43 Correct 11 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 162 ms 83416 KB Output is correct
46 Correct 220 ms 104552 KB Output is correct
47 Correct 246 ms 104812 KB Output is correct
48 Correct 11 ms 39516 KB Output is correct
49 Correct 10 ms 39512 KB Output is correct
50 Correct 10 ms 39516 KB Output is correct
51 Correct 11 ms 39516 KB Output is correct
52 Correct 10 ms 39516 KB Output is correct
53 Correct 12 ms 39768 KB Output is correct
54 Correct 10 ms 39516 KB Output is correct
55 Correct 309 ms 120948 KB Output is correct
56 Correct 10 ms 39516 KB Output is correct
57 Execution timed out 3590 ms 40032 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct
17 Correct 10 ms 39516 KB Output is correct
18 Correct 10 ms 39516 KB Output is correct
19 Correct 11 ms 39512 KB Output is correct
20 Correct 394 ms 147852 KB Output is correct
21 Correct 349 ms 131344 KB Output is correct
22 Correct 399 ms 131316 KB Output is correct
23 Correct 339 ms 124772 KB Output is correct
24 Correct 65 ms 50768 KB Output is correct
25 Correct 63 ms 50728 KB Output is correct
26 Correct 63 ms 50788 KB Output is correct
27 Correct 422 ms 137300 KB Output is correct
28 Correct 403 ms 137576 KB Output is correct
29 Correct 390 ms 139116 KB Output is correct
30 Correct 403 ms 139220 KB Output is correct
31 Correct 10 ms 39516 KB Output is correct
32 Correct 32 ms 45976 KB Output is correct
33 Correct 71 ms 55256 KB Output is correct
34 Correct 392 ms 147980 KB Output is correct
35 Correct 14 ms 40024 KB Output is correct
36 Correct 26 ms 42588 KB Output is correct
37 Correct 42 ms 45736 KB Output is correct
38 Correct 148 ms 73972 KB Output is correct
39 Correct 281 ms 87100 KB Output is correct
40 Correct 284 ms 100084 KB Output is correct
41 Correct 356 ms 112956 KB Output is correct
42 Correct 427 ms 125416 KB Output is correct
43 Correct 10 ms 39512 KB Output is correct
44 Correct 11 ms 39516 KB Output is correct
45 Correct 11 ms 39512 KB Output is correct
46 Correct 11 ms 39516 KB Output is correct
47 Correct 10 ms 39516 KB Output is correct
48 Correct 11 ms 39512 KB Output is correct
49 Correct 11 ms 39512 KB Output is correct
50 Correct 11 ms 39516 KB Output is correct
51 Correct 10 ms 39516 KB Output is correct
52 Correct 10 ms 39516 KB Output is correct
53 Correct 11 ms 39376 KB Output is correct
54 Correct 11 ms 39644 KB Output is correct
55 Correct 11 ms 39772 KB Output is correct
56 Correct 153 ms 83572 KB Output is correct
57 Correct 230 ms 104620 KB Output is correct
58 Correct 263 ms 104556 KB Output is correct
59 Correct 10 ms 39516 KB Output is correct
60 Correct 10 ms 39516 KB Output is correct
61 Correct 13 ms 39516 KB Output is correct
62 Correct 265 ms 123280 KB Output is correct
63 Correct 254 ms 123284 KB Output is correct
64 Correct 266 ms 123856 KB Output is correct
65 Correct 11 ms 39772 KB Output is correct
66 Correct 13 ms 40028 KB Output is correct
67 Correct 152 ms 82696 KB Output is correct
68 Correct 244 ms 104108 KB Output is correct
69 Correct 334 ms 125884 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct
17 Correct 342 ms 135344 KB Output is correct
18 Correct 400 ms 143936 KB Output is correct
19 Correct 369 ms 131308 KB Output is correct
20 Correct 392 ms 124004 KB Output is correct
21 Correct 395 ms 125264 KB Output is correct
22 Correct 10 ms 39516 KB Output is correct
23 Correct 63 ms 53804 KB Output is correct
24 Correct 18 ms 40916 KB Output is correct
25 Correct 32 ms 43868 KB Output is correct
26 Correct 47 ms 46912 KB Output is correct
27 Correct 205 ms 83576 KB Output is correct
28 Correct 254 ms 95080 KB Output is correct
29 Correct 302 ms 105192 KB Output is correct
30 Correct 346 ms 115684 KB Output is correct
31 Correct 403 ms 126444 KB Output is correct
32 Correct 311 ms 126940 KB Output is correct
33 Correct 268 ms 123344 KB Output is correct
34 Correct 14 ms 39772 KB Output is correct
35 Correct 13 ms 40028 KB Output is correct
36 Correct 149 ms 82188 KB Output is correct
37 Correct 241 ms 103844 KB Output is correct
38 Correct 317 ms 125080 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 39516 KB Output is correct
2 Correct 11 ms 39516 KB Output is correct
3 Correct 11 ms 39516 KB Output is correct
4 Correct 11 ms 39516 KB Output is correct
5 Correct 12 ms 39512 KB Output is correct
6 Correct 10 ms 39516 KB Output is correct
7 Correct 10 ms 39512 KB Output is correct
8 Correct 11 ms 39516 KB Output is correct
9 Correct 131 ms 83028 KB Output is correct
10 Correct 22 ms 43612 KB Output is correct
11 Correct 69 ms 62636 KB Output is correct
12 Correct 27 ms 45908 KB Output is correct
13 Correct 21 ms 42604 KB Output is correct
14 Correct 10 ms 39516 KB Output is correct
15 Correct 11 ms 39516 KB Output is correct
16 Correct 128 ms 83172 KB Output is correct
17 Correct 11 ms 39516 KB Output is correct
18 Correct 10 ms 39516 KB Output is correct
19 Correct 14 ms 39516 KB Output is correct
20 Correct 11 ms 39512 KB Output is correct
21 Correct 11 ms 39516 KB Output is correct
22 Correct 11 ms 39768 KB Output is correct
23 Correct 309 ms 123616 KB Output is correct
24 Correct 10 ms 39516 KB Output is correct
25 Correct 12 ms 40028 KB Output is correct
26 Correct 11 ms 39636 KB Output is correct
27 Correct 13 ms 40024 KB Output is correct
28 Correct 107 ms 71976 KB Output is correct
29 Correct 175 ms 89060 KB Output is correct
30 Correct 210 ms 103868 KB Output is correct
31 Correct 319 ms 123588 KB Output is correct
32 Correct 11 ms 39512 KB Output is correct
33 Correct 11 ms 39512 KB Output is correct
34 Correct 11 ms 39516 KB Output is correct
35 Correct 11 ms 39512 KB Output is correct
36 Correct 10 ms 39512 KB Output is correct
37 Correct 10 ms 39544 KB Output is correct
38 Correct 11 ms 39516 KB Output is correct
39 Correct 11 ms 39516 KB Output is correct
40 Correct 12 ms 39512 KB Output is correct
41 Correct 10 ms 39516 KB Output is correct
42 Correct 10 ms 39556 KB Output is correct
43 Correct 11 ms 39516 KB Output is correct
44 Correct 11 ms 39772 KB Output is correct
45 Correct 162 ms 83416 KB Output is correct
46 Correct 220 ms 104552 KB Output is correct
47 Correct 246 ms 104812 KB Output is correct
48 Correct 11 ms 39516 KB Output is correct
49 Correct 10 ms 39512 KB Output is correct
50 Correct 10 ms 39516 KB Output is correct
51 Correct 11 ms 39516 KB Output is correct
52 Correct 10 ms 39516 KB Output is correct
53 Correct 12 ms 39768 KB Output is correct
54 Correct 10 ms 39516 KB Output is correct
55 Correct 309 ms 120948 KB Output is correct
56 Correct 10 ms 39516 KB Output is correct
57 Execution timed out 3590 ms 40032 KB Time limit exceeded
58 Halted 0 ms 0 KB -