# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569387 | Turkhuu | Rainforest Jumps (APIO21_jumps) | C++17 | 4022 ms | 64612 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;
const int L = 18;
const int inf = 1000000000;
int n;
vector<int> a;
vector<vector<int>> lo, hi, g;
bool subtask1 = true;
void init(int N, vector<int> H){
n = N, a = H;
g.resize(n);
lo.assign(n, vector(L, -1));
hi.assign(n, vector(L, -1));
for(int i = 1; i < n; i++){
if(a[i - 1] > a[i]){
subtask1 = false;
}
}
vector<int> idx(n);
for(int i = 0; i < n; i++){
idx[--a[i]] = i;
}
set<int> s;
for(int i = n - 1; i >= 0; i--){
auto j = s.lower_bound(idx[i]);
int l = -1, r = -1;
if(j != s.end()){
r = a[*j];
g[idx[i]].push_back(*j);
# | 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... |