Submission #1302754

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302754		icebear	Rainforest Jumps (APIO21_jumps)	C++20	33 / 100	4080 ms	5128 KiB

jumps

/* AUTHOR: TUAN ANH - BUI */
// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) return x = y, true;
        return false;
    }

template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) return x = y, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */

const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 27092008;
const ll INF  = (ll)1e18 + 27092008;
const int N = 2e5 + 5;
int n, h[N], L[N], R[N];

void init(int N, vector<int> H) {
    n = N;
    REP(i, n) h[i] = H[i];

    stack<int> st;
    REP(i, n) {
        while(!st.empty() && h[st.top()] < h[i]) st.pop();
        L[i] = (st.empty() ? n : st.top());
        st.push(i);
    }

    st = stack<int>();
    RED(i, n) {
        while(!st.empty() && h[st.top()] < h[i]) st.pop();
        R[i] = (st.empty() ? n : st.top());
        st.push(i);
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    queue<int> q;
    vector<int> dist(n + 5, inf);
    FOR(i, A, B) {
        dist[i] = 0;
        q.push(i);
    }

    while(!q.empty()) {
        int u = q.front(); q.pop();
        if (L[u] < n && minimize(dist[L[u]], dist[u] + 1)) q.push(L[u]);
        if (R[u] < n && minimize(dist[R[u]], dist[u] + 1)) q.push(R[u]);
    }

    int ans = inf;
    FOR(i, C, D) minimize(ans, dist[i]);
    return (ans == inf ? -1 : ans);
}

// int main() {
//     init(7, {3, 2, 1, 6, 4, 5, 7});
//     cout << minimum_jumps(4, 4, 6, 6) << '\n' << minimum_jumps(1, 3, 5, 6) << '\n' << minimum_jumps(0, 1, 2, 2);
//     return 0;
// }

• 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