# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440482 | sam571128 | Rainforest Jumps (APIO21_jumps) | C++14 | 869 ms | 3240 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;
bool sub1 = true;
int adj[205][205];
void init(int N, std::vector<int> H) {
for(int i = 0;i < N-1;i++){
if(H[i+1]!=H[i]+1) sub1 = false;
}
if(sub1) return;
for(int i = 0;i < N;i++){
for(int j = 0;j < N;j++){
adj[i][j] = 1e9;
}
adj[i][i] = 0;
}
for(int i = 0;i < N;i++){
for(int j = i-1;~j;j--){
if(H[j]>H[i]){
adj[i][j] = 1;
break;
}
}
# | 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... |