oj.uz

Submission #1061732

# Submission time Handle Problem Language Result Execution time Memory
1061732 2024-08-16T12:19:01 Z mc061 Fountain Parks (IOI21_parks) C++17
35 / 100
 1502 ms 72816 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_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:159:18: warning: unused variable 'hor' [-Wunused-variable]
  159 |             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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 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 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 768 ms 65480 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2648 KB Output is correct
28 Correct 214 ms 27432 KB Output is correct
29 Correct 368 ms 39472 KB Output is correct
30 Correct 563 ms 53552 KB Output is correct
31 Correct 707 ms 68380 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 2136 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 2136 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 4 ms 2436 KB Output is correct
45 Correct 271 ms 32288 KB Output is correct
46 Correct 437 ms 48424 KB Output is correct
47 Correct 417 ms 46744 KB Output is correct

Subtask #3
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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 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 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 768 ms 65480 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2648 KB Output is correct
28 Correct 214 ms 27432 KB Output is correct
29 Correct 368 ms 39472 KB Output is correct
30 Correct 563 ms 53552 KB Output is correct
31 Correct 707 ms 68380 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 2136 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 2136 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 4 ms 2436 KB Output is correct
45 Correct 271 ms 32288 KB Output is correct
46 Correct 437 ms 48424 KB Output is correct
47 Correct 417 ms 46744 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1884 KB Output is correct
50 Correct 2 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 Incorrect 732 ms 72816 KB a[0] = 0 is not an odd integer
56 Halted 0 ms 0 KB -

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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 587 ms 66268 KB Output is correct
21 Correct 589 ms 64348 KB Output is correct
22 Correct 605 ms 65688 KB Output is correct
23 Correct 427 ms 55608 KB Output is correct
24 Correct 155 ms 17492 KB Output is correct
25 Correct 337 ms 30908 KB Output is correct
26 Correct 262 ms 32680 KB Output is correct
27 Correct 658 ms 62284 KB Output is correct
28 Correct 620 ms 62696 KB Output is correct
29 Correct 577 ms 62004 KB Output is correct
30 Correct 573 ms 62732 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 28 ms 6348 KB Output is correct
33 Correct 71 ms 9612 KB Output is correct
34 Correct 569 ms 64860 KB Output is correct
35 Correct 10 ms 3236 KB Output is correct
36 Correct 62 ms 8564 KB Output is correct
37 Correct 130 ms 15412 KB Output is correct
38 Incorrect 1502 ms 15192 KB Solution announced impossible, but it is possible.
39 Halted 0 ms 0 KB -

Subtask #5
20.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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 KB Output is correct
17 Correct 548 ms 63884 KB Output is correct
18 Correct 532 ms 65888 KB Output is correct
19 Correct 563 ms 64488 KB Output is correct
20 Correct 584 ms 63660 KB Output is correct
21 Correct 498 ms 56488 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 68 ms 11652 KB Output is correct
24 Correct 25 ms 4588 KB Output is correct
25 Correct 94 ms 11560 KB Output is correct
26 Correct 176 ms 20024 KB Output is correct
27 Correct 514 ms 33256 KB Output is correct
28 Correct 811 ms 42968 KB Output is correct
29 Correct 693 ms 51084 KB Output is correct
30 Correct 804 ms 57452 KB Output is correct
31 Correct 1172 ms 65020 KB Output is correct
32 Correct 634 ms 63972 KB Output is correct
33 Correct 668 ms 63388 KB Output is correct
34 Correct 5 ms 2652 KB Output is correct
35 Correct 8 ms 3308 KB Output is correct
36 Correct 252 ms 32384 KB Output is correct
37 Correct 431 ms 49548 KB Output is correct
38 Correct 625 ms 63904 KB Output is correct

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 1884 KB Output is correct
9 Correct 264 ms 32008 KB Output is correct
10 Correct 19 ms 5080 KB Output is correct
11 Correct 122 ms 18152 KB Output is correct
12 Correct 27 ms 6376 KB Output is correct
13 Correct 37 ms 8392 KB Output is correct
14 Correct 1 ms 2140 KB Output is correct
15 Correct 2 ms 2268 KB Output is correct
16 Correct 258 ms 32112 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 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 768 ms 65480 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 4 ms 2648 KB Output is correct
28 Correct 214 ms 27432 KB Output is correct
29 Correct 368 ms 39472 KB Output is correct
30 Correct 563 ms 53552 KB Output is correct
31 Correct 707 ms 68380 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 2136 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 2136 KB Output is correct
43 Correct 3 ms 2140 KB Output is correct
44 Correct 4 ms 2436 KB Output is correct
45 Correct 271 ms 32288 KB Output is correct
46 Correct 437 ms 48424 KB Output is correct
47 Correct 417 ms 46744 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1884 KB Output is correct
50 Correct 2 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 Incorrect 732 ms 72816 KB a[0] = 0 is not an odd integer
56 Halted 0 ms 0 KB -