oj.uz

답안 #618120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618120 2022-08-01T23:33:51 Z Bench0310 Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 614 ms 40100 KB 
#include <bits/stdc++.h>
#include "railroad.h"

using namespace std;
typedef long long ll;

ll plan_roller_coaster(vector<int> s,vector<int> t)
{
    s.push_back(1<<30);
    t.push_back(1);
    int n=s.size();
    map<int,int> h;
    vector<int> x;
    for(int y:s) x.push_back(y);
    for(int y:t) x.push_back(y);
    sort(x.begin(),x.end());
    x.erase(unique(x.begin(),x.end()),x.end());
    int m=x.size();
    for(int i=0;i<m;i++) h[x[i]]=i;
    vector<int> d(m,0);
    vector<int> p(m,0);
    for(int i=0;i<m;i++) p[i]=i;
    vector<int> sz(m,1);
    function<int(int)> find_set=[&](int a)->int
    {
        if(a==p[a]) return a;
        else return p[a]=find_set(p[a]);
    };
    auto merge_sets=[&](int a,int b)->int
    {
        a=find_set(a);
        b=find_set(b);
        if(a==b) return 0;
        if(sz[a]<sz[b]) swap(a,b);
        p[b]=a;
        sz[a]+=sz[b];
        return 1;
    };
    for(int i=0;i<n;i++)
    {
        int l=h[s[i]];
        int r=h[t[i]];
        d[l]++;
        d[r]--;
        merge_sets(l,r);
    }
    ll res=0;
    int sum=0;
    vector<array<int,3>> edges;
    for(int i=0;i+1<m;i++)
    {
        sum+=d[i];
        res+=(max(0,sum)*ll(x[i+1]-x[i]));
        edges.push_back({x[i+1]-x[i],i,i+1});
        if(sum!=0) merge_sets(i,i+1);
    }
    sort(edges.begin(),edges.end());
    for(auto [c,a,b]:edges) res+=(merge_sets(a,b)*c);
    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 40024 KB n = 199999
2 Correct 514 ms 40028 KB n = 199991
3 Correct 532 ms 40028 KB n = 199993
4 Correct 350 ms 31920 KB n = 152076
5 Correct 229 ms 19032 KB n = 93249
6 Correct 452 ms 34616 KB n = 199910
7 Correct 521 ms 38820 KB n = 199999
8 Correct 441 ms 34796 KB n = 199997
9 Correct 478 ms 35276 KB n = 171294
10 Correct 348 ms 30472 KB n = 140872
11 Correct 458 ms 34880 KB n = 199886
12 Correct 441 ms 38948 KB n = 199996
13 Correct 396 ms 35744 KB n = 200000
14 Correct 444 ms 38752 KB n = 199998
15 Correct 406 ms 38324 KB n = 200000
16 Correct 473 ms 39448 KB n = 199998
17 Correct 566 ms 39948 KB n = 200000
18 Correct 525 ms 38412 KB n = 190000
19 Correct 511 ms 36468 KB n = 177777
20 Correct 183 ms 20164 KB n = 100000
21 Correct 519 ms 40028 KB n = 200000
22 Correct 478 ms 40028 KB n = 200000
23 Correct 540 ms 39984 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 308 KB n = 2
5 Correct 1 ms 300 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 ms 300 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 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 0 ms 212 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 0 ms 300 KB n = 8
28 Correct 0 ms 300 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 300 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 292 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 1 ms 300 KB n = 15
37 Correct 1 ms 212 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 212 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 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 304 KB n = 16
48 Correct 1 ms 300 KB n = 16
49 Correct 572 ms 40024 KB n = 199999
50 Correct 514 ms 40028 KB n = 199991
51 Correct 532 ms 40028 KB n = 199993
52 Correct 350 ms 31920 KB n = 152076
53 Correct 229 ms 19032 KB n = 93249
54 Correct 452 ms 34616 KB n = 199910
55 Correct 521 ms 38820 KB n = 199999
56 Correct 441 ms 34796 KB n = 199997
57 Correct 478 ms 35276 KB n = 171294
58 Correct 348 ms 30472 KB n = 140872
59 Correct 458 ms 34880 KB n = 199886
60 Correct 441 ms 38948 KB n = 199996
61 Correct 396 ms 35744 KB n = 200000
62 Correct 444 ms 38752 KB n = 199998
63 Correct 406 ms 38324 KB n = 200000
64 Correct 473 ms 39448 KB n = 199998
65 Correct 566 ms 39948 KB n = 200000
66 Correct 525 ms 38412 KB n = 190000
67 Correct 511 ms 36468 KB n = 177777
68 Correct 183 ms 20164 KB n = 100000
69 Correct 519 ms 40028 KB n = 200000
70 Correct 478 ms 40028 KB n = 200000
71 Correct 540 ms 39984 KB n = 200000
72 Correct 614 ms 40028 KB n = 200000
73 Correct 528 ms 40032 KB n = 200000
74 Correct 518 ms 40020 KB n = 200000
75 Correct 544 ms 40024 KB n = 200000
76 Correct 542 ms 40024 KB n = 200000
77 Correct 266 ms 25216 KB n = 200000
78 Correct 255 ms 25124 KB n = 200000
79 Correct 502 ms 37324 KB n = 184307
80 Correct 160 ms 16280 KB n = 76040
81 Correct 457 ms 34972 KB n = 199981
82 Correct 459 ms 38936 KB n = 199994
83 Correct 422 ms 35812 KB n = 199996
84 Correct 403 ms 38736 KB n = 199998
85 Correct 432 ms 38324 KB n = 200000
86 Correct 439 ms 39452 KB n = 199998
87 Correct 531 ms 39948 KB n = 200000
88 Correct 593 ms 40100 KB n = 200000
89 Correct 536 ms 39984 KB n = 200000
90 Correct 489 ms 40052 KB n = 200000
91 Correct 547 ms 40036 KB n = 200000
92 Correct 509 ms 40004 KB n = 200000