oj.uz

Submission #874666

# Submission time Handle Problem Language Result Execution time Memory
874666 2023-11-17T14:06:44 Z abcvuitunggio Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 194 ms 28996 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
int sum[500001],p[500001];
int f(int i){
    return (p[i]==i?i:p[i]=f(p[i]));
}
int unite(int i, int j){
    i=f(i);
    j=f(j);
    if (i==j)
        return 0;
    p[j]=i;
    return 1;
}
long long plan_roller_coaster(vector <int32_t> s, vector <int32_t> t){
    int n=s.size();
    vector <int> ve;
    vector <pair <int, int>> ve2;
    for (int i=0;i<n;i++){
        ve.push_back(s[i]);
        ve.push_back(t[i]);
    }
    sort(ve.begin(),ve.end());
    ve.resize(unique(ve.begin(),ve.end())-ve.begin());
    int res=0;
    iota(p,p+ve.size()+2,0);
    for (int i=0;i<n;i++){
        s[i]=lower_bound(ve.begin(),ve.end(),s[i])-ve.begin()+1;
        t[i]=lower_bound(ve.begin(),ve.end(),t[i])-ve.begin()+1;
        sum[s[i]]++;
        sum[t[i]]--;
        unite(s[i],t[i]);
    }
    sum[1]--;
    unite(1,ve.size()+1);
    for (int i=1;i<=ve.size();i++){
        sum[i]+=sum[i-1];
        if (sum[i])
            unite(i,i+1);
        if (i<ve.size()){
            res+=max(sum[i]*(ve[i]-ve[i-1]),0LL);
            ve2.push_back({ve[i]-ve[i-1],i});
        }
    }
    sort(ve2.begin(),ve2.end());
    for (auto [w,i]:ve2)
        res+=w*unite(i,i+1);
    return res;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:38:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i=1;i<=ve.size();i++){
      |                  ~^~~~~~~~~~~
railroad.cpp:42:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         if (i<ve.size()){
      |             ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB n = 2
2 Correct 1 ms 2396 KB n = 2
3 Correct 0 ms 2396 KB n = 2
4 Correct 1 ms 2552 KB n = 2
5 Correct 1 ms 2396 KB n = 2
6 Correct 1 ms 2396 KB n = 2
7 Correct 0 ms 2396 KB n = 3
8 Correct 0 ms 2396 KB n = 3
9 Correct 1 ms 2396 KB n = 3
10 Correct 0 ms 2396 KB n = 8
11 Correct 1 ms 2396 KB n = 8
12 Correct 1 ms 2396 KB n = 8
13 Correct 1 ms 2396 KB n = 8
14 Correct 1 ms 2396 KB n = 8
15 Correct 1 ms 2396 KB n = 8
16 Correct 1 ms 2396 KB n = 8
17 Correct 0 ms 2400 KB n = 8
18 Correct 0 ms 2396 KB n = 8
19 Correct 1 ms 2396 KB n = 3
20 Correct 1 ms 2396 KB n = 7
21 Correct 1 ms 2396 KB n = 8
22 Correct 1 ms 2396 KB n = 8
23 Correct 1 ms 2396 KB n = 8
24 Correct 1 ms 2396 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 2392 KB n = 8
29 Correct 1 ms 2396 KB n = 16
30 Correct 1 ms 2396 KB n = 16
31 Correct 0 ms 2396 KB n = 16
32 Correct 1 ms 2396 KB n = 16
33 Correct 1 ms 2396 KB n = 16
34 Correct 1 ms 2496 KB n = 16
35 Correct 0 ms 2396 KB n = 16
36 Correct 1 ms 2500 KB n = 15
37 Correct 1 ms 2468 KB n = 8
38 Correct 1 ms 2396 KB n = 16
39 Correct 1 ms 2396 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 1 ms 2496 KB n = 16
44 Correct 0 ms 2396 KB n = 9
45 Correct 1 ms 2492 KB n = 15
46 Correct 1 ms 2396 KB n = 16
47 Correct 0 ms 2396 KB n = 16
48 Correct 1 ms 2496 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 24156 KB n = 199999
2 Correct 194 ms 26072 KB n = 199991
3 Correct 169 ms 27436 KB n = 199993
4 Correct 123 ms 24384 KB n = 152076
5 Correct 74 ms 15940 KB n = 93249
6 Correct 142 ms 24640 KB n = 199910
7 Correct 156 ms 25132 KB n = 199999
8 Correct 150 ms 24872 KB n = 199997
9 Correct 143 ms 23880 KB n = 171294
10 Correct 117 ms 22560 KB n = 140872
11 Correct 149 ms 26668 KB n = 199886
12 Correct 156 ms 27712 KB n = 199996
13 Correct 152 ms 27192 KB n = 200000
14 Correct 162 ms 25912 KB n = 199998
15 Correct 158 ms 26512 KB n = 200000
16 Correct 161 ms 26932 KB n = 199998
17 Correct 174 ms 28932 KB n = 200000
18 Correct 155 ms 27500 KB n = 190000
19 Correct 152 ms 26172 KB n = 177777
20 Correct 78 ms 17284 KB n = 100000
21 Correct 169 ms 28332 KB n = 200000
22 Correct 172 ms 28996 KB n = 200000
23 Correct 159 ms 27444 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB n = 2
2 Correct 1 ms 2396 KB n = 2
3 Correct 0 ms 2396 KB n = 2
4 Correct 1 ms 2552 KB n = 2
5 Correct 1 ms 2396 KB n = 2
6 Correct 1 ms 2396 KB n = 2
7 Correct 0 ms 2396 KB n = 3
8 Correct 0 ms 2396 KB n = 3
9 Correct 1 ms 2396 KB n = 3
10 Correct 0 ms 2396 KB n = 8
11 Correct 1 ms 2396 KB n = 8
12 Correct 1 ms 2396 KB n = 8
13 Correct 1 ms 2396 KB n = 8
14 Correct 1 ms 2396 KB n = 8
15 Correct 1 ms 2396 KB n = 8
16 Correct 1 ms 2396 KB n = 8
17 Correct 0 ms 2400 KB n = 8
18 Correct 0 ms 2396 KB n = 8
19 Correct 1 ms 2396 KB n = 3
20 Correct 1 ms 2396 KB n = 7
21 Correct 1 ms 2396 KB n = 8
22 Correct 1 ms 2396 KB n = 8
23 Correct 1 ms 2396 KB n = 8
24 Correct 1 ms 2396 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 2392 KB n = 8
29 Correct 1 ms 2396 KB n = 16
30 Correct 1 ms 2396 KB n = 16
31 Correct 0 ms 2396 KB n = 16
32 Correct 1 ms 2396 KB n = 16
33 Correct 1 ms 2396 KB n = 16
34 Correct 1 ms 2496 KB n = 16
35 Correct 0 ms 2396 KB n = 16
36 Correct 1 ms 2500 KB n = 15
37 Correct 1 ms 2468 KB n = 8
38 Correct 1 ms 2396 KB n = 16
39 Correct 1 ms 2396 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 1 ms 2496 KB n = 16
44 Correct 0 ms 2396 KB n = 9
45 Correct 1 ms 2492 KB n = 15
46 Correct 1 ms 2396 KB n = 16
47 Correct 0 ms 2396 KB n = 16
48 Correct 1 ms 2496 KB n = 16
49 Correct 169 ms 24156 KB n = 199999
50 Correct 194 ms 26072 KB n = 199991
51 Correct 169 ms 27436 KB n = 199993
52 Correct 123 ms 24384 KB n = 152076
53 Correct 74 ms 15940 KB n = 93249
54 Correct 142 ms 24640 KB n = 199910
55 Correct 156 ms 25132 KB n = 199999
56 Correct 150 ms 24872 KB n = 199997
57 Correct 143 ms 23880 KB n = 171294
58 Correct 117 ms 22560 KB n = 140872
59 Correct 149 ms 26668 KB n = 199886
60 Correct 156 ms 27712 KB n = 199996
61 Correct 152 ms 27192 KB n = 200000
62 Correct 162 ms 25912 KB n = 199998
63 Correct 158 ms 26512 KB n = 200000
64 Correct 161 ms 26932 KB n = 199998
65 Correct 174 ms 28932 KB n = 200000
66 Correct 155 ms 27500 KB n = 190000
67 Correct 152 ms 26172 KB n = 177777
68 Correct 78 ms 17284 KB n = 100000
69 Correct 169 ms 28332 KB n = 200000
70 Correct 172 ms 28996 KB n = 200000
71 Correct 159 ms 27444 KB n = 200000
72 Correct 189 ms 26856 KB n = 200000
73 Correct 181 ms 26464 KB n = 200000
74 Correct 175 ms 25916 KB n = 200000
75 Correct 165 ms 26040 KB n = 200000
76 Correct 178 ms 28784 KB n = 200000
77 Correct 134 ms 23968 KB n = 200000
78 Correct 131 ms 25532 KB n = 200000
79 Correct 156 ms 27456 KB n = 184307
80 Correct 64 ms 15688 KB n = 76040
81 Correct 149 ms 26688 KB n = 199981
82 Correct 163 ms 26176 KB n = 199994
83 Correct 152 ms 24640 KB n = 199996
84 Correct 155 ms 27972 KB n = 199998
85 Correct 164 ms 25612 KB n = 200000
86 Correct 162 ms 25540 KB n = 199998
87 Correct 168 ms 26600 KB n = 200000
88 Correct 163 ms 26944 KB n = 200000
89 Correct 168 ms 26432 KB n = 200000
90 Correct 170 ms 26848 KB n = 200000
91 Correct 170 ms 28152 KB n = 200000
92 Correct 157 ms 26048 KB n = 200000