oj.uz

Submission #588064

# Submission time Handle Problem Language Result Execution time Memory
588064 2022-07-02T16:57:16 Z Clan328 Fountain Parks (IOI21_parks) C++17
15 / 100
 199 ms 26352 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();

    vector<pair<int, int>> yi(n);
    coords = vector<Coord>(n);
    for (int i = 0; i < n; i++) {
        coords[i] = {x[i], y[i], i};
    }

    sort(coords.begin(), coords.end());
    bool res = true;
    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);
    }

    if (!res) return 0;

    
    // int maxY = 0;
    // for (int i = 0; i < y.size(); i++) maxY = max(maxY, y[i]);

    // vvi mat(maxY/2-1, vi(3)), matIdx(maxY/2-1, vi(3));
    // for (int i = 0; i < x.size(); i++) {
    //     mat[x[i]/2-1][y[i]/2-1] = 1;
    //     matIdx[x[i]/2-1][y[i]/2-1] = i;
    // }



    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 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 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 1 ms 212 KB Output is correct
23 Correct 162 ms 24700 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 60 ms 10748 KB Output is correct
29 Correct 90 ms 16028 KB Output is correct
30 Correct 134 ms 21116 KB Output is correct
31 Correct 199 ms 26352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 85 ms 10776 KB Output is correct
46 Correct 98 ms 15532 KB Output is correct
47 Correct 105 ms 15532 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 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 1 ms 212 KB Output is correct
23 Correct 162 ms 24700 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 60 ms 10748 KB Output is correct
29 Correct 90 ms 16028 KB Output is correct
30 Correct 134 ms 21116 KB Output is correct
31 Correct 199 ms 26352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 85 ms 10776 KB Output is correct
46 Correct 98 ms 15532 KB Output is correct
47 Correct 105 ms 15532 KB Output is correct
48 Incorrect 1 ms 212 KB Tree @(5, 3) appears more than once: for edges on positions 1 and 2
49 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 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Incorrect 1 ms 212 KB Tree @(199999, 199999) appears more than once: for edges on positions 0 and 1
19 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 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct
17 Incorrect 87 ms 12540 KB Solution announced impossible, but it is possible.
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 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 60 ms 10144 KB Output is correct
10 Correct 5 ms 1492 KB Output is correct
11 Correct 28 ms 5708 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 13 ms 3208 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 58 ms 10208 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 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 1 ms 212 KB Output is correct
23 Correct 162 ms 24700 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 60 ms 10748 KB Output is correct
29 Correct 90 ms 16028 KB Output is correct
30 Correct 134 ms 21116 KB Output is correct
31 Correct 199 ms 26352 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 85 ms 10776 KB Output is correct
46 Correct 98 ms 15532 KB Output is correct
47 Correct 105 ms 15532 KB Output is correct
48 Incorrect 1 ms 212 KB Tree @(5, 3) appears more than once: for edges on positions 1 and 2
49 Halted 0 ms 0 KB -