# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1208532 | omsincoconut | Roller Coaster Railroad (IOI16_railroad) | C++17 | 59 ms | 5824 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
pair<int, int> st[n+1];
st[0] = {0, 0};
for (int i = 1; i <= n; i++) st[i] = make_pair(s[i-1], t[i-1]);
sort(st+1, st+n+1);
int tmx[n+1];
tmx[0] = 0;
for (int i = 1; i <= n; i++) tmx[i] = max(tmx[i-1], st[i].first);
for (int i = 1; i <= n; i++) {
int idx = lower_bound(st, st+n+1, make_pair(t[i], s[i])) - st - 1;
if (tmx[idx] > s[i]) return 1;
}
return 0;
}
Compilation message (stderr)
# | 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... |