oj.uz

답안 #911272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911272 2024-01-18T17:27:51 Z JakobZorz Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 770 ms 57248 KB 
#include"railroad.h"
#include<iostream>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;

int dsu[500000];
int get(int a){
    if(dsu[a]<0)
        return a;
    return dsu[a]=get(dsu[a]);
}

void merge(int a,int b){
    a=get(a);
    b=get(b);
    if(a==b)
        return;
    if(dsu[a]>dsu[b])
        swap(a,b);
    dsu[a]+=dsu[b];
    dsu[b]=a;
}

ll plan_roller_coaster(vector<int>s,vector<int>t){
    for(int i=0;i<500000;i++)
        dsu[i]=-1;
    s.push_back(1e9);
    t.push_back(1);
    int n=(int)s.size();
    set<int>interestings;
    for(int i:s)
        interestings.insert(i);
    for(int i:t)
        interestings.insert(i);
    vector<int>interesting(interestings.begin(),interestings.end());
    map<int,int>m;
    {
        int idx=0;
        for(int i:interesting)
            m[i]=idx++;
    }
    vector<int>bal(interesting.size());
    for(int&i:s)
        i=m[i];
    for(int&i:t)
        i=m[i];
    for(int i=0;i<n;i++){
        int a=s[i],b=t[i];
        merge(a,b);
        bal[a]++;
        bal[b]--;
    }
    
    ll res=0;
    
    ll cbal=0;
    vector<pair<int,int>>conns;
    for(int i=0;i<(int)interesting.size()-1;i++){
        ll dist=interesting[i+1]-interesting[i];
        conns.emplace_back((int)dist,i);
        cbal+=bal[i];
        res+=max(0LL,cbal*dist);
        if(cbal!=0)
            merge(i,i+1);
    }
    sort(conns.begin(),conns.end());
    for(auto conn:conns){
        if(get(conn.second)!=get(conn.second+1)){
            merge(conn.second,conn.second+1);
            res+=conn.first;
        }
    }
    
    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 700 ms 52616 KB n = 199999
2 Correct 697 ms 56624 KB n = 199991
3 Correct 605 ms 56620 KB n = 199993
4 Correct 453 ms 44452 KB n = 152076
5 Correct 200 ms 27188 KB n = 93249
6 Correct 532 ms 47484 KB n = 199910
7 Correct 727 ms 53584 KB n = 199999
8 Correct 532 ms 47208 KB n = 199997
9 Correct 568 ms 48656 KB n = 171294
10 Correct 399 ms 41676 KB n = 140872
11 Correct 515 ms 48284 KB n = 199886
12 Correct 708 ms 55588 KB n = 199996
13 Correct 682 ms 49700 KB n = 200000
14 Correct 635 ms 53752 KB n = 199998
15 Correct 645 ms 52928 KB n = 200000
16 Correct 612 ms 54920 KB n = 199998
17 Correct 511 ms 56492 KB n = 200000
18 Correct 573 ms 53408 KB n = 190000
19 Correct 425 ms 51912 KB n = 177777
20 Correct 210 ms 28792 KB n = 100000
21 Correct 674 ms 56908 KB n = 200000
22 Correct 706 ms 56728 KB n = 200000
23 Correct 770 ms 56268 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB n = 2
2 Correct 1 ms 2396 KB n = 2
3 Correct 1 ms 2140 KB n = 2
4 Correct 1 ms 2136 KB n = 2
5 Correct 1 ms 2140 KB n = 2
6 Correct 1 ms 2140 KB n = 2
7 Correct 1 ms 2140 KB n = 3
8 Correct 1 ms 2224 KB n = 3
9 Correct 1 ms 2140 KB n = 3
10 Correct 1 ms 2396 KB n = 8
11 Correct 2 ms 2392 KB n = 8
12 Correct 1 ms 2308 KB n = 8
13 Correct 1 ms 2140 KB n = 8
14 Correct 1 ms 2140 KB n = 8
15 Correct 1 ms 2140 KB n = 8
16 Correct 1 ms 2140 KB n = 8
17 Correct 1 ms 2396 KB n = 8
18 Correct 1 ms 2140 KB n = 8
19 Correct 1 ms 2140 KB n = 3
20 Correct 1 ms 2396 KB n = 7
21 Correct 1 ms 2396 KB n = 8
22 Correct 1 ms 2140 KB n = 8
23 Correct 1 ms 2396 KB n = 8
24 Correct 1 ms 2140 KB n = 8
25 Correct 1 ms 2396 KB n = 8
26 Correct 1 ms 2396 KB n = 8
27 Correct 1 ms 2396 KB n = 8
28 Correct 1 ms 2396 KB n = 8
29 Correct 1 ms 2140 KB n = 16
30 Correct 1 ms 2140 KB n = 16
31 Correct 2 ms 2392 KB n = 16
32 Correct 1 ms 2396 KB n = 16
33 Correct 1 ms 2220 KB n = 16
34 Correct 1 ms 2396 KB n = 16
35 Correct 1 ms 2396 KB n = 16
36 Correct 1 ms 2140 KB n = 15
37 Correct 1 ms 2396 KB n = 8
38 Correct 1 ms 2140 KB n = 16
39 Correct 1 ms 2140 KB n = 16
40 Correct 1 ms 2396 KB n = 9
41 Correct 1 ms 2396 KB n = 16
42 Correct 1 ms 2396 KB n = 16
43 Correct 2 ms 2140 KB n = 16
44 Correct 2 ms 2396 KB n = 9
45 Correct 2 ms 2396 KB n = 15
46 Correct 1 ms 2136 KB n = 16
47 Correct 1 ms 2396 KB n = 16
48 Correct 2 ms 2396 KB n = 16
49 Correct 700 ms 52616 KB n = 199999
50 Correct 697 ms 56624 KB n = 199991
51 Correct 605 ms 56620 KB n = 199993
52 Correct 453 ms 44452 KB n = 152076
53 Correct 200 ms 27188 KB n = 93249
54 Correct 532 ms 47484 KB n = 199910
55 Correct 727 ms 53584 KB n = 199999
56 Correct 532 ms 47208 KB n = 199997
57 Correct 568 ms 48656 KB n = 171294
58 Correct 399 ms 41676 KB n = 140872
59 Correct 515 ms 48284 KB n = 199886
60 Correct 708 ms 55588 KB n = 199996
61 Correct 682 ms 49700 KB n = 200000
62 Correct 635 ms 53752 KB n = 199998
63 Correct 645 ms 52928 KB n = 200000
64 Correct 612 ms 54920 KB n = 199998
65 Correct 511 ms 56492 KB n = 200000
66 Correct 573 ms 53408 KB n = 190000
67 Correct 425 ms 51912 KB n = 177777
68 Correct 210 ms 28792 KB n = 100000
69 Correct 674 ms 56908 KB n = 200000
70 Correct 706 ms 56728 KB n = 200000
71 Correct 770 ms 56268 KB n = 200000
72 Correct 623 ms 57248 KB n = 200000
73 Correct 668 ms 56236 KB n = 200000
74 Correct 578 ms 56492 KB n = 200000
75 Correct 487 ms 56504 KB n = 200000
76 Correct 492 ms 55832 KB n = 200000
77 Correct 306 ms 32828 KB n = 200000
78 Correct 323 ms 32820 KB n = 200000
79 Correct 565 ms 51508 KB n = 184307
80 Correct 153 ms 22704 KB n = 76040
81 Correct 498 ms 47256 KB n = 199981
82 Correct 643 ms 54204 KB n = 199994
83 Correct 551 ms 49488 KB n = 199996
84 Correct 699 ms 54092 KB n = 199998
85 Correct 649 ms 54320 KB n = 200000
86 Correct 651 ms 55572 KB n = 199998
87 Correct 491 ms 55468 KB n = 200000
88 Correct 687 ms 55464 KB n = 200000
89 Correct 491 ms 55856 KB n = 200000
90 Correct 628 ms 56212 KB n = 200000
91 Correct 671 ms 56248 KB n = 200000
92 Correct 654 ms 55732 KB n = 200000