제출 #691583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691583		Dan4Life	Rainforest Jumps (APIO21_jumps)	C++17	48 / 100	1185 ms	61480 KiB

jumps

#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back

const int maxn = (int)2e5+10;
const int maxlg = 24;
const int INF = (int)1e9;

int n, pr[maxn], nx[maxn];
int gis[maxlg][maxn], high[maxlg][maxn], movR[maxlg][maxn];

void calc(int jmp[][maxn]){
    for(int i = 1; i < maxlg; i++)
        for(int j = 0; j < n; j++)
            if(jmp[i-1][j]!=-1) jmp[i][j] = jmp[i-1][jmp[i-1][j]];
}

void init(int N, vector<int> a) {
    n = N;
    stack<pair<int,int>> S;
    memset(pr,-1,sizeof(pr));
    memset(nx,-1,sizeof(nx));
    memset(gis,-1,sizeof(gis));
    memset(high,-1,sizeof(high));
    memset(movR,-1,sizeof(movR));
    for(int i = 0; i < n; i++){
        while(!S.empty() and S.top().fi<a[i]) S.pop();
        if(!S.empty()) pr[i] = S.top().se;
        S.push({a[i],i});
    }
    while(!S.empty()) S.pop();
    for(int i = n-1; i>=0; i--){
        while(!S.empty() and S.top().fi<a[i]) S.pop();
        if(!S.empty()) nx[i] = S.top().se;
        S.push({a[i],i});
    }
    while(!S.empty()) S.pop();
    for(int i = 0; i < n; i++){
        if(pr[i]!=-1) gis[0][i]=pr[i];
        if(nx[i]!=-1) movR[0][i]=nx[i];
        if(pr[i]!=-1 and nx[i]!=-1)
            high[0][i] = (a[pr[i]]<a[nx[i]]?nx[i]:pr[i]);
    }
    calc(gis), calc(high), calc(movR);
}

int get_path(int *x, int y, int z, int jmp[][maxn], int rx=0, int ry=maxn){
    int tot = 0; ry = min(ry,y);
    for(int i = 20; i >= 0; i--)
        if(jmp[i][*x]>=rx and jmp[i][*x]<ry)
            if(nx[jmp[i][*x]]!=-1 and nx[jmp[i][*x]]<=z)
                *x = jmp[i][*x], tot+=(1<<i);
    return tot;
}

int minimum_jumps(int A, int x, int C, int D) {
    get_path(&x,C,D,gis,A);
    int num1 = get_path(&x,C,D,high);
    int num2 = get_path(&x,C,D,movR);
    return ((nx[x]>=C and nx[x]<=D)?num1+num2+1:-1);
}

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