oj.uz

Submission #443471

# Submission time Handle Problem Language Result Execution time Memory
443471 2021-07-10T14:53:48 Z mjhmjh1104 Fountain Parks (IOI21_parks) C++17
30 / 100
 673 ms 40940 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);
            }
        }
        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 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 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 606 ms 39672 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 588 KB Output is correct
28 Correct 200 ms 16148 KB Output is correct
29 Correct 321 ms 23872 KB Output is correct
30 Correct 455 ms 31932 KB Output is correct
31 Correct 614 ms 39612 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 3 ms 588 KB Output is correct
45 Correct 236 ms 20028 KB Output is correct
46 Correct 387 ms 29628 KB Output is correct
47 Correct 389 ms 29492 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 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 606 ms 39672 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 588 KB Output is correct
28 Correct 200 ms 16148 KB Output is correct
29 Correct 321 ms 23872 KB Output is correct
30 Correct 455 ms 31932 KB Output is correct
31 Correct 614 ms 39612 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 3 ms 588 KB Output is correct
45 Correct 236 ms 20028 KB Output is correct
46 Correct 387 ms 29628 KB Output is correct
47 Correct 389 ms 29492 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 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 642 ms 39716 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 11 ms 1608 KB Output is correct
59 Correct 11 ms 1228 KB Output is correct
60 Correct 270 ms 20008 KB Output is correct
61 Correct 412 ms 27964 KB Output is correct
62 Correct 532 ms 32948 KB Output is correct
63 Correct 614 ms 39584 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 591 ms 39736 KB Output is correct
68 Correct 565 ms 39740 KB Output is correct
69 Correct 560 ms 39476 KB Output is correct
70 Correct 5 ms 588 KB Output is correct
71 Correct 8 ms 972 KB Output is correct
72 Correct 252 ms 20076 KB Output is correct
73 Correct 407 ms 30384 KB Output is correct
74 Correct 594 ms 39740 KB Output is correct
75 Correct 596 ms 39616 KB Output is correct
76 Correct 554 ms 39644 KB Output is correct
77 Correct 5 ms 716 KB Output is correct
78 Correct 9 ms 1176 KB Output is correct
79 Correct 256 ms 20008 KB Output is correct
80 Correct 439 ms 30276 KB Output is correct
81 Correct 581 ms 39744 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 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 602 ms 40940 KB Output is correct
21 Correct 587 ms 39724 KB Output is correct
22 Correct 619 ms 40048 KB Output is correct
23 Correct 484 ms 33868 KB Output is correct
24 Correct 375 ms 17872 KB Output is correct
25 Correct 506 ms 19624 KB Output is correct
26 Correct 431 ms 20096 KB Output is correct
27 Correct 639 ms 39740 KB Output is correct
28 Correct 627 ms 39760 KB Output is correct
29 Correct 673 ms 39648 KB Output is correct
30 Correct 645 ms 39620 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 21 ms 1848 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 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 KB Output is correct
17 Correct 584 ms 39664 KB Output is correct
18 Correct 575 ms 39776 KB Output is correct
19 Incorrect 576 ms 33812 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 1 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 241 ms 20000 KB Output is correct
10 Correct 14 ms 2508 KB Output is correct
11 Correct 85 ms 11480 KB Output is correct
12 Correct 21 ms 3660 KB Output is correct
13 Correct 39 ms 5056 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 230 ms 19944 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 606 ms 39672 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 588 KB Output is correct
28 Correct 200 ms 16148 KB Output is correct
29 Correct 321 ms 23872 KB Output is correct
30 Correct 455 ms 31932 KB Output is correct
31 Correct 614 ms 39612 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 3 ms 588 KB Output is correct
45 Correct 236 ms 20028 KB Output is correct
46 Correct 387 ms 29628 KB Output is correct
47 Correct 389 ms 29492 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 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 642 ms 39716 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 11 ms 1608 KB Output is correct
59 Correct 11 ms 1228 KB Output is correct
60 Correct 270 ms 20008 KB Output is correct
61 Correct 412 ms 27964 KB Output is correct
62 Correct 532 ms 32948 KB Output is correct
63 Correct 614 ms 39584 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 591 ms 39736 KB Output is correct
68 Correct 565 ms 39740 KB Output is correct
69 Correct 560 ms 39476 KB Output is correct
70 Correct 5 ms 588 KB Output is correct
71 Correct 8 ms 972 KB Output is correct
72 Correct 252 ms 20076 KB Output is correct
73 Correct 407 ms 30384 KB Output is correct
74 Correct 594 ms 39740 KB Output is correct
75 Correct 596 ms 39616 KB Output is correct
76 Correct 554 ms 39644 KB Output is correct
77 Correct 5 ms 716 KB Output is correct
78 Correct 9 ms 1176 KB Output is correct
79 Correct 256 ms 20008 KB Output is correct
80 Correct 439 ms 30276 KB Output is correct
81 Correct 581 ms 39744 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 602 ms 40940 KB Output is correct
86 Correct 587 ms 39724 KB Output is correct
87 Correct 619 ms 40048 KB Output is correct
88 Correct 484 ms 33868 KB Output is correct
89 Correct 375 ms 17872 KB Output is correct
90 Correct 506 ms 19624 KB Output is correct
91 Correct 431 ms 20096 KB Output is correct
92 Correct 639 ms 39740 KB Output is correct
93 Correct 627 ms 39760 KB Output is correct
94 Correct 673 ms 39648 KB Output is correct
95 Correct 645 ms 39620 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Incorrect 21 ms 1848 KB Solution announced impossible, but it is possible.
98 Halted 0 ms 0 KB -