oj.uz

Submission #431118

# Submission time Handle Problem Language Result Execution time Memory
431118 2021-06-17T09:49:34 Z davi_bart Roller Coaster Railroad (IOI16_railroad) C++17
30 / 100
 330 ms 16796 KB 
#include "railroad.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ld long double
#define pb push_back

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    multiset<pair<int,int> > k;
    for(int i=0;i<s.size();i++)k.insert({s[i],i});
    int c=0;
    for(int i=0;i<s.size();i++){
        auto y=k.lower_bound({t[i],-1000});
        if(y!=k.end() && y->se==i)y=next(y);

        if(y==k.end())c++;
        else {
            //cout<<t[i]<<endl;
            k.erase(y);
        }
    }
    //cout<<"c: "<<c<<endl;
    return c>1;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:14:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int i=0;i<s.size();i++)k.insert({s[i],i});
      |                 ~^~~~~~~~~
railroad.cpp:16:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=0;i<s.size();i++){
      |                 ~^~~~~~~~~
railroad.cpp:12:9: warning: unused variable 'n' [-Wunused-variable]
   12 |     int n = (int) s.size();
      |         ^

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Incorrect 0 ms 204 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Incorrect 0 ms 204 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 12748 KB n = 199999
2 Correct 315 ms 13228 KB n = 199991
3 Correct 243 ms 13324 KB n = 199993
4 Correct 135 ms 10308 KB n = 152076
5 Correct 81 ms 6624 KB n = 93249
6 Correct 276 ms 13240 KB n = 199910
7 Correct 330 ms 13348 KB n = 199999
8 Correct 278 ms 13324 KB n = 199997
9 Correct 261 ms 11512 KB n = 171294
10 Correct 121 ms 9580 KB n = 140872
11 Correct 266 ms 13264 KB n = 199886
12 Correct 324 ms 16056 KB n = 199996
13 Correct 271 ms 15660 KB n = 200000
14 Correct 287 ms 15884 KB n = 199998
15 Correct 283 ms 15940 KB n = 200000
16 Correct 267 ms 16308 KB n = 199998
17 Correct 200 ms 16696 KB n = 200000
18 Correct 260 ms 15968 KB n = 190000
19 Correct 146 ms 14852 KB n = 177777
20 Correct 99 ms 8448 KB n = 100000
21 Correct 294 ms 16684 KB n = 200000
22 Correct 279 ms 16648 KB n = 200000
23 Correct 314 ms 16796 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Incorrect 0 ms 204 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -