This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// #include "grader.cpp"
using namespace std;
typedef long long ll;
ll plan_roller_coaster (vector<int> s, vector<int> t){
ll n = s.size();
set<vector<int>> st;
for (int i=0; i<n; i++)
st.insert({t[i], s[i], i});
vector<int> last = {-1, -1, -1};
ll can = 1;
while (st.size()){
auto lb = st.lower_bound(last);
if (lb == st.end()){
can = 0;
break;
}
last = *lb;
last[1] = last[0];
last[0] = -1;
last[2] = -1;
st.erase(lb);
}
return can;
}
// int main(){
// return 0;
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |