oj.uz

답안 #536142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536142 2022-03-12T13:01:28 Z KoD Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 271 ms 18388 KB 
#include <bits/stdc++.h>
#include "railroad.h"

using ll = long long;

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int dedup(vector<int>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());
    return v.size();
}

int lowb(const vector<int>& v, const int x) {
    return std::lower_bound(v.begin(), v.end(), x) - v.begin();
}

struct union_find {
    vector<int> par;
    explicit union_find(const int n) : par(n, -1) {}
    int find(const int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }
    bool merge(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (par[x] > par[y]) std::swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }
};

ll plan_roller_coaster(vector<int> s, vector<int> t) {
    const int n = s.size();
    vector<int> cx;
    cx.reserve(2 * n + 2);
    cx.push_back(0);
    cx.push_back(1000000001);
    std::copy(s.begin(), s.end(), std::back_inserter(cx));
    std::copy(t.begin(), t.end(), std::back_inserter(cx));
    const int m = dedup(cx);
    vector<int> coeff(m);
    coeff[0] -= 1;
    coeff[m - 1] += 1;
    union_find dsu(m);
    for (int i = 0; i < n; ++i) {
        const int a = lowb(cx, s[i]);
        const int b = lowb(cx, t[i]);
        coeff[a] += 1;
        coeff[b] -= 1;
        dsu.merge(a, b);
    }
    ll cur = 0, ret = 0;
    vector<tuple<int, int, int>> edge;
    for (int i = 0; i < m; ++i) {
        if (i > 0) {
            if (cur != 0) dsu.merge(i - 1, i);
            if (cur > 0) ret += cur * (cx[i] - cx[i - 1]);
            edge.emplace_back(cx[i] - cx[i - 1], i - 1, i);
        } 
        cur += coeff[i];
    }
    std::sort(edge.begin(), edge.end());
    for (const auto& [c, u, v] : edge) {
        if (dsu.merge(u, v)) {
            ret += c;
        }
    }
    return ret;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 296 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 296 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 292 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 296 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 304 KB n = 8
16 Correct 1 ms 300 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 1 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 212 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 304 KB n = 8
24 Correct 1 ms 300 KB n = 8
25 Correct 1 ms 300 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 296 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 296 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 292 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 296 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 304 KB n = 8
16 Correct 1 ms 300 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 1 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 212 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 304 KB n = 8
24 Correct 1 ms 300 KB n = 8
25 Correct 1 ms 300 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 296 KB n = 8
28 Correct 1 ms 300 KB n = 8
29 Correct 1 ms 304 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 1 ms 292 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 212 KB n = 16
36 Correct 1 ms 300 KB n = 15
37 Correct 1 ms 300 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 296 KB n = 16
42 Correct 1 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 300 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 1 ms 304 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 271 ms 18220 KB n = 199999
2 Correct 232 ms 18212 KB n = 199991
3 Correct 252 ms 18256 KB n = 199993
4 Correct 176 ms 15136 KB n = 152076
5 Correct 96 ms 8944 KB n = 93249
6 Correct 216 ms 16544 KB n = 199910
7 Correct 241 ms 17468 KB n = 199999
8 Correct 186 ms 16564 KB n = 199997
9 Correct 222 ms 16436 KB n = 171294
10 Correct 179 ms 14808 KB n = 140872
11 Correct 202 ms 16572 KB n = 199886
12 Correct 213 ms 17568 KB n = 199996
13 Correct 227 ms 16784 KB n = 200000
14 Correct 218 ms 17388 KB n = 199998
15 Correct 245 ms 17228 KB n = 200000
16 Correct 221 ms 17776 KB n = 199998
17 Correct 222 ms 18216 KB n = 200000
18 Correct 211 ms 17856 KB n = 190000
19 Correct 184 ms 16924 KB n = 177777
20 Correct 106 ms 9380 KB n = 100000
21 Correct 237 ms 18192 KB n = 200000
22 Correct 236 ms 18220 KB n = 200000
23 Correct 229 ms 18388 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 296 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 296 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 292 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 296 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 304 KB n = 8
16 Correct 1 ms 300 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 1 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 212 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 304 KB n = 8
24 Correct 1 ms 300 KB n = 8
25 Correct 1 ms 300 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 296 KB n = 8
28 Correct 1 ms 300 KB n = 8
29 Correct 1 ms 304 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 1 ms 292 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 212 KB n = 16
36 Correct 1 ms 300 KB n = 15
37 Correct 1 ms 300 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 296 KB n = 16
42 Correct 1 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 300 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 1 ms 304 KB n = 16
49 Correct 271 ms 18220 KB n = 199999
50 Correct 232 ms 18212 KB n = 199991
51 Correct 252 ms 18256 KB n = 199993
52 Correct 176 ms 15136 KB n = 152076
53 Correct 96 ms 8944 KB n = 93249
54 Correct 216 ms 16544 KB n = 199910
55 Correct 241 ms 17468 KB n = 199999
56 Correct 186 ms 16564 KB n = 199997
57 Correct 222 ms 16436 KB n = 171294
58 Correct 179 ms 14808 KB n = 140872
59 Correct 202 ms 16572 KB n = 199886
60 Correct 213 ms 17568 KB n = 199996
61 Correct 227 ms 16784 KB n = 200000
62 Correct 218 ms 17388 KB n = 199998
63 Correct 245 ms 17228 KB n = 200000
64 Correct 221 ms 17776 KB n = 199998
65 Correct 222 ms 18216 KB n = 200000
66 Correct 211 ms 17856 KB n = 190000
67 Correct 184 ms 16924 KB n = 177777
68 Correct 106 ms 9380 KB n = 100000
69 Correct 237 ms 18192 KB n = 200000
70 Correct 236 ms 18220 KB n = 200000
71 Correct 229 ms 18388 KB n = 200000
72 Correct 264 ms 18264 KB n = 200000
73 Correct 227 ms 18284 KB n = 200000
74 Correct 241 ms 18216 KB n = 200000
75 Correct 218 ms 18252 KB n = 200000
76 Correct 262 ms 18268 KB n = 200000
77 Correct 192 ms 13616 KB n = 200000
78 Correct 177 ms 13628 KB n = 200000
79 Correct 224 ms 17088 KB n = 184307
80 Correct 99 ms 7964 KB n = 76040
81 Correct 202 ms 16580 KB n = 199981
82 Correct 209 ms 17556 KB n = 199994
83 Correct 213 ms 16804 KB n = 199996
84 Correct 207 ms 17396 KB n = 199998
85 Correct 208 ms 17336 KB n = 200000
86 Correct 215 ms 17708 KB n = 199998
87 Correct 212 ms 18348 KB n = 200000
88 Correct 214 ms 18216 KB n = 200000
89 Correct 192 ms 18212 KB n = 200000
90 Correct 196 ms 18236 KB n = 200000
91 Correct 191 ms 18208 KB n = 200000
92 Correct 199 ms 18260 KB n = 200000