# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167280 | adriannok | Rainforest Jumps (APIO21_jumps) | C++20 | 4035 ms | 14484 KiB |
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> H;
vector<int> sorted;
vector< vector<int> > adj;
void init(int n, vector<int> h)
{
N = n;
H = h;
adj.resize( N );
for (int i = 0; i < n; ++i)
{
for (int j = i+1; j < n; ++j)
if(H[j] > H[i])
{
adj[i].push_back(j);
break;
}
for (int j = i-1; j >= 0; --j)
{
if(H[j] > 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... |