oj.uz

Submission #380393

# Submission time Handle Problem Language Result Execution time Memory
380393 2021-03-21T11:43:45 Z denkendoemeer Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 218 ms 15180 KB 
#include<bits/stdc++.h>
#include "railroad.h"
const int inf=2e9;
#define ll long long
using namespace std;
vector<int>nex;
int findt(int node)
{
    if (nex[node]!=-1)
        return nex[node]=findt(nex[node]);
    return node;
}
bool onion(int x,int y)
{
    x=findt(x);
    y=findt(y);
    if (x==y)
        return 0;
    nex[y]=x;
    return 1;
}
ll plan_roller_coaster(vector<int>s,vector<int>t)
{
    s.push_back(inf);
    t.push_back(1);
    int n=s.size();
    vector<int>aux=s;
    aux.insert(aux.end(),t.begin(),t.end());
    sort(aux.begin(),aux.end());
    aux.erase(unique(aux.begin(),aux.end()),aux.end());
    int m=aux.size();
    nex.resize(m,-1);
    vector<int>b(m--);
    int i;
    for(i=0;i<n;i++){
        int st=lower_bound(aux.begin(),aux.end(),s[i])-aux.begin();
        int dr=lower_bound(aux.begin(),aux.end(),t[i])-aux.begin();
        onion(st,dr);
        ++b[st];
        --b[dr];
    }
    for(i=0;i<m;i++)
        b[i+1]+=b[i];
    vector<pair<int,int>>pi;
    ll ans=0;
    for(i=0;i<m;i++){
        ll sum=aux[i+1]-aux[i];
        if (b[i]){
            onion(i,i+1);
            if (b[i]>0)
                ans=ans+b[i]*sum;
        }
        else
            pi.push_back({sum,i});
    }
    sort(pi.begin(),pi.end());
    for(auto it:pi)
        if (onion(it.second,it.second+1))
            ans+=it.first;
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 1 ms 364 KB n = 15
37 Correct 1 ms 364 KB n = 8
38 Correct 1 ms 364 KB n = 16
39 Correct 1 ms 364 KB n = 16
40 Correct 1 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 1 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 0 ms 364 KB n = 16
47 Correct 1 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 12936 KB n = 199999
2 Correct 187 ms 12748 KB n = 199991
3 Correct 192 ms 12876 KB n = 199993
4 Correct 139 ms 9600 KB n = 152076
5 Correct 75 ms 6176 KB n = 93249
6 Correct 175 ms 11212 KB n = 199910
7 Correct 162 ms 11980 KB n = 199999
8 Correct 163 ms 11212 KB n = 199997
9 Correct 155 ms 10924 KB n = 171294
10 Correct 125 ms 9116 KB n = 140872
11 Correct 167 ms 11340 KB n = 199886
12 Correct 172 ms 12364 KB n = 199996
13 Correct 177 ms 11852 KB n = 200000
14 Correct 187 ms 14320 KB n = 199998
15 Correct 194 ms 14156 KB n = 200000
16 Correct 198 ms 14796 KB n = 199998
17 Correct 175 ms 13060 KB n = 200000
18 Correct 187 ms 12188 KB n = 190000
19 Correct 150 ms 11388 KB n = 177777
20 Correct 81 ms 6620 KB n = 100000
21 Correct 175 ms 12748 KB n = 200000
22 Correct 218 ms 15180 KB n = 200000
23 Correct 214 ms 15180 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 1 ms 364 KB n = 15
37 Correct 1 ms 364 KB n = 8
38 Correct 1 ms 364 KB n = 16
39 Correct 1 ms 364 KB n = 16
40 Correct 1 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 1 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 0 ms 364 KB n = 16
47 Correct 1 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16
49 Correct 188 ms 12936 KB n = 199999
50 Correct 187 ms 12748 KB n = 199991
51 Correct 192 ms 12876 KB n = 199993
52 Correct 139 ms 9600 KB n = 152076
53 Correct 75 ms 6176 KB n = 93249
54 Correct 175 ms 11212 KB n = 199910
55 Correct 162 ms 11980 KB n = 199999
56 Correct 163 ms 11212 KB n = 199997
57 Correct 155 ms 10924 KB n = 171294
58 Correct 125 ms 9116 KB n = 140872
59 Correct 167 ms 11340 KB n = 199886
60 Correct 172 ms 12364 KB n = 199996
61 Correct 177 ms 11852 KB n = 200000
62 Correct 187 ms 14320 KB n = 199998
63 Correct 194 ms 14156 KB n = 200000
64 Correct 198 ms 14796 KB n = 199998
65 Correct 175 ms 13060 KB n = 200000
66 Correct 187 ms 12188 KB n = 190000
67 Correct 150 ms 11388 KB n = 177777
68 Correct 81 ms 6620 KB n = 100000
69 Correct 175 ms 12748 KB n = 200000
70 Correct 218 ms 15180 KB n = 200000
71 Correct 214 ms 15180 KB n = 200000
72 Correct 175 ms 12748 KB n = 200000
73 Correct 178 ms 12748 KB n = 200000
74 Correct 204 ms 12892 KB n = 200000
75 Correct 171 ms 12748 KB n = 200000
76 Correct 172 ms 12788 KB n = 200000
77 Correct 153 ms 10444 KB n = 200000
78 Correct 179 ms 13516 KB n = 200000
79 Correct 168 ms 11596 KB n = 184307
80 Correct 61 ms 5140 KB n = 76040
81 Correct 161 ms 11212 KB n = 199981
82 Correct 172 ms 12236 KB n = 199994
83 Correct 166 ms 11468 KB n = 199996
84 Correct 195 ms 14412 KB n = 199998
85 Correct 187 ms 14156 KB n = 200000
86 Correct 197 ms 14772 KB n = 199998
87 Correct 171 ms 12840 KB n = 200000
88 Correct 176 ms 12876 KB n = 200000
89 Correct 169 ms 12876 KB n = 200000
90 Correct 173 ms 12788 KB n = 200000
91 Correct 215 ms 15180 KB n = 200000
92 Correct 209 ms 15180 KB n = 200000