oj.uz

답안 #1061753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061753 2024-08-16T12:40:02 Z mc061 분수 공원 (IOI21_parks) C++17
25 / 100
 2631 ms 66124 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 == 3) return false;

            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 < 12; ++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_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);
        }
        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);
        }
 
        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:158:18: warning: unused variable 'hor' [-Wunused-variable]
  158 |             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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct

Subtask #2
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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Incorrect 2631 ms 38312 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -

Subtask #3
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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Incorrect 2631 ms 38312 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -

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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 589 ms 66124 KB Output is correct
21 Correct 588 ms 64544 KB Output is correct
22 Correct 579 ms 65432 KB Output is correct
23 Correct 450 ms 54604 KB Output is correct
24 Correct 150 ms 17492 KB Output is correct
25 Correct 340 ms 32892 KB Output is correct
26 Correct 271 ms 31612 KB Output is correct
27 Correct 623 ms 62900 KB Output is correct
28 Correct 679 ms 62760 KB Output is correct
29 Correct 566 ms 62256 KB Output is correct
30 Correct 604 ms 62504 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 28 ms 6252 KB Output is correct
33 Correct 69 ms 9804 KB Output is correct
34 Correct 585 ms 64252 KB Output is correct
35 Correct 10 ms 3236 KB Output is correct
36 Correct 72 ms 8644 KB Output is correct
37 Correct 132 ms 15424 KB Output is correct
38 Incorrect 660 ms 15164 KB Solution announced impossible, but it is possible.
39 Halted 0 ms 0 KB -

Subtask #5
20.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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct
17 Correct 571 ms 64388 KB Output is correct
18 Correct 561 ms 65380 KB Output is correct
19 Correct 603 ms 63972 KB Output is correct
20 Correct 641 ms 63548 KB Output is correct
21 Correct 540 ms 56424 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 69 ms 11740 KB Output is correct
24 Correct 25 ms 4688 KB Output is correct
25 Correct 101 ms 11576 KB Output is correct
26 Correct 176 ms 18928 KB Output is correct
27 Correct 348 ms 33312 KB Output is correct
28 Correct 635 ms 42548 KB Output is correct
29 Correct 1100 ms 52188 KB Output is correct
30 Correct 1065 ms 57320 KB Output is correct
31 Correct 1054 ms 65192 KB Output is correct
32 Correct 677 ms 63612 KB Output is correct
33 Correct 669 ms 62408 KB Output is correct
34 Correct 4 ms 2652 KB Output is correct
35 Correct 9 ms 3208 KB Output is correct
36 Correct 264 ms 32576 KB Output is correct
37 Correct 428 ms 48644 KB Output is correct
38 Correct 651 ms 63500 KB Output is correct

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 2 ms 1884 KB Output is correct
5 Correct 1 ms 1892 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 277 ms 32036 KB Output is correct
10 Correct 18 ms 4920 KB Output is correct
11 Correct 119 ms 17980 KB Output is correct
12 Correct 27 ms 6364 KB Output is correct
13 Correct 37 ms 8380 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 2 ms 2140 KB Output is correct
16 Correct 269 ms 32016 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Incorrect 2631 ms 38312 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -