oj.uz

Submission #443441

# Submission time Handle Problem Language Result Execution time Memory
443441 2021-07-10T13:43:04 Z mjhmjh1104 Fountain Parks (IOI21_parks) C++17
30 / 100
 639 ms 41848 KB 
#include "parks.h"
#include <map>
#include <set>
#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++) points.push_back(i);
    sort(points.begin(), points.end(), [&](const int &a, const int &b) {
        return y[a] < y[b];
    });
    for (int t = 0; t < n; 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;
    for (auto &i: edges) {
        if (x[i.first] == 2 && x[i.second] == 2) {
            u.push_back(i.first);
            v.push_back(i.second);
            a.push_back(1);
            b.push_back((y[i.first] + y[i.second]) / 2);
            s.insert({ a.back(), b.back() });
        } else if (x[i.first] == 6 && x[i.second] == 6) {
            u.push_back(i.first);
            v.push_back(i.second);
            a.push_back(7);
            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 (min(y[a.first], y[a.second]) != min(y[b.first], y[b.second])) return min(y[a.first], y[a.second]) < min(y[b.first], y[b.second]);
        return min(x[a.first], x[a.second]) < min(x[b.first], x[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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 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 634 ms 40172 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 169 ms 16156 KB Output is correct
29 Correct 281 ms 23900 KB Output is correct
30 Correct 419 ms 32404 KB Output is correct
31 Correct 620 ms 40180 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 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 3 ms 588 KB Output is correct
45 Correct 222 ms 19748 KB Output is correct
46 Correct 345 ms 29416 KB Output is correct
47 Correct 361 ms 29364 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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 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 634 ms 40172 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 169 ms 16156 KB Output is correct
29 Correct 281 ms 23900 KB Output is correct
30 Correct 419 ms 32404 KB Output is correct
31 Correct 620 ms 40180 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 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 3 ms 588 KB Output is correct
45 Correct 222 ms 19748 KB Output is correct
46 Correct 345 ms 29416 KB Output is correct
47 Correct 361 ms 29364 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 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 639 ms 41236 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 10 ms 1548 KB Output is correct
59 Correct 10 ms 1324 KB Output is correct
60 Correct 222 ms 20568 KB Output is correct
61 Correct 348 ms 29084 KB Output is correct
62 Correct 495 ms 34576 KB Output is correct
63 Correct 612 ms 41476 KB Output is correct
64 Correct 0 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 584 ms 40880 KB Output is correct
68 Correct 557 ms 40912 KB Output is correct
69 Correct 587 ms 40700 KB Output is correct
70 Correct 4 ms 600 KB Output is correct
71 Correct 7 ms 1100 KB Output is correct
72 Correct 219 ms 20504 KB Output is correct
73 Correct 372 ms 31384 KB Output is correct
74 Correct 578 ms 41056 KB Output is correct
75 Correct 558 ms 41180 KB Output is correct
76 Correct 557 ms 40868 KB Output is correct
77 Correct 5 ms 844 KB Output is correct
78 Correct 9 ms 1228 KB Output is correct
79 Correct 259 ms 20796 KB Output is correct
80 Correct 399 ms 31148 KB Output is correct
81 Correct 541 ms 41848 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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 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 Incorrect 505 ms 33464 KB Solution announced impossible, but it is possible.
21 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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 KB Output is correct
17 Correct 586 ms 39200 KB Output is correct
18 Correct 563 ms 39480 KB Output is correct
19 Incorrect 465 ms 27348 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 0 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 213 ms 19608 KB Output is correct
10 Correct 12 ms 2464 KB Output is correct
11 Correct 70 ms 11284 KB Output is correct
12 Correct 18 ms 3548 KB Output is correct
13 Correct 33 ms 5028 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 233 ms 19708 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 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 634 ms 40172 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 169 ms 16156 KB Output is correct
29 Correct 281 ms 23900 KB Output is correct
30 Correct 419 ms 32404 KB Output is correct
31 Correct 620 ms 40180 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 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 3 ms 588 KB Output is correct
45 Correct 222 ms 19748 KB Output is correct
46 Correct 345 ms 29416 KB Output is correct
47 Correct 361 ms 29364 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 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 639 ms 41236 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 10 ms 1548 KB Output is correct
59 Correct 10 ms 1324 KB Output is correct
60 Correct 222 ms 20568 KB Output is correct
61 Correct 348 ms 29084 KB Output is correct
62 Correct 495 ms 34576 KB Output is correct
63 Correct 612 ms 41476 KB Output is correct
64 Correct 0 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 584 ms 40880 KB Output is correct
68 Correct 557 ms 40912 KB Output is correct
69 Correct 587 ms 40700 KB Output is correct
70 Correct 4 ms 600 KB Output is correct
71 Correct 7 ms 1100 KB Output is correct
72 Correct 219 ms 20504 KB Output is correct
73 Correct 372 ms 31384 KB Output is correct
74 Correct 578 ms 41056 KB Output is correct
75 Correct 558 ms 41180 KB Output is correct
76 Correct 557 ms 40868 KB Output is correct
77 Correct 5 ms 844 KB Output is correct
78 Correct 9 ms 1228 KB Output is correct
79 Correct 259 ms 20796 KB Output is correct
80 Correct 399 ms 31148 KB Output is correct
81 Correct 541 ms 41848 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 Incorrect 505 ms 33464 KB Solution announced impossible, but it is possible.
86 Halted 0 ms 0 KB -