#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=0;i<n;i++){
if(s_end[i].second != s_start[i].second){
if(s_end[i].first > s_start[0].first){
return 1;
}
}else{
if(s_end[i].first > s_start[1].first){
return 1;
}
}
s_start.pop_front();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
83 ms |
13388 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 0 |
2 |
Halted |
0 ms |
0 KB |
- |