제출 #948375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948375		Alihan_8	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	4089 ms	15272 KiB

jumps

#include <bits/stdc++.h>

#include "jumps.h"

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

vector <int> L, R;

vector <vector<int>> G;

int n;

void init(int N, std::vector<int> H) {
    n = N;
    L.resize(n), R.resize(n);
    G.resize(n);
    stack <int> stk;
    stk.push(-1);
    for ( int i = 0; i < n; i++ ){
        while ( stk.size() > 1 && H[stk.top()] <= H[i] ){
            stk.pop();
        } L[i] = stk.top();
        stk.push(i);
    }
    while ( stk.size() > 1 ) stk.pop();
    for ( int i = n - 1; i >= 0; i-- ){
        while ( stk.size() > 1 && H[stk.top()] <= H[i] ){
            stk.pop();
        } R[i] = stk.top();
        stk.push(i);
    }
    for ( int i = 0; i < n; i++ ){
        if ( L[i] == -1 && R[i] == -1 ){
            continue;
        }
        if ( L[i] == -1 || (R[i] != -1 && H[L[i]] < H[R[i]]) ){
            G[i].pb(R[i]);
        } else G[i].pb(L[i]);
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if ( A == B && C == D ){
        int u = A, v = C, ret = -1, cnt = 0;
        do{
            ++cnt;
            if ( R[u] == v ){
                ret = cnt;
                break;
            }
            if ( G[u].empty() ) break;
            u = G[u].back();
        } while ( true );
        return ret;
    }

    vector <int> dp(n, n);
    queue <int> q;
    for ( int i = A; i <= B; i++ ){
        dp[i] = 0;
        q.push(i);
    }
    while ( !q.empty() ){
        int u = q.front();
        q.pop();
        for ( auto &v: G[u] ){
            if ( chmin(dp[v], dp[u] + 1) ){
                q.push(v);
            }
        }
    }
    int opt = n;
    for ( int i = C; i <= D; i++ ){
        chmin(opt, dp[i]);
    }
    if ( opt == n ) opt = -1;
    return opt;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19