oj.uz

답안 #578636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578636 2022-06-17T12:24:27 Z jasmin Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 810 ms 42648 KB 
#include<bits/stdc++.h>
#include "railroad.h"
using namespace std;
#define int long long

const int inf=1e18;

struct graph{
    vector<pair<int, pair<int,int> > >e;
    unordered_map<int, int> chef;

    int find(int v){
        if(chef[v]==0 || chef[v]==v){
            return chef[v]=v;
        }
        return chef[v]=find(chef[v]);
    }
    bool unite(int a, int b){
        if(find(a)==find(b)) return false;
        chef[find(a)]=find(b);
        return true;
    }

    int mst(){
        int ans=0;
        sort(e.begin(), e.end());

        for(auto edge: e){
            if(unite(edge.second.first, edge.second.second)){
                ans+=edge.first;
            }
        }
        return ans;
    }
};

int plan_roller_coaster(vector<int32_t> s, vector<int32_t> t){
    int n=s.size();
    
    graph g;
    vector<pair<int, int> > time;
    for(int i=0; i<n; i++){
        time.push_back({s[i], 1});
        time.push_back({t[i], -1});
        g.unite(s[i], t[i]);
    }
    sort(time.begin(), time.end());

    int sum=-1;
    int ans=0;
    for(int i=0; i<(int)time.size()-1; i++){

        sum+=time[i].second;
        ans+=max((int)0, (time[i+1].first-time[i].first)*sum);
        
        if(sum==0){
            g.e.push_back({time[i+1].first-time[i].first, {time[i+1].first, time[i].first}});
        }
        else{
            g.unite(time[i+1].first, time[i].first);
        }
    }

    ans+=g.mst();
    return ans;
}

/*signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int32_t> s(n);
    vector<int32_t> t(n);
    for(int i=0; i<n; i++){
        cin >> s[i];
    }
    for(int i=0; i<n; i++){
        cin >> t[i];
    }
    cout << plan_roller_coaster(s, t) << "\n";
}*/

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 0 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 1 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 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 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 1 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 0 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 1 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 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 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 1 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 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 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 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 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 1 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 477 ms 28200 KB n = 199999
2 Correct 510 ms 28372 KB n = 199991
3 Correct 525 ms 28372 KB n = 199993
4 Correct 324 ms 21784 KB n = 152076
5 Correct 190 ms 13968 KB n = 93249
6 Correct 334 ms 22620 KB n = 199910
7 Correct 388 ms 28372 KB n = 199999
8 Correct 319 ms 22736 KB n = 199997
9 Correct 353 ms 22136 KB n = 171294
10 Correct 331 ms 21600 KB n = 140872
11 Correct 371 ms 22872 KB n = 199886
12 Correct 468 ms 28960 KB n = 199996
13 Correct 377 ms 24684 KB n = 200000
14 Correct 552 ms 38044 KB n = 199998
15 Correct 503 ms 38048 KB n = 200000
16 Correct 602 ms 38432 KB n = 199998
17 Correct 470 ms 28252 KB n = 200000
18 Correct 466 ms 28032 KB n = 190000
19 Correct 397 ms 27808 KB n = 177777
20 Correct 198 ms 14048 KB n = 100000
21 Correct 436 ms 28236 KB n = 200000
22 Correct 810 ms 38704 KB n = 200000
23 Correct 755 ms 38856 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 0 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 1 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 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 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 1 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 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 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 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 0 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 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 1 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 477 ms 28200 KB n = 199999
50 Correct 510 ms 28372 KB n = 199991
51 Correct 525 ms 28372 KB n = 199993
52 Correct 324 ms 21784 KB n = 152076
53 Correct 190 ms 13968 KB n = 93249
54 Correct 334 ms 22620 KB n = 199910
55 Correct 388 ms 28372 KB n = 199999
56 Correct 319 ms 22736 KB n = 199997
57 Correct 353 ms 22136 KB n = 171294
58 Correct 331 ms 21600 KB n = 140872
59 Correct 371 ms 22872 KB n = 199886
60 Correct 468 ms 28960 KB n = 199996
61 Correct 377 ms 24684 KB n = 200000
62 Correct 552 ms 38044 KB n = 199998
63 Correct 503 ms 38048 KB n = 200000
64 Correct 602 ms 38432 KB n = 199998
65 Correct 470 ms 28252 KB n = 200000
66 Correct 466 ms 28032 KB n = 190000
67 Correct 397 ms 27808 KB n = 177777
68 Correct 198 ms 14048 KB n = 100000
69 Correct 436 ms 28236 KB n = 200000
70 Correct 810 ms 38704 KB n = 200000
71 Correct 755 ms 38856 KB n = 200000
72 Correct 482 ms 28244 KB n = 200000
73 Correct 455 ms 28232 KB n = 200000
74 Correct 476 ms 32208 KB n = 200000
75 Correct 468 ms 32072 KB n = 200000
76 Correct 432 ms 32076 KB n = 200000
77 Correct 248 ms 23076 KB n = 200000
78 Correct 349 ms 33440 KB n = 200000
79 Correct 458 ms 31508 KB n = 184307
80 Correct 142 ms 12504 KB n = 76040
81 Correct 352 ms 25664 KB n = 199981
82 Correct 414 ms 32204 KB n = 199994
83 Correct 326 ms 27480 KB n = 199996
84 Correct 532 ms 41220 KB n = 199998
85 Correct 509 ms 41016 KB n = 200000
86 Correct 617 ms 41740 KB n = 199998
87 Correct 461 ms 32212 KB n = 200000
88 Correct 475 ms 32124 KB n = 200000
89 Correct 471 ms 32208 KB n = 200000
90 Correct 461 ms 32200 KB n = 200000
91 Correct 711 ms 42544 KB n = 200000
92 Correct 697 ms 42648 KB n = 200000