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;
typedef long long ll;
const int MAXN=2e5+5;
pair<int, int> v[MAXN];
int n;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
n = (int) s.size();
for(int i=1; i<=n; i++) v[i]={t[i-1], s[i-1]};
sort(v+1, v+1+n);
bool ok=1;
int cur=1;
for(int i=1; i<=n; i++) {
// printf("%d >> precisa %d >> sai %d\n", cur, v[i].second, v[i].first);
if(cur>v[i].second) ok=0;
cur=v[i].first;
}
if(ok) return 0;
return 1;
}
# | 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... |