oj.uz

답안 #617446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617446 2022-08-01T11:22:29 Z MetalPower Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 145 ms 17940 KB 
#include <bits/stdc++.h>
using namespace std;

#include "railroad.h"

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second

const int MX = 2e5 + 10;

int N;
vector<pair<int, pii>> vec;

struct dsu{
    int p[MX];

    void init(){
        for(int i = 0; i < MX; i++) p[i] = i;
    }

    int f(int x){
        if(x == p[x]) return x;
        else return p[x] = f(p[x]);
    }

    bool Join(int u, int v){
        int fu = f(u), fv = f(v);
        if(fu == fv) return false;
        p[fu] = fv;
        return true;
    }
} D;

long long plan_roller_coaster(vector<int> s, vector<int> t) {

    D.init();
    N = s.size();

    for(int i = 0; i < N; i++){
        vec.push_back({s[i], {i, 1}});
        vec.push_back({t[i], {i, -1}});
    }
    vec.push_back({1000000000, {N + 1, 1}});
    vec.push_back({1, {N + 1, -1}});


    sort(vec.begin(), vec.end());

    // Let the values be on a line 
    // We will calculate how many times a distance is traversed

    // A distance is traversed optimally X times if there are X S values below this that do not have a T pair
    // However because we cannot pair ith S with the ith T
    // The T will be forced to pair with an S lower than this

    int numS = 0; ll ans = 0;
    int sz = vec.size();

    vector<pair<int, pii>> E;

    for(int i = 0; i < sz - 1; i++){

        if(vec[i].se.se == 1) numS++;
        else numS--;

        if(numS > 0) ans += 1ll * numS * (vec[i + 1].fi - vec[i].fi);
        if(numS != 0){
            D.Join(vec[i].se.fi, vec[i + 1].se.fi);
        }else{
            E.push_back({vec[i + 1].fi - vec[i].fi, {vec[i].se.fi, vec[i + 1].se.fi}});
        }
    }

    // Force to pair with someone lower

    sort(E.begin(), E.end());

    numS = 0;
    for(auto x : E){
        if(D.f(x.se.se) != D.f(x.se.fi)){
            D.Join(x.se.se, x.se.fi);
            ans += x.fi;
        }
    }
    
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB n = 2
2 Correct 1 ms 980 KB n = 2
3 Correct 1 ms 980 KB n = 2
4 Correct 1 ms 980 KB n = 2
5 Correct 1 ms 980 KB n = 2
6 Correct 1 ms 980 KB n = 2
7 Correct 1 ms 980 KB n = 3
8 Correct 1 ms 980 KB n = 3
9 Correct 1 ms 980 KB n = 3
10 Correct 1 ms 980 KB n = 8
11 Correct 1 ms 980 KB n = 8
12 Correct 1 ms 980 KB n = 8
13 Correct 1 ms 980 KB n = 8
14 Correct 2 ms 1080 KB n = 8
15 Correct 1 ms 980 KB n = 8
16 Correct 1 ms 980 KB n = 8
17 Correct 1 ms 1084 KB n = 8
18 Correct 1 ms 980 KB n = 8
19 Correct 1 ms 980 KB n = 3
20 Correct 1 ms 980 KB n = 7
21 Correct 1 ms 980 KB n = 8
22 Correct 1 ms 980 KB n = 8
23 Correct 1 ms 980 KB n = 8
24 Correct 1 ms 980 KB n = 8
25 Correct 1 ms 1076 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 10432 KB n = 199999
2 Correct 116 ms 10432 KB n = 199991
3 Correct 99 ms 10440 KB n = 199993
4 Correct 70 ms 9684 KB n = 152076
5 Correct 50 ms 5760 KB n = 93249
6 Correct 86 ms 10432 KB n = 199910
7 Correct 93 ms 10444 KB n = 199999
8 Correct 108 ms 10428 KB n = 199997
9 Correct 93 ms 10044 KB n = 171294
10 Correct 70 ms 9472 KB n = 140872
11 Correct 87 ms 10428 KB n = 199886
12 Correct 100 ms 10464 KB n = 199996
13 Correct 109 ms 10428 KB n = 200000
14 Correct 105 ms 15188 KB n = 199998
15 Correct 110 ms 14868 KB n = 200000
16 Correct 130 ms 14644 KB n = 199998
17 Correct 103 ms 11572 KB n = 200000
18 Correct 85 ms 10364 KB n = 190000
19 Correct 75 ms 10484 KB n = 177777
20 Correct 44 ms 5820 KB n = 100000
21 Correct 94 ms 10440 KB n = 200000
22 Correct 125 ms 14292 KB n = 200000
23 Correct 114 ms 14264 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB n = 2
2 Correct 1 ms 980 KB n = 2
3 Correct 1 ms 980 KB n = 2
4 Correct 1 ms 980 KB n = 2
5 Correct 1 ms 980 KB n = 2
6 Correct 1 ms 980 KB n = 2
7 Correct 1 ms 980 KB n = 3
8 Correct 1 ms 980 KB n = 3
9 Correct 1 ms 980 KB n = 3
10 Correct 1 ms 980 KB n = 8
11 Correct 1 ms 980 KB n = 8
12 Correct 1 ms 980 KB n = 8
13 Correct 1 ms 980 KB n = 8
14 Correct 2 ms 1080 KB n = 8
15 Correct 1 ms 980 KB n = 8
16 Correct 1 ms 980 KB n = 8
17 Correct 1 ms 1084 KB n = 8
18 Correct 1 ms 980 KB n = 8
19 Correct 1 ms 980 KB n = 3
20 Correct 1 ms 980 KB n = 7
21 Correct 1 ms 980 KB n = 8
22 Correct 1 ms 980 KB n = 8
23 Correct 1 ms 980 KB n = 8
24 Correct 1 ms 980 KB n = 8
25 Correct 1 ms 1076 KB n = 8
26 Correct 1 ms 980 KB n = 8
27 Correct 1 ms 980 KB n = 8
28 Correct 1 ms 980 KB n = 8
29 Correct 1 ms 980 KB n = 16
30 Correct 1 ms 980 KB n = 16
31 Correct 1 ms 980 KB n = 16
32 Correct 1 ms 980 KB n = 16
33 Correct 1 ms 980 KB n = 16
34 Correct 1 ms 1080 KB n = 16
35 Correct 1 ms 980 KB n = 16
36 Correct 1 ms 980 KB n = 15
37 Correct 2 ms 1084 KB n = 8
38 Correct 1 ms 980 KB n = 16
39 Correct 1 ms 980 KB n = 16
40 Correct 1 ms 980 KB n = 9
41 Correct 1 ms 980 KB n = 16
42 Correct 1 ms 980 KB n = 16
43 Correct 1 ms 980 KB n = 16
44 Correct 1 ms 980 KB n = 9
45 Correct 1 ms 980 KB n = 15
46 Correct 1 ms 1084 KB n = 16
47 Correct 1 ms 1080 KB n = 16
48 Correct 1 ms 980 KB n = 16
49 Correct 99 ms 10432 KB n = 199999
50 Correct 116 ms 10432 KB n = 199991
51 Correct 99 ms 10440 KB n = 199993
52 Correct 70 ms 9684 KB n = 152076
53 Correct 50 ms 5760 KB n = 93249
54 Correct 86 ms 10432 KB n = 199910
55 Correct 93 ms 10444 KB n = 199999
56 Correct 108 ms 10428 KB n = 199997
57 Correct 93 ms 10044 KB n = 171294
58 Correct 70 ms 9472 KB n = 140872
59 Correct 87 ms 10428 KB n = 199886
60 Correct 100 ms 10464 KB n = 199996
61 Correct 109 ms 10428 KB n = 200000
62 Correct 105 ms 15188 KB n = 199998
63 Correct 110 ms 14868 KB n = 200000
64 Correct 130 ms 14644 KB n = 199998
65 Correct 103 ms 11572 KB n = 200000
66 Correct 85 ms 10364 KB n = 190000
67 Correct 75 ms 10484 KB n = 177777
68 Correct 44 ms 5820 KB n = 100000
69 Correct 94 ms 10440 KB n = 200000
70 Correct 125 ms 14292 KB n = 200000
71 Correct 114 ms 14264 KB n = 200000
72 Correct 107 ms 14156 KB n = 200000
73 Correct 117 ms 14180 KB n = 200000
74 Correct 114 ms 13992 KB n = 200000
75 Correct 93 ms 13964 KB n = 200000
76 Correct 88 ms 13948 KB n = 200000
77 Correct 102 ms 15120 KB n = 200000
78 Correct 138 ms 17844 KB n = 200000
79 Correct 100 ms 13240 KB n = 184307
80 Correct 44 ms 6900 KB n = 76040
81 Correct 90 ms 13028 KB n = 199981
82 Correct 92 ms 13392 KB n = 199994
83 Correct 109 ms 12988 KB n = 199996
84 Correct 104 ms 17940 KB n = 199998
85 Correct 109 ms 17316 KB n = 200000
86 Correct 122 ms 17740 KB n = 199998
87 Correct 107 ms 15048 KB n = 200000
88 Correct 108 ms 13980 KB n = 200000
89 Correct 94 ms 15056 KB n = 200000
90 Correct 100 ms 14012 KB n = 200000
91 Correct 145 ms 17788 KB n = 200000
92 Correct 127 ms 17832 KB n = 200000