| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 484143 | vinnipuh01 | Rainforest Jumps (APIO21_jumps) | C++17 | 0 ms | 0 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>
#include <vector>
using namespace std;
int n;
int a[ 200001 ];
vector <int> v[ 200001 ], vv;
void init(int N, vector<int> H) {
n = N;
for ( int i = 0 ; i < H.size(); i ++ )
a[ i + 1 ] = H[ i ];
for ( int i = 1; i <= n; i ++ ) {
while ( vv.size() && a[ vv.back() ] < a[ i ] ) {
vv.pop_back();
}
if ( vv.size() ) {
v[ i ].push_back( vv.back() );
}
vv.push_back( i );
}
vv.clear();
for ( int i = n; i >= 1; i -- ) {
while ( vv.size() && a[ vv.back() ] < a[ i ] ) {
vv.pop_back();
}
if ( vv.size() )
v[ i ].push_back( vv.back() );
vv.push_back( i );
}
}
const long long oo = 1e18;
long long mx, mn;
int c, f;
long long int d[ 200001 ];
queue <int> q;
int bfs( int u ) {
for ( int i = 1; i <= n; i ++ )
d[ i ] = oo;
d[ u ] = 0;
q.push( u );
whiile ( q.size() ) {
int g = q.front();
q.pop();
for ( auto to : v[ g ] ) {
if ( d[ to ] > d[ g ] + 1 ) {
d[ to ] = d[ g ] + 1;
q.push( to );
}
}
}
mx = oo;
for ( int i = c; i <= f; i ++ ) {
mx = min( mx, d[ i ] );
}
return mx;
}
int minimum_jumps(int A, int B, int C, int D) {
A ++;
B ++;
C ++;
D ++;
c = C;
d = D;
mn = oo;
for ( int i = A; i <= B; i ++ ) {
mn = min( mn, bfs( i ) );
}
if ( mn == oo )
return -1;
return mn;
}