oj.uz

Submission #1061730

# Submission time Handle Problem Language Result Execution time Memory
1061730 2024-08-16T12:17:43 Z mc061 Fountain Parks (IOI21_parks) C++17
30 / 100
 2291 ms 70500 KB 
#pragma GCC optimize("Ofast")

#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() {
    srand(69420);
    //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 < 30; ++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:152:18: warning: unused variable 'hor' [-Wunused-variable]
  152 |             bool hor = e.i1 == e.i2;
      |                  ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 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 765 ms 66012 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 5 ms 2460 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 232 ms 27620 KB Output is correct
29 Correct 415 ms 39472 KB Output is correct
30 Correct 571 ms 54868 KB Output is correct
31 Correct 776 ms 67144 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 2 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 1884 KB Output is correct
43 Correct 3 ms 2136 KB Output is correct
44 Correct 3 ms 2392 KB Output is correct
45 Correct 266 ms 32176 KB Output is correct
46 Correct 450 ms 48796 KB Output is correct
47 Correct 432 ms 47708 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 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 765 ms 66012 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 5 ms 2460 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 232 ms 27620 KB Output is correct
29 Correct 415 ms 39472 KB Output is correct
30 Correct 571 ms 54868 KB Output is correct
31 Correct 776 ms 67144 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 2 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 1884 KB Output is correct
43 Correct 3 ms 2136 KB Output is correct
44 Correct 3 ms 2392 KB Output is correct
45 Correct 266 ms 32176 KB Output is correct
46 Correct 450 ms 48796 KB Output is correct
47 Correct 432 ms 47708 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1880 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 1884 KB Output is correct
53 Correct 1 ms 1884 KB Output is correct
54 Correct 1 ms 1884 KB Output is correct
55 Correct 841 ms 70500 KB Output is correct
56 Correct 1 ms 1880 KB Output is correct
57 Correct 4 ms 2396 KB Output is correct
58 Correct 11 ms 3960 KB Output is correct
59 Correct 11 ms 3676 KB Output is correct
60 Correct 311 ms 34532 KB Output is correct
61 Correct 468 ms 48792 KB Output is correct
62 Correct 609 ms 58652 KB Output is correct
63 Correct 814 ms 66712 KB Output is correct
64 Correct 1 ms 1880 KB Output is correct
65 Correct 1 ms 1884 KB Output is correct
66 Correct 1 ms 1884 KB Output is correct
67 Correct 675 ms 62540 KB Output is correct
68 Correct 677 ms 62096 KB Output is correct
69 Correct 662 ms 61900 KB Output is correct
70 Correct 4 ms 2392 KB Output is correct
71 Correct 7 ms 3016 KB Output is correct
72 Correct 261 ms 32308 KB Output is correct
73 Correct 450 ms 49064 KB Output is correct
74 Correct 652 ms 62776 KB Output is correct
75 Correct 722 ms 65252 KB Output is correct
76 Correct 674 ms 62256 KB Output is correct
77 Correct 6 ms 2652 KB Output is correct
78 Correct 8 ms 3188 KB Output is correct
79 Correct 266 ms 32452 KB Output is correct
80 Correct 452 ms 50440 KB Output is correct
81 Correct 670 ms 65712 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 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 604 ms 66332 KB Output is correct
21 Correct 584 ms 64060 KB Output is correct
22 Correct 576 ms 65508 KB Output is correct
23 Correct 445 ms 54584 KB Output is correct
24 Correct 164 ms 17624 KB Output is correct
25 Correct 337 ms 31792 KB Output is correct
26 Correct 278 ms 31660 KB Output is correct
27 Correct 633 ms 63500 KB Output is correct
28 Correct 680 ms 64308 KB Output is correct
29 Correct 634 ms 63016 KB Output is correct
30 Correct 591 ms 62508 KB Output is correct
31 Correct 2 ms 2136 KB Output is correct
32 Correct 29 ms 6344 KB Output is correct
33 Correct 76 ms 9716 KB Output is correct
34 Correct 597 ms 64500 KB Output is correct
35 Correct 10 ms 3236 KB Output is correct
36 Correct 62 ms 8628 KB Output is correct
37 Correct 137 ms 15304 KB Output is correct
38 Incorrect 1657 ms 15196 KB Solution announced impossible, but it is possible.
39 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 KB Output is correct
17 Correct 642 ms 63664 KB Output is correct
18 Correct 644 ms 66288 KB Output is correct
19 Correct 618 ms 64492 KB Output is correct
20 Correct 706 ms 63508 KB Output is correct
21 Correct 523 ms 56664 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 307 ms 11664 KB Output is correct
24 Correct 22 ms 4688 KB Output is correct
25 Correct 93 ms 11564 KB Output is correct
26 Correct 171 ms 19892 KB Output is correct
27 Incorrect 2291 ms 19944 KB Solution announced impossible, but it is possible.
28 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 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 1884 KB Output is correct
5 Correct 1 ms 1884 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 2136 KB Output is correct
9 Correct 261 ms 31972 KB Output is correct
10 Correct 18 ms 5076 KB Output is correct
11 Correct 134 ms 17976 KB Output is correct
12 Correct 28 ms 6368 KB Output is correct
13 Correct 42 ms 8384 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 31860 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 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 765 ms 66012 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 5 ms 2460 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 232 ms 27620 KB Output is correct
29 Correct 415 ms 39472 KB Output is correct
30 Correct 571 ms 54868 KB Output is correct
31 Correct 776 ms 67144 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 2 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 1884 KB Output is correct
43 Correct 3 ms 2136 KB Output is correct
44 Correct 3 ms 2392 KB Output is correct
45 Correct 266 ms 32176 KB Output is correct
46 Correct 450 ms 48796 KB Output is correct
47 Correct 432 ms 47708 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1880 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 1884 KB Output is correct
53 Correct 1 ms 1884 KB Output is correct
54 Correct 1 ms 1884 KB Output is correct
55 Correct 841 ms 70500 KB Output is correct
56 Correct 1 ms 1880 KB Output is correct
57 Correct 4 ms 2396 KB Output is correct
58 Correct 11 ms 3960 KB Output is correct
59 Correct 11 ms 3676 KB Output is correct
60 Correct 311 ms 34532 KB Output is correct
61 Correct 468 ms 48792 KB Output is correct
62 Correct 609 ms 58652 KB Output is correct
63 Correct 814 ms 66712 KB Output is correct
64 Correct 1 ms 1880 KB Output is correct
65 Correct 1 ms 1884 KB Output is correct
66 Correct 1 ms 1884 KB Output is correct
67 Correct 675 ms 62540 KB Output is correct
68 Correct 677 ms 62096 KB Output is correct
69 Correct 662 ms 61900 KB Output is correct
70 Correct 4 ms 2392 KB Output is correct
71 Correct 7 ms 3016 KB Output is correct
72 Correct 261 ms 32308 KB Output is correct
73 Correct 450 ms 49064 KB Output is correct
74 Correct 652 ms 62776 KB Output is correct
75 Correct 722 ms 65252 KB Output is correct
76 Correct 674 ms 62256 KB Output is correct
77 Correct 6 ms 2652 KB Output is correct
78 Correct 8 ms 3188 KB Output is correct
79 Correct 266 ms 32452 KB Output is correct
80 Correct 452 ms 50440 KB Output is correct
81 Correct 670 ms 65712 KB Output is correct
82 Correct 1 ms 1880 KB Output is correct
83 Correct 1 ms 1884 KB Output is correct
84 Correct 1 ms 1884 KB Output is correct
85 Correct 604 ms 66332 KB Output is correct
86 Correct 584 ms 64060 KB Output is correct
87 Correct 576 ms 65508 KB Output is correct
88 Correct 445 ms 54584 KB Output is correct
89 Correct 164 ms 17624 KB Output is correct
90 Correct 337 ms 31792 KB Output is correct
91 Correct 278 ms 31660 KB Output is correct
92 Correct 633 ms 63500 KB Output is correct
93 Correct 680 ms 64308 KB Output is correct
94 Correct 634 ms 63016 KB Output is correct
95 Correct 591 ms 62508 KB Output is correct
96 Correct 2 ms 2136 KB Output is correct
97 Correct 29 ms 6344 KB Output is correct
98 Correct 76 ms 9716 KB Output is correct
99 Correct 597 ms 64500 KB Output is correct
100 Correct 10 ms 3236 KB Output is correct
101 Correct 62 ms 8628 KB Output is correct
102 Correct 137 ms 15304 KB Output is correct
103 Incorrect 1657 ms 15196 KB Solution announced impossible, but it is possible.
104 Halted 0 ms 0 KB -