# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561350 | InternetPerson10 | Rainforest Jumps (APIO21_jumps) | C++17 | 4050 ms | 485956 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 subtask = 1;
int n;
vector<int> nums, l, r;
vector<vector<int>> liftBig, liftRight, liftLeft;
bool invalid(int k) {
if(k == -1 || k == n) return true;
return false;
}
int bigger(int a, int b) {
if(invalid(a) && invalid(b)) return -1;
if(invalid(a)) return b;
if(invalid(b)) return a;
if(nums[a] > nums[b]) return a;
return b;
}
void init(int N, std::vector<int> H) {
bool subtask1 = true;
for(int i = 0; i < N; i++) {
if(H[i] != i+1) subtask1 = false;
H[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... |