제출 #1199767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199767		adiyer	Rainforest Jumps (APIO21_jumps)	C++20	0 / 100	110 ms	40344 KiB

jumps

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 11;

int n;
int a[MAXN];
int l[MAXN][20], r[MAXN][20], mx[MAXN][20];

stack < int > s;

int val(int i){
    return (i == -1 ? n + 1 : a[i]);
}

void init(int N, std::vector<int> H) {
    n = N;
    for(int i = 0; i < n; i++) a[i] = H[i];
    for(int i = 0; i < n; i++){
        while(s.size() && a[s.top()] < a[i]) s.pop();
        l[i][0] = (s.empty() ? -1 : s.top()), s.push(i);
    }    
    for(int i = n - 1; i >= 0; i--){
        while(s.size() && a[s.top()] < a[i]) s.pop();
        r[i][0] = (s.empty() ? -1 : s.top()), s.push(i);
    }
    for(int i = 0; i < n; i++){
        if(l[i][0] == -1 && r[i][0] == -1) mx[i][0] = -1;
        else if(r[i][0] != -1 && (l[i][0] == -1 || a[r[i][0]] > a[l[i][0]])) mx[i][0] = r[i][0];
        else mx[i][0] = l[i][0];
    }
    for(int k = 1; k < 20; k++)
        for(int i = 0; i < n; i++)
            l[i][k] = l[l[i][k - 1]][k - 1], r[i][k] = r[r[i][k - 1]][k - 1], mx[i][k] = mx[mx[i][k - 1]][k - 1];
}

int minimum_jumps(int A, int B, int C, int D) {
    if(r[B][0] == -1 || r[B][0] > D) return -1;
    if(r[B][0] >= C) return 1;
    int p = B;
    for(int i = 19; i >= 0; i--)
        if(r[p][i] != -1 && r[p][i] < C)
            p = r[p][i];
    if(r[p][0] == -1 || r[p][0] > D) return -1;
    int s = B, t = 0, ans = 0;
    for(int i = 19; i >= 0; i--)
        if(val(l[s][i]) < a[p] && l[s][i] >= A)
            s = l[s][i];
    if(l[s][0] >= A && C <= r[l[s][0]][0] && r[l[s][0]][0] <= D) return 1;
    for(int i = 19; i >= 0; i--)
        if(val(mx[s][i]) <= a[p]) 
            s = mx[s][i], ans |= (1 << i);
    if(s == p) return ++ans;
    if(0 <= l[0][s] && r[l[s][0]][0] <= D) return ans + 2;
    for(int i = 19; i >= 0; i--)
        if(r[s][i] < C && r[s][i] != -1)
            s = r[s][i], ans += (1 << i);
    s = r[s][0], ans++;
    if(C <= s && s <= D) return ans;
    else return -1;
}

• 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