oj.uz

Submission #639645

# Submission time Handle Problem Language Result Execution time Memory
639645 2022-09-10T19:03:56 Z piOOE Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 252 ms 18368 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    s.push_back(1e9 + 228);
    t.push_back(0);

    vector<int> x(s.begin(), s.end());
    x.insert(x.end(), t.begin(), t.end());
    sort(x.begin(), x.end());
    x.resize(unique(x.begin(), x.end()) - x.begin());

    const int n = s.size(), m = x.size();

    vector<int> b(m), p(m);

    iota(p.begin(), p.end(), 0);

    auto get = [&](int x) {
        while (x != p[x]) x = p[x] = p[p[x]];
        return x;
    };

    auto unite = [&](int a, int b) {
        a = get(a), b = get(b);
        if (a == b) return false;
        p[b] = a;
        return true;
    };

    for (int i = 0; i < n; ++i) {
        int S = lower_bound(x.begin(), x.end(), s[i]) - x.begin();
        int T = lower_bound(x.begin(), x.end(), t[i]) - x.begin();
        ++b[S];
        --b[T];
        unite(S, T);
    }

    vector<array<int, 3>> edges;

    long long ans = 0;
    int balance = 0;
    for (int i = 0; i < m; ++i) {
        if (balance != 0) {
            ans += 1LL * (x[i] - x[i - 1]) * max(0, balance);
            unite(i, i - 1);
        }
        balance += b[i];
        if (i > 0) {
            edges.push_back({x[i] - x[i - 1], i, i - 1});
        }
    }

    sort(edges.begin(), edges.end());
    for (auto [w, u, v]: edges) {
        if (unite(u, v)) {
            ans += w;
        }
    }

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 300 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 300 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 300 KB n = 8
22 Correct 1 ms 296 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 300 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 300 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 300 KB n = 8
22 Correct 1 ms 296 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 300 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 212 KB n = 16
35 Correct 1 ms 300 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 296 KB n = 9
41 Correct 1 ms 304 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 1 ms 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 1 ms 304 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 18288 KB n = 199999
2 Correct 252 ms 18332 KB n = 199991
3 Correct 202 ms 18196 KB n = 199993
4 Correct 152 ms 15772 KB n = 152076
5 Correct 98 ms 9192 KB n = 93249
6 Correct 200 ms 16528 KB n = 199910
7 Correct 196 ms 17448 KB n = 199999
8 Correct 206 ms 16608 KB n = 199997
9 Correct 186 ms 17048 KB n = 171294
10 Correct 142 ms 15456 KB n = 140872
11 Correct 210 ms 16668 KB n = 199886
12 Correct 202 ms 17564 KB n = 199996
13 Correct 183 ms 16796 KB n = 200000
14 Correct 220 ms 17428 KB n = 199998
15 Correct 192 ms 17388 KB n = 200000
16 Correct 194 ms 17792 KB n = 199998
17 Correct 190 ms 18216 KB n = 200000
18 Correct 202 ms 18316 KB n = 190000
19 Correct 167 ms 17548 KB n = 177777
20 Correct 95 ms 9368 KB n = 100000
21 Correct 225 ms 18288 KB n = 200000
22 Correct 194 ms 18368 KB n = 200000
23 Correct 189 ms 18200 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 300 KB n = 3
10 Correct 0 ms 340 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 300 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 300 KB n = 8
22 Correct 1 ms 296 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 300 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 212 KB n = 16
35 Correct 1 ms 300 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 296 KB n = 9
41 Correct 1 ms 304 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 1 ms 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 1 ms 304 KB n = 16
49 Correct 211 ms 18288 KB n = 199999
50 Correct 252 ms 18332 KB n = 199991
51 Correct 202 ms 18196 KB n = 199993
52 Correct 152 ms 15772 KB n = 152076
53 Correct 98 ms 9192 KB n = 93249
54 Correct 200 ms 16528 KB n = 199910
55 Correct 196 ms 17448 KB n = 199999
56 Correct 206 ms 16608 KB n = 199997
57 Correct 186 ms 17048 KB n = 171294
58 Correct 142 ms 15456 KB n = 140872
59 Correct 210 ms 16668 KB n = 199886
60 Correct 202 ms 17564 KB n = 199996
61 Correct 183 ms 16796 KB n = 200000
62 Correct 220 ms 17428 KB n = 199998
63 Correct 192 ms 17388 KB n = 200000
64 Correct 194 ms 17792 KB n = 199998
65 Correct 190 ms 18216 KB n = 200000
66 Correct 202 ms 18316 KB n = 190000
67 Correct 167 ms 17548 KB n = 177777
68 Correct 95 ms 9368 KB n = 100000
69 Correct 225 ms 18288 KB n = 200000
70 Correct 194 ms 18368 KB n = 200000
71 Correct 189 ms 18200 KB n = 200000
72 Correct 236 ms 18200 KB n = 200000
73 Correct 220 ms 18228 KB n = 200000
74 Correct 214 ms 18296 KB n = 200000
75 Correct 183 ms 18216 KB n = 200000
76 Correct 195 ms 18296 KB n = 200000
77 Correct 170 ms 13588 KB n = 200000
78 Correct 150 ms 13612 KB n = 200000
79 Correct 210 ms 17756 KB n = 184307
80 Correct 76 ms 8192 KB n = 76040
81 Correct 183 ms 16664 KB n = 199981
82 Correct 205 ms 17696 KB n = 199994
83 Correct 196 ms 16816 KB n = 199996
84 Correct 200 ms 17424 KB n = 199998
85 Correct 200 ms 17312 KB n = 200000
86 Correct 203 ms 17820 KB n = 199998
87 Correct 192 ms 18292 KB n = 200000
88 Correct 204 ms 18312 KB n = 200000
89 Correct 191 ms 18324 KB n = 200000
90 Correct 204 ms 18240 KB n = 200000
91 Correct 225 ms 18228 KB n = 200000
92 Correct 219 ms 18228 KB n = 200000