#include "railroad.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <climits>
#include <deque>
#define pb push_back
using namespace std;
#define ll long long
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
deque<pair<int,int>> s_start;
deque<pair<int,int>> s_end;
for(int i=0;i<n;i++){
s_start.push_back({s[i],i});
s_end.push_back({t[i],i});
}
sort(s_start.rbegin(),s_start.rend());
sort(s_end.rbegin(),s_end.rend());
for(int i=1;i<n;i++){
if(s_end[i].second != s_start[0].second){
if(s_end[i].first > s_start[0].first){
return 1;
}
}else if(s_start.size() > 1){
if(s_end[i].first > s_start[1].first){
return 1;
}
}
s_start.pop_front();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
0 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
0 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
85 ms |
6732 KB |
n = 199999 |
2 |
Correct |
74 ms |
6732 KB |
n = 199991 |
3 |
Correct |
77 ms |
6732 KB |
n = 199993 |
4 |
Correct |
54 ms |
5076 KB |
n = 152076 |
5 |
Correct |
33 ms |
3220 KB |
n = 93249 |
6 |
Correct |
67 ms |
6604 KB |
n = 199910 |
7 |
Correct |
69 ms |
9804 KB |
n = 199999 |
8 |
Correct |
69 ms |
9412 KB |
n = 199997 |
9 |
Correct |
78 ms |
8972 KB |
n = 171294 |
10 |
Correct |
51 ms |
7532 KB |
n = 140872 |
11 |
Correct |
68 ms |
9404 KB |
n = 199886 |
12 |
Correct |
69 ms |
9944 KB |
n = 199996 |
13 |
Correct |
69 ms |
9576 KB |
n = 200000 |
14 |
Correct |
77 ms |
9772 KB |
n = 199998 |
15 |
Correct |
69 ms |
9660 KB |
n = 200000 |
16 |
Correct |
72 ms |
10048 KB |
n = 199998 |
17 |
Correct |
72 ms |
10572 KB |
n = 200000 |
18 |
Correct |
77 ms |
10080 KB |
n = 190000 |
19 |
Correct |
70 ms |
9472 KB |
n = 177777 |
20 |
Correct |
35 ms |
5424 KB |
n = 100000 |
21 |
Correct |
73 ms |
10600 KB |
n = 200000 |
22 |
Correct |
72 ms |
10556 KB |
n = 200000 |
23 |
Correct |
75 ms |
10564 KB |
n = 200000 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
0 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |