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>
#define ll long long
using namespace std;
const ll inf = 2e5+9 , MX = 1e18+9;
ll n;
multiset<ll> s;
long long plan_roller_coaster(vector<int> S, vector<int> T) {
n = (ll) S.size();
for(int i=0;i<n;i++)
s.insert(S[i]);
for(int i=0;i<n;i++){
s.erase(s.find(S[i]));
if(*s.rbegin() < T[i])
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... |