# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
555498 | joelau | Rainforest Jumps (APIO21_jumps) | C++14 | 1102 ms | 55240 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;
int n, p1[200005][20], p2[200005][20], X[200005], spt[20][200005];
vector<int> lst[200005];
stack<int> s;
void init(int N, std::vector<int> H) {
n = N;
for (int i = 0; i < N; ++i) X[i] = H[i];
for (int i = 0; i < N; ++i) spt[0][i] = i;
for (int i = 1; i < 20; ++i) for (int j = 0; j < N; ++j) {
spt[i][j] = spt[i-1][j];
if (j+(1<<(i-1)) < N && H[spt[i-1][j+(1<<(i-1))]] < H[spt[i-1][j]]) spt[i][j] = spt[i-1][j+(1<<(i-1))];
}
memset(p1,-1,sizeof(p1));
memset(p2,-1,sizeof(p2));
for (int i = 0; i < N; ++i) {
while (!s.empty() && H[i] >= H[s.top()]) s.pop();
if (!s.empty()) p1[i][0] = s.top();
s.push(i);
}
while (!s.empty()) s.pop();
for (int i = N-1; i >= 0; --i) {
while (!s.empty() && H[i] >= H[s.top()]) s.pop();
if (!s.empty()) p2[i][0] = s.top();
s.push(i);
}
for (int i = 0; i < N; ++i) if (p1[i][0] == -1 || (p1[i][0] != -1 && p2[i][0] != -1 && H[p1[i][0]] < H[p2[i][0]])) swap(p1[i][0], p2[i][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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |