제출 #951252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
951252		Nhoksocqt1	밀림 점프 (APIO21_jumps)	C++17	37 / 100	4054 ms	5852 KiB

jumps

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

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 200005;

int h[MAXN], dist[MAXN], nxt[MAXN], prv[MAXN], nArr;
bool check_sub1;

void init(int _N, vector<int> _H) {
    nArr = _N;

    check_sub1 = 1;
    for (int i = 1; i <= nArr; ++i) {
        h[i] = _H[i - 1];
        check_sub1 &= (i == 1 || h[i] > h[i - 1]);
    }

    stack<int> st;
    for (int i = 1; i <= nArr; ++i) {
        while(sz(st) && h[st.top()] <= h[i])
            st.pop();

        prv[i] = (sz(st)) ? st.top() : 0;
        st.push(i);
    }

    while(sz(st))
        st.pop();

    for (int i = nArr; i > 0; --i) {
        while(sz(st) && h[st.top()] <= h[i])
            st.pop();

        nxt[i] = (sz(st)) ? st.top() : nArr + 1;
        st.push(i);
    }
}

int brute(int a, int b, int c, int d) {
    for (int i = 1; i <= nArr; ++i)
        dist[i] = -1;

    queue<int> qu;
    for (int i = a; i <= b; ++i) {
        qu.push(i);
        dist[i] = 0;
    }

    while(sz(qu)) {
        int u(qu.front()); qu.pop();

        if(u >= c && u <= d)
            return dist[u];

        if(prv[u] > 0 && dist[prv[u]] < 0) {
            dist[prv[u]] = dist[u] + 1;
            qu.push(prv[u]);
        }

        if(nxt[u] <= nArr && dist[nxt[u]] < 0) {
            dist[nxt[u]] = dist[u] + 1;
            qu.push(nxt[u]);
        }
    }

    return -1;
}

int minimum_jumps(int a, int b, int c, int d) {
    ++a, ++b, ++c, ++d;
    if(check_sub1)
        return c - b;

    return brute(a, b, c, d);
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "jumps"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> h;
    int n, q;
    cin >> n >> q;

    h.resize(n);
    for (int i = 0; i < n; ++i)
        cin >> h[i];

    init(n, h);
    for (int t = 0; t < q; ++t) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        cout << "ANSWER " << a << ' ' << b << ' ' << c << ' ' << d << ": " << minimum_jumps(a, b, c, d) << '\n';
    }

    return 0;
}

#endif // Nhoksocqt1

• Subtask 1: 4 / 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