# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
804521 | radaiosm7 | Rainforest Jumps (APIO21_jumps) | C++11 | 4075 ms | 14904 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 X first
#define Y second
int i, n, x;
stack<pair<int, int> > S;
queue<int> Q;
vector<int> adj[200005];
int d[200005];
const int INF = INT_MAX;
void init(int N, vector<int> H) {
n = N;
for (i=0; i < N; ++i) {
while (!S.empty() && S.top().X < H[i]) S.pop();
if (!S.empty()) adj[i].push_back(S.top().Y);
S.push(make_pair(H[i], i));
}
while (!S.empty()) S.pop();
for (i=N-1; i >= 0; --i) {
while (!S.empty() && S.top().X < H[i]) S.pop();
if (!S.empty()) adj[i].push_back(S.top().Y);
S.push(make_pair(H[i], 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... |