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"
//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
const ll inf = 1LL<<60;
int p[maxn];
long long plan_roller_coaster(std::vector<int> S, std::vector<int> T) {
int n = (int) S.size();
vector<pii> a;
for (int i = 0;i < n;i++) a.push_back({S[i], T[i]});
sort(S.begin(), S.end());
for (int i = 0;i < n;i++) {
int ind = lower_bound(S.begin(), S.end(), T[i]) - S.begin();
p[ind]++;
}
p[0]++;
ll ans = 0;
for (int i = 1;i < n;i++) p[i] += p[i-1];
for (int i = 0;i < n;i++) {
if (p[i] <= i) ans = 1;
}
return ans;
}
# | 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... |