oj.uz

답안 #1061727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061727 2024-08-16T12:16:10 Z mc061 분수 공원 (IOI21_parks) C++17
30 / 100
 1338 ms 70432 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;
    }
    vector<edge> all_vert;
    vector<edge> all_hor;
    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});
            bool hor = ni == x[i];
            if (!hor) all_vert.push_back({x[i], y[i], ni, nj});
            else all_hor.push_back({x[i], y[i], ni, nj});
        }
    }

    for (int z = 0; z < 17; ++z) {
        random_shuffle(all_hor.begin(), all_hor.end());
        random_shuffle(all_vert.begin(), all_vert.end());
        vertical.clear();
        horizontal.clear();
        DSU d;
        for (const edge& e : all_hor) {
            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);
            horizontal.push_back(e);
        }
        for (const edge& e : all_vert) {
            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);
            vertical.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; 
        });
        int j = try_build();
        if (j == 1) return true;
    }
    return false;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:149:18: warning: unused variable 'hor' [-Wunused-variable]
  149 |             bool hor = e.i1 == e.i2;
      |                  ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 2 ms 1884 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 789 ms 65844 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2588 KB Output is correct
28 Correct 221 ms 27448 KB Output is correct
29 Correct 375 ms 41008 KB Output is correct
30 Correct 558 ms 54828 KB Output is correct
31 Correct 775 ms 66028 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 1 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 1 ms 1884 KB Output is correct
37 Correct 1 ms 1884 KB Output is correct
38 Correct 1 ms 1884 KB Output is correct
39 Correct 1 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 1 ms 1884 KB Output is correct
42 Correct 1 ms 1880 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 4 ms 2396 KB Output is correct
45 Correct 318 ms 32312 KB Output is correct
46 Correct 418 ms 48988 KB Output is correct
47 Correct 436 ms 47988 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 2 ms 1884 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 789 ms 65844 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2588 KB Output is correct
28 Correct 221 ms 27448 KB Output is correct
29 Correct 375 ms 41008 KB Output is correct
30 Correct 558 ms 54828 KB Output is correct
31 Correct 775 ms 66028 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 1 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 1 ms 1884 KB Output is correct
37 Correct 1 ms 1884 KB Output is correct
38 Correct 1 ms 1884 KB Output is correct
39 Correct 1 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 1 ms 1884 KB Output is correct
42 Correct 1 ms 1880 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 4 ms 2396 KB Output is correct
45 Correct 318 ms 32312 KB Output is correct
46 Correct 418 ms 48988 KB Output is correct
47 Correct 436 ms 47988 KB Output is correct
48 Correct 1 ms 1884 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 2 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 Correct 725 ms 68344 KB Output is correct
56 Correct 2 ms 1880 KB Output is correct
57 Correct 4 ms 2396 KB Output is correct
58 Correct 11 ms 3956 KB Output is correct
59 Correct 13 ms 3676 KB Output is correct
60 Correct 358 ms 35368 KB Output is correct
61 Correct 512 ms 49264 KB Output is correct
62 Correct 649 ms 59160 KB Output is correct
63 Correct 934 ms 70432 KB Output is correct
64 Correct 1 ms 1884 KB Output is correct
65 Correct 2 ms 1884 KB Output is correct
66 Correct 1 ms 1972 KB Output is correct
67 Correct 740 ms 63768 KB Output is correct
68 Correct 707 ms 65824 KB Output is correct
69 Correct 674 ms 63948 KB Output is correct
70 Correct 4 ms 2392 KB Output is correct
71 Correct 7 ms 3128 KB Output is correct
72 Correct 265 ms 33040 KB Output is correct
73 Correct 457 ms 50604 KB Output is correct
74 Correct 732 ms 64404 KB Output is correct
75 Correct 720 ms 67564 KB Output is correct
76 Correct 686 ms 64284 KB Output is correct
77 Correct 6 ms 2652 KB Output is correct
78 Correct 10 ms 3420 KB Output is correct
79 Correct 276 ms 33260 KB Output is correct
80 Correct 549 ms 50252 KB Output is correct
81 Correct 700 ms 66348 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 600 ms 66332 KB Output is correct
21 Correct 563 ms 64920 KB Output is correct
22 Correct 594 ms 66204 KB Output is correct
23 Correct 429 ms 55608 KB Output is correct
24 Correct 172 ms 17624 KB Output is correct
25 Correct 338 ms 30364 KB Output is correct
26 Correct 317 ms 30308 KB Output is correct
27 Correct 664 ms 62816 KB Output is correct
28 Correct 687 ms 63536 KB Output is correct
29 Correct 576 ms 62768 KB Output is correct
30 Correct 559 ms 62692 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 28 ms 6376 KB Output is correct
33 Correct 72 ms 9624 KB Output is correct
34 Correct 590 ms 64240 KB Output is correct
35 Correct 10 ms 3236 KB Output is correct
36 Correct 57 ms 8600 KB Output is correct
37 Correct 156 ms 15412 KB Output is correct
38 Incorrect 1043 ms 15192 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 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct
17 Correct 653 ms 64492 KB Output is correct
18 Correct 654 ms 66408 KB Output is correct
19 Correct 582 ms 63980 KB Output is correct
20 Correct 715 ms 63416 KB Output is correct
21 Correct 523 ms 56404 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 108 ms 11656 KB Output is correct
24 Correct 22 ms 4684 KB Output is correct
25 Correct 93 ms 11576 KB Output is correct
26 Correct 186 ms 19380 KB Output is correct
27 Incorrect 1338 ms 19580 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 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1988 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 260 ms 32056 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 115 ms 17988 KB Output is correct
12 Correct 27 ms 6336 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 275 ms 32508 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 2 ms 1884 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 789 ms 65844 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2588 KB Output is correct
28 Correct 221 ms 27448 KB Output is correct
29 Correct 375 ms 41008 KB Output is correct
30 Correct 558 ms 54828 KB Output is correct
31 Correct 775 ms 66028 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 1 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 1 ms 1884 KB Output is correct
37 Correct 1 ms 1884 KB Output is correct
38 Correct 1 ms 1884 KB Output is correct
39 Correct 1 ms 1884 KB Output is correct
40 Correct 1 ms 1884 KB Output is correct
41 Correct 1 ms 1884 KB Output is correct
42 Correct 1 ms 1880 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 4 ms 2396 KB Output is correct
45 Correct 318 ms 32312 KB Output is correct
46 Correct 418 ms 48988 KB Output is correct
47 Correct 436 ms 47988 KB Output is correct
48 Correct 1 ms 1884 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 2 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 Correct 725 ms 68344 KB Output is correct
56 Correct 2 ms 1880 KB Output is correct
57 Correct 4 ms 2396 KB Output is correct
58 Correct 11 ms 3956 KB Output is correct
59 Correct 13 ms 3676 KB Output is correct
60 Correct 358 ms 35368 KB Output is correct
61 Correct 512 ms 49264 KB Output is correct
62 Correct 649 ms 59160 KB Output is correct
63 Correct 934 ms 70432 KB Output is correct
64 Correct 1 ms 1884 KB Output is correct
65 Correct 2 ms 1884 KB Output is correct
66 Correct 1 ms 1972 KB Output is correct
67 Correct 740 ms 63768 KB Output is correct
68 Correct 707 ms 65824 KB Output is correct
69 Correct 674 ms 63948 KB Output is correct
70 Correct 4 ms 2392 KB Output is correct
71 Correct 7 ms 3128 KB Output is correct
72 Correct 265 ms 33040 KB Output is correct
73 Correct 457 ms 50604 KB Output is correct
74 Correct 732 ms 64404 KB Output is correct
75 Correct 720 ms 67564 KB Output is correct
76 Correct 686 ms 64284 KB Output is correct
77 Correct 6 ms 2652 KB Output is correct
78 Correct 10 ms 3420 KB Output is correct
79 Correct 276 ms 33260 KB Output is correct
80 Correct 549 ms 50252 KB Output is correct
81 Correct 700 ms 66348 KB Output is correct
82 Correct 1 ms 1884 KB Output is correct
83 Correct 2 ms 1884 KB Output is correct
84 Correct 1 ms 1884 KB Output is correct
85 Correct 600 ms 66332 KB Output is correct
86 Correct 563 ms 64920 KB Output is correct
87 Correct 594 ms 66204 KB Output is correct
88 Correct 429 ms 55608 KB Output is correct
89 Correct 172 ms 17624 KB Output is correct
90 Correct 338 ms 30364 KB Output is correct
91 Correct 317 ms 30308 KB Output is correct
92 Correct 664 ms 62816 KB Output is correct
93 Correct 687 ms 63536 KB Output is correct
94 Correct 576 ms 62768 KB Output is correct
95 Correct 559 ms 62692 KB Output is correct
96 Correct 2 ms 1884 KB Output is correct
97 Correct 28 ms 6376 KB Output is correct
98 Correct 72 ms 9624 KB Output is correct
99 Correct 590 ms 64240 KB Output is correct
100 Correct 10 ms 3236 KB Output is correct
101 Correct 57 ms 8600 KB Output is correct
102 Correct 156 ms 15412 KB Output is correct
103 Incorrect 1043 ms 15192 KB Solution announced impossible, but it is possible.
104 Halted 0 ms 0 KB -