oj.uz

답안 #1061719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061719 2024-08-16T12:08:36 Z mc061 분수 공원 (IOI21_parks) C++17
15 / 100
 3500 ms 67220 KB 
#include <bits/stdc++.h>
using namespace std;

map<pair<int, int>, int> vid;
int di[2] = {2, 0};
int dj[2] = {0, 2};

struct edge {
    int i1, j1, i2, j2;
};

vector<edge> edges;
const int N = 2e5+6;
struct DSU {
    int p[N]={};
    int sz[N];
    DSU() {
        iota(p, p+N, 0);
        fill(sz, sz+N, 1);
    }
    int get(int a) {
        return p[a] = (a == p[a] ? a : get(p[a]));
    }
    void merge(int a, int b) {
        int x = get(a), y = get(b);
        if (x == y) return;
        if (sz[x] > sz[y]) swap(x, y);
        p[x] = y;
        sz[y] += sz[x];
    }
};

vector<edge> horizontal, vertical;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);
bool try_build() {
    //0 - up(hor)   (from road: -1;+1)
    //1 - down(hor) (from road: +1;+1)
    //2 - left(ver) (from road: +1;-1)
    //3 - right(ver)(from road: +1;+1)

    vector<int> tlx = {-1, 1, 1, 1};
    vector<int> tly = {1, 1, -1, 1};

    vector<int> dx = {0, 0, 2, 2};
    vector<int> dy = {2, 2, 0, 0};

    map<pair<int, int>, int> bench_dir;
    for (const auto& e : horizontal) {
        bench_dir[{e.i1-1, e.j1+1}] = 0;
    }
    
    auto sieve_down = [&] (int bi, int bj) -> void {
        bench_dir.erase({bi, bj});
        bi += 2;
        while (bench_dir.count({bi, bj})) {
            bench_dir[{bi, bj}] = 1;
            bi += 2;
        }
        bench_dir[{bi, bj}] = 1;
    };

    for (const auto& e : vertical) {
        int wi_left = e.i1+1;
        int wj_left = e.j1-1;

        int wi_right = e.i1+1;
        int wj_right = e.j1+1;

        if (bench_dir.count({wi_left, wj_left})) {
            if (!bench_dir.count({wi_right, wj_right})) {
                bench_dir[{wi_right, wj_right}] = 3;
                continue;
            }
            int prev_dir = bench_dir[{wi_left, wj_left}];
            
            if (prev_dir == 0) {
                sieve_down(wi_left, wj_left);
                bench_dir[{wi_left, wj_left}] = 2;
                continue;
            }
            if (prev_dir == 1) {
                int prev_dir2 = bench_dir[{wi_right, wj_right}];
                if (prev_dir2 == 1) {
                    return false;
                }
            }
            sieve_down(wi_right, wj_right);
            bench_dir[{wi_right, wj_right}] = 3;
        }
        else {
            bench_dir[{wi_left, wj_left}] = 2;
        }
    }
    map<array<int, 4>, pair<int, int>> road_to_bench;
    for (const auto& [x, y] : bench_dir) {         
        int tx = x.first-tlx[y];
        int ty = x.second-tly[y];
        int bx = tx+dx[y];
        int by = ty+dy[y];
        road_to_bench[{tx, ty, bx, by}] = {x.first, x.second};
    }

    vector<int> u, v, a, b;

    for (const auto& e : horizontal) {
        u.push_back(vid[{e.i1, e.j1}]);
        v.push_back(vid[{e.i2, e.j2}]);
        a.push_back(road_to_bench[{e.i1, e.j1, e.i2, e.j2}].first);
        b.push_back(road_to_bench[{e.i1, e.j1, e.i2, e.j2}].second);
    }
    for (const auto& e : vertical) {
        u.push_back(vid[{e.i1, e.j1}]);
        v.push_back(vid[{e.i2, e.j2}]);
        a.push_back(road_to_bench[{e.i1, e.j1, e.i2, e.j2}].first);
        b.push_back(road_to_bench[{e.i1, e.j1, e.i2, e.j2}].second);
    }
    build(u, v, a, b);
    return true;
}

int construct_roads(vector<int> x, vector<int> y) {
    const int n = x.size();
    for (int i = 0; i < n; ++i) {
        vid[{x[i], y[i]}] = i;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 2; ++j) {
            int ni = x[i] + di[j];
            int nj = y[i] + dj[j];
            auto it = vid.find({ni, nj});
            if (it == vid.end()) continue;
            edges.push_back({x[i], y[i], ni, nj});
        }
    }

    for (int z = 0; z < 10; ++z) {
        vertical.clear();
        horizontal.clear();
        random_shuffle(edges.begin(), edges.end());
        DSU d;
        for (const edge& e : edges) {
            bool hor = e.i1 == e.i2;
            int id1 = vid[{e.i1, e.j1}];
            int id2 = vid[{e.i2, e.j2}];
            if (d.get(id1) == d.get(id2)) continue;
            d.merge(id1, id2);
            if (!hor) vertical.push_back(e);
            else horizontal.push_back(e);
        }

        if (d.sz[d.get(0)] != n) return 0;

        sort(vertical.begin(), vertical.end(), [&](const edge& a, const edge& b) {
            if (a.i1 != b.i1) return a.i1 < b.i1;
            return a.j1 < b.j1; 
        });
        for (int i = 0; i < 5; ++i) {
            int j = try_build();
            if (j == 1) return true;
        }
    }
    return false;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 740 ms 65056 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2136 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2396 KB Output is correct
28 Correct 216 ms 26668 KB Output is correct
29 Correct 349 ms 39516 KB Output is correct
30 Correct 571 ms 51928 KB Output is correct
31 Correct 683 ms 67220 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 1 ms 1884 KB Output is correct
35 Correct 1 ms 1884 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1992 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 1 ms 1884 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 3 ms 2396 KB Output is correct
45 Correct 311 ms 31664 KB Output is correct
46 Correct 416 ms 47188 KB Output is correct
47 Correct 455 ms 47440 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 740 ms 65056 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2136 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2396 KB Output is correct
28 Correct 216 ms 26668 KB Output is correct
29 Correct 349 ms 39516 KB Output is correct
30 Correct 571 ms 51928 KB Output is correct
31 Correct 683 ms 67220 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 1 ms 1884 KB Output is correct
35 Correct 1 ms 1884 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1992 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 1 ms 1884 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 3 ms 2396 KB Output is correct
45 Correct 311 ms 31664 KB Output is correct
46 Correct 416 ms 47188 KB Output is correct
47 Correct 455 ms 47440 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1884 KB Output is correct
50 Correct 1 ms 1884 KB Output is correct
51 Correct 1 ms 1884 KB Output is correct
52 Correct 1 ms 1880 KB Output is correct
53 Correct 1 ms 1884 KB Output is correct
54 Correct 1 ms 1884 KB Output is correct
55 Execution timed out 3599 ms 38056 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 635 ms 62696 KB Output is correct
21 Correct 574 ms 62364 KB Output is correct
22 Correct 605 ms 63140 KB Output is correct
23 Correct 454 ms 54036 KB Output is correct
24 Correct 161 ms 17492 KB Output is correct
25 Correct 325 ms 29124 KB Output is correct
26 Correct 258 ms 29384 KB Output is correct
27 Correct 639 ms 63020 KB Output is correct
28 Correct 636 ms 63524 KB Output is correct
29 Correct 570 ms 63628 KB Output is correct
30 Correct 602 ms 63024 KB Output is correct
31 Correct 1 ms 1880 KB Output is correct
32 Correct 28 ms 6332 KB Output is correct
33 Correct 76 ms 9808 KB Output is correct
34 Correct 594 ms 63388 KB Output is correct
35 Correct 10 ms 3160 KB Output is correct
36 Correct 57 ms 7888 KB Output is correct
37 Correct 128 ms 14016 KB Output is correct
38 Incorrect 1068 ms 13872 KB Solution announced impossible, but it is possible.
39 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct
17 Correct 544 ms 63396 KB Output is correct
18 Correct 592 ms 62692 KB Output is correct
19 Correct 596 ms 62876 KB Output is correct
20 Correct 627 ms 62404 KB Output is correct
21 Correct 528 ms 54872 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 328 ms 11444 KB Output is correct
24 Correct 22 ms 4560 KB Output is correct
25 Correct 91 ms 11204 KB Output is correct
26 Correct 191 ms 17844 KB Output is correct
27 Incorrect 1420 ms 17888 KB Solution announced impossible, but it is possible.
28 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 277 ms 31592 KB Output is correct
10 Correct 18 ms 4944 KB Output is correct
11 Correct 130 ms 17836 KB Output is correct
12 Correct 30 ms 6340 KB Output is correct
13 Correct 38 ms 7436 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 273 ms 31768 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 740 ms 65056 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2136 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2396 KB Output is correct
28 Correct 216 ms 26668 KB Output is correct
29 Correct 349 ms 39516 KB Output is correct
30 Correct 571 ms 51928 KB Output is correct
31 Correct 683 ms 67220 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 1 ms 1884 KB Output is correct
35 Correct 1 ms 1884 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1992 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 1 ms 1884 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 3 ms 2396 KB Output is correct
45 Correct 311 ms 31664 KB Output is correct
46 Correct 416 ms 47188 KB Output is correct
47 Correct 455 ms 47440 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1884 KB Output is correct
50 Correct 1 ms 1884 KB Output is correct
51 Correct 1 ms 1884 KB Output is correct
52 Correct 1 ms 1880 KB Output is correct
53 Correct 1 ms 1884 KB Output is correct
54 Correct 1 ms 1884 KB Output is correct
55 Execution timed out 3599 ms 38056 KB Time limit exceeded
56 Halted 0 ms 0 KB -