# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167269 | adriannok | Rainforest Jumps (APIO21_jumps) | C++20 | 529 ms | 1114112 KiB |
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> H;
vector<int> sorted;
vector< vector<int> > d;
unordered_map<int, int> id;
void washifloi_Init()
{
for (int k = 0; k < N; ++k)
for (int i = 0; i < N; ++i)
for(int j = 0; j < N; ++j)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
void verify(const int& i, const int& j, int &in)
{
if(H[j] > H[i] && H[j] < (in<N? H[in] : N+1))
in = j;
}
void init(int n, vector<int> h)
{
N = n;
H = h;
# | 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... |