oj.uz

Submission #588144

# Submission time Handle Problem Language Result Execution time Memory
588144 2022-07-02T18:08:18 Z Clan328 Fountain Parks (IOI21_parks) C++17
5 / 100
 173 ms 35708 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

struct Coord {
    int x, y, i;

    bool operator<(Coord other) const  {
        if (y == other.y) {
            return x < other.x;
        }
        return y < other.y;
    }
};

int n;
vector<Coord> coords;
std::vector<int> u, v, a, b;

vector<int> link;

int find(int x) {
    if (link[x] != x) link[x] = find(link[x]);
    return link[x];
}

void unite(int a, int b) {
    int x = find(a), y = find(b);
    link[x] = y;
}

bool same(int a, int b) {
    return find(a) == find(b);
}

void connect(int i, int j) {
    if (coords[i].x == coords[j].x) {
        u.pb(coords[i].i);
        v.pb(coords[j].i);
        if (coords[i].x == 4)
            a.pb(coords[i].x+1);
        else
            a.pb(coords[i].x-1);
        b.pb(coords[i].y+1);
    } else if (coords[i].y == coords[j].y) {
        u.pb(coords[i].i);
        v.pb(coords[j].i);
        a.pb(coords[i].x+1);
        b.pb(coords[i].y-1);
    }
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
        build({}, {}, {}, {});
        return 1;
    }  

    n = x.size();

    int maxX = 0;
    for (int i = 0; i < n; i++) maxX = max(maxX, x[i]);

    bool res = true;
    // if (maxX <= 4) {
    //     coords = vector<Coord>(n);
    //     for (int i = 0; i < n; i++) {
    //         coords[i] = {x[i], y[i], i};
    //     }

    //     sort(coords.begin(), coords.end());
        
    //     link = vector<int>(n);
    //     iota(link.begin(), link.end(), 0);
    //     for (int i = 0; i < n-1; i++) {
    //         if ((coords[i].y+2 == coords[i+1].y && coords[i].x == coords[i+1].x) || (coords[i].y == coords[i+1].y && abs(coords[i+1].x-coords[i].x) == 2)) {
    //             connect(i, i+1);
    //             unite(i, i+1);
    //         }
    //         if (i+2 < n && ((coords[i].y+2 == coords[i+2].y && coords[i].x == coords[i+2].x) || (coords[i].y == coords[i+2].y && abs(coords[i+2].x-coords[i].x) == 2))) {
    //             connect(i, i+2);
    //             unite(i, i+2);
    //         }
    //     }
        
    //     for (int i = 0; i < n-1; i++) {
    //         res &= find(i) == find(i+1);
    //     }
    // } else {
        int maxY = 0;
        for (int i = 0; i < n; i++) maxY = max(maxY, y[i]);

        link = vector<int>(n);
        iota(link.begin(), link.end(), 0);
        vector<vector<int>> mat(maxY/2, vector<int>(3)), matIdx(maxY/2, vector<int>(3));
        for (int i = 0; i < n; i++) {
            mat[y[i]/2-1][x[i]/2-1] = 1;
            matIdx[y[i]/2-1][x[i]/2-1] = i;
        }

        map<int, map<int, int>> bench;

        for (int i = 0; i < maxY/2; i++) {
            if (mat[i][0] && mat[i][1]) {
                if (bench[3][2*i+1]) {
                    if (!same(matIdx[i][0], matIdx[i][1])) {
                        if (bench[3][2*i+3]) res = false;
                        u.pb(matIdx[i][0]);
                        v.pb(matIdx[i][1]);
                        a.pb(3);
                        b.pb(2*i+3);
                        unite(matIdx[i][0], matIdx[i][1]);
                    }
                } else {
                    u.pb(matIdx[i][0]);
                    v.pb(matIdx[i][1]);
                    a.pb(3);
                    b.pb(2*i+1);
                    unite(matIdx[i][0], matIdx[i][1]);
                }
            }
            if (mat[i][1] && mat[i][2]) {
                if (bench[5][2*i+1]) {
                    if (!same(matIdx[i][1], matIdx[i][2])) {
                        if (bench[5][2*i+3]) res = false;
                        u.pb(matIdx[i][1]);
                        v.pb(matIdx[i][2]);
                        a.pb(5);
                        b.pb(2*i+3);
                        unite(matIdx[i][1], matIdx[i][2]);
                    }
                } else {
                    u.pb(matIdx[i][1]);
                    v.pb(matIdx[i][2]);
                    a.pb(5);
                    b.pb(2*i+1);
                    unite(matIdx[i][1], matIdx[i][2]);
                }
            }
            if (i == maxY/2-1) continue;
            bool isValid = false;
            if (mat[i][0] && mat[i+1][0]) {
                u.pb(matIdx[i][0]);
                v.pb(matIdx[i+1][0]);
                a.pb(1);
                b.pb(2*i+3);
                unite(matIdx[i][0], matIdx[i+1][0]);
                isValid = true;
            }
            if (mat[i][2] && mat[i+1][2]) {
                u.pb(matIdx[i][2]);
                v.pb(matIdx[i+1][2]);
                a.pb(7);
                b.pb(2*i+3);
                unite(matIdx[i][2], matIdx[i+1][2]);
                isValid = true;
            }

            if (!isValid && mat[i][1] && mat[i+1][1]) {
                u.pb(matIdx[i][1]);
                v.pb(matIdx[i+1][1]);
                if (!bench[3][2*i+3])
                    a.pb(3);
                else if (!bench[5][2*i+3])
                    a.pb(5);
                else
                    res = false;
                b.pb(2*i+3);
                unite(matIdx[i][1], matIdx[i+1][1]);
            }

            if (a.size()) {
                bench[a[a.size()-1]][b[b.size()-1]] = true;
            }
        }



        for (int i = 0; i < n-1; i++) {
            res &= find(i) == find(i+1);
        }
    // }

    if (!res) return 0;

    build(u, v, a, b);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 17 ms 11260 KB Output is correct
23 Correct 173 ms 34708 KB Output is correct
24 Correct 14 ms 10324 KB Output is correct
25 Correct 15 ms 10580 KB Output is correct
26 Correct 19 ms 11348 KB Output is correct
27 Correct 20 ms 10068 KB Output is correct
28 Correct 64 ms 14220 KB Output is correct
29 Correct 99 ms 25916 KB Output is correct
30 Correct 150 ms 31136 KB Output is correct
31 Correct 171 ms 35708 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 16 ms 11260 KB Output is correct
43 Correct 6 ms 4052 KB Output is correct
44 Correct 15 ms 10196 KB Output is correct
45 Incorrect 92 ms 22568 KB Tree @(3, 62153) appears more than once: for edges on positions 10 and 11
46 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 17 ms 11260 KB Output is correct
23 Correct 173 ms 34708 KB Output is correct
24 Correct 14 ms 10324 KB Output is correct
25 Correct 15 ms 10580 KB Output is correct
26 Correct 19 ms 11348 KB Output is correct
27 Correct 20 ms 10068 KB Output is correct
28 Correct 64 ms 14220 KB Output is correct
29 Correct 99 ms 25916 KB Output is correct
30 Correct 150 ms 31136 KB Output is correct
31 Correct 171 ms 35708 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 16 ms 11260 KB Output is correct
43 Correct 6 ms 4052 KB Output is correct
44 Correct 15 ms 10196 KB Output is correct
45 Incorrect 92 ms 22568 KB Tree @(3, 62153) appears more than once: for edges on positions 10 and 11
46 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct
17 Runtime error 1 ms 340 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct
17 Runtime error 49 ms 19396 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 99 ms 23696 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 43 ms 13092 KB Output is correct
12 Correct 12 ms 4052 KB Output is correct
13 Correct 26 ms 11464 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 13 ms 9428 KB Output is correct
16 Correct 92 ms 23188 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 17 ms 11260 KB Output is correct
23 Correct 173 ms 34708 KB Output is correct
24 Correct 14 ms 10324 KB Output is correct
25 Correct 15 ms 10580 KB Output is correct
26 Correct 19 ms 11348 KB Output is correct
27 Correct 20 ms 10068 KB Output is correct
28 Correct 64 ms 14220 KB Output is correct
29 Correct 99 ms 25916 KB Output is correct
30 Correct 150 ms 31136 KB Output is correct
31 Correct 171 ms 35708 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 16 ms 11260 KB Output is correct
43 Correct 6 ms 4052 KB Output is correct
44 Correct 15 ms 10196 KB Output is correct
45 Incorrect 92 ms 22568 KB Tree @(3, 62153) appears more than once: for edges on positions 10 and 11
46 Halted 0 ms 0 KB -