oj.uz

답안 #559171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559171 2022-05-09T12:58:45 Z elazarkoren Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 241 ms 21936 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int infinity = 2e9;
const int MAX_N = 2e5 + 5;

vi vals;
inline int Val(int x) {
    return lower_bound(all(vals), x) - vals.begin();
}

int add[2 * MAX_N];

struct Dsu {
    vi par, sz;
    Dsu() {}
    Dsu(int n) {
        par.resize(n), sz.resize(n, 1);
        iota(all(par), 0);
    }
    int Find(int i) {
        return par[i] == i ? i : par[i] = Find(par[i]);
    }
    bool Union(int a, int b) {
        int pa = Find(a), pb = Find(b);
        if (pa == pb) return false;
        if (sz[pa] < sz[pb]) swap(pa, pb);
        par[pb] = pa;
        sz[pa] += sz[pb];
        return true;
    }
};

ll plan_roller_coaster(vi s, vi t) {
    int n = s.size();
    s.push_back(infinity), t.push_back(0);
    for (int i = 0; i <= n; i++) vals.push_back(s[i]), vals.push_back(t[i]);
    sort(all(vals));
    vals.erase(unique(all(vals)), vals.end());
    for (int &x : s) {
        x = Val(x);
        add[x]++;
    }
    for (int &x : t) {
        x = Val(x);
        add[x]--;
    }
    int sz = vals.size();
    Dsu dsu(sz);
    for (int i = 0; i <= n; i++) dsu.Union(s[i], t[i]);
    ll ans = 0;
    for (int i = 0, balance = 0; i < sz; i++) {
        balance += add[i];
        if (balance > 0) ans += ll(balance) * (vals[i + 1] - vals[i]);
        if (balance) dsu.Union(i, i + 1);
    }
    vector<pair<ll, pii>> edges;
    for (int i = 0; i < sz - 1; i++) {
        edges.push_back({vals[i + 1] - vals[i], {i, i + 1}});
    }
    sort(all(edges));
    for (auto [x, p] : edges) {
        ans += x * dsu.Union(p.x, p.y);
    }
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 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 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 224 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 0 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 0 ms 212 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 17972 KB n = 199999
2 Correct 198 ms 17964 KB n = 199991
3 Correct 192 ms 17956 KB n = 199993
4 Correct 145 ms 15800 KB n = 152076
5 Correct 87 ms 8996 KB n = 93249
6 Correct 174 ms 17176 KB n = 199910
7 Correct 189 ms 17944 KB n = 199999
8 Correct 177 ms 17200 KB n = 199997
9 Correct 172 ms 16700 KB n = 171294
10 Correct 136 ms 15276 KB n = 140872
11 Correct 181 ms 17192 KB n = 199886
12 Correct 194 ms 17976 KB n = 199996
13 Correct 191 ms 17488 KB n = 200000
14 Correct 195 ms 17956 KB n = 199998
15 Correct 190 ms 17788 KB n = 200000
16 Correct 199 ms 17940 KB n = 199998
17 Correct 185 ms 17976 KB n = 200000
18 Correct 199 ms 17576 KB n = 190000
19 Correct 164 ms 17020 KB n = 177777
20 Correct 102 ms 9240 KB n = 100000
21 Correct 195 ms 18032 KB n = 200000
22 Correct 194 ms 17964 KB n = 200000
23 Correct 199 ms 18088 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 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 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 224 KB n = 8
17 Correct 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 0 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 0 ms 212 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 198 ms 17972 KB n = 199999
50 Correct 198 ms 17964 KB n = 199991
51 Correct 192 ms 17956 KB n = 199993
52 Correct 145 ms 15800 KB n = 152076
53 Correct 87 ms 8996 KB n = 93249
54 Correct 174 ms 17176 KB n = 199910
55 Correct 189 ms 17944 KB n = 199999
56 Correct 177 ms 17200 KB n = 199997
57 Correct 172 ms 16700 KB n = 171294
58 Correct 136 ms 15276 KB n = 140872
59 Correct 181 ms 17192 KB n = 199886
60 Correct 194 ms 17976 KB n = 199996
61 Correct 191 ms 17488 KB n = 200000
62 Correct 195 ms 17956 KB n = 199998
63 Correct 190 ms 17788 KB n = 200000
64 Correct 199 ms 17940 KB n = 199998
65 Correct 185 ms 17976 KB n = 200000
66 Correct 199 ms 17576 KB n = 190000
67 Correct 164 ms 17020 KB n = 177777
68 Correct 102 ms 9240 KB n = 100000
69 Correct 195 ms 18032 KB n = 200000
70 Correct 194 ms 17964 KB n = 200000
71 Correct 199 ms 18088 KB n = 200000
72 Correct 196 ms 17972 KB n = 200000
73 Correct 202 ms 17956 KB n = 200000
74 Correct 194 ms 17972 KB n = 200000
75 Correct 198 ms 21936 KB n = 200000
76 Correct 199 ms 21816 KB n = 200000
77 Correct 160 ms 15648 KB n = 200000
78 Correct 159 ms 15404 KB n = 200000
79 Correct 189 ms 20648 KB n = 184307
80 Correct 73 ms 9480 KB n = 76040
81 Correct 180 ms 20000 KB n = 199981
82 Correct 195 ms 21156 KB n = 199994
83 Correct 200 ms 20272 KB n = 199996
84 Correct 212 ms 21024 KB n = 199998
85 Correct 207 ms 20844 KB n = 200000
86 Correct 213 ms 21416 KB n = 199998
87 Correct 207 ms 21836 KB n = 200000
88 Correct 210 ms 21896 KB n = 200000
89 Correct 201 ms 21848 KB n = 200000
90 Correct 218 ms 21836 KB n = 200000
91 Correct 229 ms 21828 KB n = 200000
92 Correct 241 ms 21844 KB n = 200000