제출 #962919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
962919		BhavayGoyal	밀림 점프 (APIO21_jumps)	C++14	33 / 100	4072 ms	5960 KiB

jumps

#include <bits/stdc++.h>
#include <jumps.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 2e5+5;
int n, arr[N], Next[N], Prev[N];

void init(int nn, vi h) {
    n = nn;
    for (int i = 1; i <= n; i++) arr[i] = h[i-1];

    stack<int> st;
    for (int i = 1; i <= n; i++) {
        while (st.size() && arr[st.top()] < arr[i]) st.pop();
        if (st.size()) Prev[i] = st.top();
        else Prev[i] = -1;
        st.push(i);
    }
    while (st.size()) st.pop();

    for (int i = n; i >= 1; i--) {
        while (st.size() && arr[st.top()] < arr[i]) st.pop();
        if (st.size()) Next[i] = st.top();
        else Next[i] = -1;
        st.push(i);
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    a++; b++; c++; d++;
    queue<int> q;
    vi dis(n+1, inf), vis(n+1, 0);
    for (int i = a; i <= b; i++) {
        q.push(i); 
        dis[i] = 0;
    }

    while (!q.empty()) {
        int f = q.front(); q.pop();
        if (f >= c && f <= d) return dis[f];
        if (vis[f]) continue;
        vis[f] = true;

        int ch = Next[f];
        if (ch != -1 && dis[ch] > dis[f]+1) {
            dis[ch] = dis[f]+1;
            q.push(ch);
        }

        ch = Prev[f];
        if (ch != -1 && dis[ch] > dis[f]+1) {
            dis[ch] = dis[f]+1;
            q.push(ch);
        }
    }

    return -1;
}

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