oj.uz

Submission #443473

# Submission time Handle Problem Language Result Execution time Memory
443473 2021-07-10T14:55:56 Z mjhmjh1104 Fountain Parks (IOI21_parks) C++17
30 / 100
 894 ms 40932 KB 
#include "parks.h"
#include <map>
#include <set>
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

int uf[200006];

int _find(int x) {
    if (uf[x] == -1) return x;
    return uf[x] = _find(uf[x]);
}

void _merge(int x, int y) {
    x = _find(x), y = _find(y);
    if (x != y) uf[x] = y;
}

map<pair<int, int>, int> m;
set<pair<int, int>> s;

int construct_roads(vector<int> x, vector<int> y) {
    if ((int)x.size() == 1) return build({}, {}, {}, {}), 1;
    int n = (int)x.size();
    for (int i = 0; i < n; i++) uf[i] = -1;
    vector<int> u, v, a, b;
    vector<pair<int, int>> edges, n_edges;
    vector<int> points;
    for (int i = 0; i < n; i++) m[{ x[i], y[i] }] = i;
    for (int i = 0; i < n; i++) if (m.count({ x[i], y[i] - 2 })) {
        edges.push_back({ m[{ x[i], y[i] - 2 }], i });
        _merge(edges.back().first, edges.back().second);
    }
    for (int i = 0; i < n; i++) if (!m.count({ x[i], y[i] - 2 }) || !m.count({ x[i], y[i] + 2 })) points.push_back(i);
    sort(points.begin(), points.end(), [&](const int &a, const int &b) {
        if (y[a] != y[b]) return y[a] < y[b];
        return x[a] < x[b];
    });
    for (int t = 0; t < (int)points.size(); t++) {
        int i = points[t];
        if (m.count({ x[i] - 2, y[i] })) {
            int t = m[{ x[i] - 2, y[i] }];
            if (_find(t) != _find(i)) {
                edges.push_back({ t, i });
                _merge(t, i);
            }
        }
    }
    for (int t = 0; t < (int)points.size(); t++) {
        int i = points[t];
        if (m.count({ x[i] + 2, y[i] })) {
            int t = m[{ x[i] + 2, y[i] }];
            if (_find(t) != _find(i)) {
                edges.push_back({ t, i });
                _merge(t, i);
            }
        }
    }
    for (int i = 1; i < n; i++) if (_find(0) != _find(i)) return 0;
    //int min_x = *min_element(x.begin(), x.end()), max_x = *max_element(x.begin(), x.end());
    for (auto &i: edges) {
        /*if (x[i.first] == x[i.second]) {
            u.push_back(i.first);
            v.push_back(i.second);
            a.push_back(x[i.first] - 1);
            b.push_back((y[i.first] + y[i.second]) / 2);
            s.insert({ a.back(), b.back() });
        } else*/ n_edges.push_back(i);
    }
    sort(n_edges.begin(), n_edges.end(), [&](const pair<int, int> &a, const pair<int, int> &b) {
        if (x[a.first] + x[a.second] != x[b.first] + x[b.second]) return x[a.first] + x[a.second] < x[b.first] + x[b.second];
        return y[a.first] + y[a.second] < y[b.first] + y[b.second];
    });
    for (auto &i: n_edges) {
        if (x[i.first] == x[i.second]) {
            if (!s.count({ x[i.first] - 1, (y[i.first] + y[i.second]) / 2 })) {
                s.insert({ x[i.first] - 1, (y[i.first] + y[i.second]) / 2 });
                u.push_back(i.first);
                v.push_back(i.second);
                a.push_back(x[i.first] - 1);
                b.push_back((y[i.first] + y[i.second]) / 2);
            } else {
                if (s.count({ x[i.first] + 1, (y[i.first] + y[i.second]) / 2 })) return 0;
                s.insert({ x[i.first] + 1, (y[i.first] + y[i.second]) / 2 });
                u.push_back(i.first);
                v.push_back(i.second);
                a.push_back(x[i.first] + 1);
                b.push_back((y[i.first] + y[i.second]) / 2);
            }
        } else {
            if (!s.count({ (x[i.first] + x[i.second]) / 2, y[i.first] - 1 })) {
                s.insert({ (x[i.first] + x[i.second]) / 2, y[i.first] - 1 });
                u.push_back(i.first);
                v.push_back(i.second);
                a.push_back((x[i.first] + x[i.second]) / 2);
                b.push_back(y[i.first] - 1);
            } else {
                if (s.count({ (x[i.first] + x[i.second]) / 2, y[i.first] + 1 })) return 0;
                s.insert({ (x[i.first] + x[i.second]) / 2, y[i.first] + 1 });
                u.push_back(i.first);
                v.push_back(i.second);
                a.push_back((x[i.first] + x[i.second]) / 2);
                b.push_back(y[i.first] + 1);
            }
        }
    }
    build(u, v, a, b);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 839 ms 38820 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 4 ms 668 KB Output is correct
28 Correct 238 ms 15816 KB Output is correct
29 Correct 334 ms 23344 KB Output is correct
30 Correct 511 ms 31292 KB Output is correct
31 Correct 702 ms 38840 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 345 ms 19912 KB Output is correct
46 Correct 529 ms 29320 KB Output is correct
47 Correct 534 ms 29436 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 839 ms 38820 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 4 ms 668 KB Output is correct
28 Correct 238 ms 15816 KB Output is correct
29 Correct 334 ms 23344 KB Output is correct
30 Correct 511 ms 31292 KB Output is correct
31 Correct 702 ms 38840 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 345 ms 19912 KB Output is correct
46 Correct 529 ms 29320 KB Output is correct
47 Correct 534 ms 29436 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 712 ms 38912 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 10 ms 1484 KB Output is correct
59 Correct 14 ms 1220 KB Output is correct
60 Correct 270 ms 19524 KB Output is correct
61 Correct 424 ms 27580 KB Output is correct
62 Correct 554 ms 32248 KB Output is correct
63 Correct 686 ms 39012 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 726 ms 38896 KB Output is correct
68 Correct 656 ms 38860 KB Output is correct
69 Correct 663 ms 38600 KB Output is correct
70 Correct 4 ms 588 KB Output is correct
71 Correct 9 ms 972 KB Output is correct
72 Correct 293 ms 19772 KB Output is correct
73 Correct 486 ms 29876 KB Output is correct
74 Correct 759 ms 39352 KB Output is correct
75 Correct 718 ms 39004 KB Output is correct
76 Correct 682 ms 38792 KB Output is correct
77 Correct 6 ms 716 KB Output is correct
78 Correct 10 ms 1136 KB Output is correct
79 Correct 277 ms 19704 KB Output is correct
80 Correct 514 ms 29868 KB Output is correct
81 Correct 709 ms 39236 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 745 ms 39652 KB Output is correct
21 Correct 780 ms 40932 KB Output is correct
22 Correct 745 ms 39600 KB Output is correct
23 Correct 586 ms 34424 KB Output is correct
24 Correct 515 ms 17860 KB Output is correct
25 Correct 760 ms 19648 KB Output is correct
26 Correct 527 ms 18872 KB Output is correct
27 Correct 697 ms 38900 KB Output is correct
28 Correct 785 ms 38832 KB Output is correct
29 Correct 857 ms 39616 KB Output is correct
30 Correct 894 ms 39576 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 25 ms 1732 KB Solution announced impossible, but it is possible.
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct
17 Correct 860 ms 40024 KB Output is correct
18 Correct 812 ms 39668 KB Output is correct
19 Incorrect 815 ms 34056 KB Solution announced impossible, but it is possible.
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 324 ms 19544 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 86 ms 11288 KB Output is correct
12 Correct 27 ms 3544 KB Output is correct
13 Correct 49 ms 4732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 256 ms 19488 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 839 ms 38820 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 4 ms 668 KB Output is correct
28 Correct 238 ms 15816 KB Output is correct
29 Correct 334 ms 23344 KB Output is correct
30 Correct 511 ms 31292 KB Output is correct
31 Correct 702 ms 38840 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 345 ms 19912 KB Output is correct
46 Correct 529 ms 29320 KB Output is correct
47 Correct 534 ms 29436 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 712 ms 38912 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 10 ms 1484 KB Output is correct
59 Correct 14 ms 1220 KB Output is correct
60 Correct 270 ms 19524 KB Output is correct
61 Correct 424 ms 27580 KB Output is correct
62 Correct 554 ms 32248 KB Output is correct
63 Correct 686 ms 39012 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 726 ms 38896 KB Output is correct
68 Correct 656 ms 38860 KB Output is correct
69 Correct 663 ms 38600 KB Output is correct
70 Correct 4 ms 588 KB Output is correct
71 Correct 9 ms 972 KB Output is correct
72 Correct 293 ms 19772 KB Output is correct
73 Correct 486 ms 29876 KB Output is correct
74 Correct 759 ms 39352 KB Output is correct
75 Correct 718 ms 39004 KB Output is correct
76 Correct 682 ms 38792 KB Output is correct
77 Correct 6 ms 716 KB Output is correct
78 Correct 10 ms 1136 KB Output is correct
79 Correct 277 ms 19704 KB Output is correct
80 Correct 514 ms 29868 KB Output is correct
81 Correct 709 ms 39236 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 0 ms 204 KB Output is correct
84 Correct 0 ms 204 KB Output is correct
85 Correct 745 ms 39652 KB Output is correct
86 Correct 780 ms 40932 KB Output is correct
87 Correct 745 ms 39600 KB Output is correct
88 Correct 586 ms 34424 KB Output is correct
89 Correct 515 ms 17860 KB Output is correct
90 Correct 760 ms 19648 KB Output is correct
91 Correct 527 ms 18872 KB Output is correct
92 Correct 697 ms 38900 KB Output is correct
93 Correct 785 ms 38832 KB Output is correct
94 Correct 857 ms 39616 KB Output is correct
95 Correct 894 ms 39576 KB Output is correct
96 Correct 0 ms 204 KB Output is correct
97 Incorrect 25 ms 1732 KB Solution announced impossible, but it is possible.
98 Halted 0 ms 0 KB -