oj.uz

답안 #698499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698499 2023-02-13T15:53:09 Z qwerasdfzxcl Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 174 ms 15084 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
struct DSU{
    int path[400400];
    void init(int n){for (int i=0;i<=n;i++) path[i] = i;}
    int find(int s){
        if (s==path[s]) return s;
        return path[s] = find(path[s]);
    }
    bool merge(int s, int v){
        s = find(s), v = find(v);
        if (s==v) return 0;
        path[s] = v;
        return 1;
    }
}dsu;
int n, deg[400400];
vector<int> a;

long long plan_roller_coaster(std::vector<int> S, std::vector<int> T) {
    n = S.size();
    a.push_back(1);
    a.push_back(1e9+100);

    for (int i=0;i<n;i++) {a.push_back(S[i]); a.push_back(T[i]);}
    sort(a.begin(), a.end());
    a.erase(unique(a.begin(), a.end()), a.end());
    dsu.init(a.size());

    for (int i=0;i<n;i++){
        int x = lower_bound(a.begin(), a.end(), S[i]) - a.begin();
        int y = lower_bound(a.begin(), a.end(), T[i]) - a.begin();

        deg[x]++;
        deg[y]--;
        dsu.merge(x, y);
    }

    ll ans = 0;
    for (int i=0;i<(int)a.size()-1;i++){
        //printf("%d -> %d\n", a[i], deg[i]);

        int target = i?0:1;
        if (deg[i]!=target) dsu.merge(i, i+1);

        ans += (deg[i] > target)?((ll)(deg[i]-target)*(a[i+1] - a[i])):0LL;
        deg[i+1] += deg[i] - target;
        deg[i] -= deg[i] - target;
    }

    vector<pair<int, int>> E;
    for (int i=0;i<(int)a.size()-1;i++) if (dsu.find(i) != dsu.find(i+1)){
        E.emplace_back(a[i+1] - a[i], i);
    }

    sort(E.begin(), E.end());
    for (auto &[x, y]:E) if (dsu.merge(y, y+1)) ans += x;

    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 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 1 ms 212 KB n = 8
13 Correct 1 ms 308 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 308 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 312 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 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 1 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 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 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 1 ms 212 KB n = 8
13 Correct 1 ms 308 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 308 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 312 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 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 308 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 0 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 312 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 0 ms 308 KB n = 15
37 Correct 0 ms 304 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 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 1 ms 312 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 1 ms 312 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 12092 KB n = 199999
2 Correct 157 ms 12088 KB n = 199991
3 Correct 160 ms 12068 KB n = 199993
4 Correct 114 ms 9008 KB n = 152076
5 Correct 67 ms 5804 KB n = 93249
6 Correct 134 ms 10420 KB n = 199910
7 Correct 154 ms 11824 KB n = 199999
8 Correct 138 ms 10876 KB n = 199997
9 Correct 135 ms 10328 KB n = 171294
10 Correct 104 ms 8668 KB n = 140872
11 Correct 135 ms 10556 KB n = 199886
12 Correct 136 ms 11836 KB n = 199996
13 Correct 133 ms 11056 KB n = 200000
14 Correct 136 ms 13488 KB n = 199998
15 Correct 141 ms 12860 KB n = 200000
16 Correct 144 ms 13244 KB n = 199998
17 Correct 135 ms 14652 KB n = 200000
18 Correct 138 ms 11620 KB n = 190000
19 Correct 121 ms 13200 KB n = 177777
20 Correct 68 ms 6176 KB n = 100000
21 Correct 142 ms 12140 KB n = 200000
22 Correct 168 ms 15084 KB n = 200000
23 Correct 149 ms 12092 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 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 1 ms 212 KB n = 8
13 Correct 1 ms 308 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 ms 308 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 312 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 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 308 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 0 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 312 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 0 ms 308 KB n = 15
37 Correct 0 ms 304 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 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 1 ms 312 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 1 ms 312 KB n = 16
49 Correct 151 ms 12092 KB n = 199999
50 Correct 157 ms 12088 KB n = 199991
51 Correct 160 ms 12068 KB n = 199993
52 Correct 114 ms 9008 KB n = 152076
53 Correct 67 ms 5804 KB n = 93249
54 Correct 134 ms 10420 KB n = 199910
55 Correct 154 ms 11824 KB n = 199999
56 Correct 138 ms 10876 KB n = 199997
57 Correct 135 ms 10328 KB n = 171294
58 Correct 104 ms 8668 KB n = 140872
59 Correct 135 ms 10556 KB n = 199886
60 Correct 136 ms 11836 KB n = 199996
61 Correct 133 ms 11056 KB n = 200000
62 Correct 136 ms 13488 KB n = 199998
63 Correct 141 ms 12860 KB n = 200000
64 Correct 144 ms 13244 KB n = 199998
65 Correct 135 ms 14652 KB n = 200000
66 Correct 138 ms 11620 KB n = 190000
67 Correct 121 ms 13200 KB n = 177777
68 Correct 68 ms 6176 KB n = 100000
69 Correct 142 ms 12140 KB n = 200000
70 Correct 168 ms 15084 KB n = 200000
71 Correct 149 ms 12092 KB n = 200000
72 Correct 153 ms 12092 KB n = 200000
73 Correct 160 ms 12140 KB n = 200000
74 Correct 161 ms 12088 KB n = 200000
75 Correct 143 ms 12092 KB n = 200000
76 Correct 148 ms 12088 KB n = 200000
77 Correct 124 ms 13104 KB n = 200000
78 Correct 147 ms 13496 KB n = 200000
79 Correct 147 ms 10940 KB n = 184307
80 Correct 55 ms 4848 KB n = 76040
81 Correct 135 ms 10432 KB n = 199981
82 Correct 142 ms 11828 KB n = 199994
83 Correct 129 ms 11072 KB n = 199996
84 Correct 139 ms 13472 KB n = 199998
85 Correct 143 ms 12848 KB n = 200000
86 Correct 141 ms 13280 KB n = 199998
87 Correct 133 ms 14652 KB n = 200000
88 Correct 139 ms 12660 KB n = 200000
89 Correct 143 ms 14780 KB n = 200000
90 Correct 146 ms 12092 KB n = 200000
91 Correct 174 ms 15044 KB n = 200000
92 Correct 148 ms 12072 KB n = 200000