# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1113134 | ortsac | Rainforest Jumps (APIO21_jumps) | C++17 | 4062 ms | 14136 KiB |
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 "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<long long, long long>
#define fr first
#define se second
int n;
vector<int> h;
vector<int> l;
vector<int> r;
void init(int32_t N, vector<int32_t> H) {
n = N;
h.resize(n);
for (int i = 0; i < n; i++) h[i] = H[i];
l.resize(n);
r.resize(n);
stack<pii> s;
for (int i = 0; i < n; i++) {
while (!s.empty() && (s.top().fr < h[i])) s.pop();
if (s.empty()) l[i] = -1;
else l[i] = s.top().se;
s.push({h[i], i});
}
while (!s.empty()) s.pop();
for (int i = n - 1; i >= 0; i--) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |