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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<pair<int,int>> RRs;
for (int i = 0; i < n; i++) RRs.push_back(make_pair(s[i],t[i]));
auto comp = [](pair<int,int> p1, pair<int,int> p2) {return p1.second <= p2.first;};
stable_sort(RRs.begin(),RRs.end(),comp);
for (int i = 0; i < n-1; i++) {
if (!comp(RRs[i],RRs[i+1])) return 1;
}
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... |