# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147882 | choochoo | Rainforest Jumps (APIO21_jumps) | C++20 | 2 ms | 5184 KiB |
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ve vector
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<ll,ll>
int n, k=18, stmax[18][200001], stmin[18][200001];
ve<int> h, adj[200001];
void init(int N, ve<int> H) {
n = N; h = H;
h.pb(999999);
for (int i=0; i<n; i++) {
if (h[i] == n-1) {
adj[i].pb(n);
continue;
}
for (int l=i-1; l>=0; l--) {
if (h[l] > h[i]) {
adj[i].pb(l);
break;
}
}
for (int r=i+1; r<n; r++) {
# | 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... |