제출 #979438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979438		vjudge1	밀림 점프 (APIO21_jumps)	C++17	27 / 100	865 ms	47536 KiB

jumps

#include "jumps.h"

#include <bits/stdc++.h>
using namespace std;
vector<int>adj[200100];
int vis[200100],d[200100],n,h[200100],rbj[200100][20],obj[200100][20];
vector<int> v;
void init(int N, std::vector<int> H) {
    stack<int> stk;
    for(int i=0;i<N;i++)
        h[i+1]=H[i];
    h[0]=1e9;
    n=N;
    for(int i=0;i<N;i++){
        while(stk.size()&&H[stk.top()]<=H[i])
            stk.pop();
        if(stk.size())
            adj[i+1].push_back(stk.top()+1);
        stk.push(i);
    }
    while(stk.size())stk.pop();
    for(int i=N;i--;){
        while(stk.size()&&H[stk.top()]<=H[i])   
            stk.pop();
        if(stk.size())
            adj[i+1].push_back(rbj[i+1][0]=stk.top()+1);
        stk.push(i);
    }
    for(int i=1;i<=N;i++)if(adj[i].size()>1)
        obj[i][0]=adj[i][h[adj[i][0]]<=h[adj[i][1]]];
    else if(adj[i].size())
        obj[i][0]=adj[i][0];
    for(int j=1;j<20;j++)
        for(int i=1;i<=N;i++)
            rbj[i][j]=rbj[rbj[i][j-1]][j-1],
            obj[i][j]=obj[obj[i][j-1]][j-1];
}
int minimum_jumps(int A, int B, int C, int D) {
    A++,B++,C++,D++;
    A=B;
    int a=A,c=C,d=0;
    for(int i=20;i--;)
        if(h[rbj[a][i]]<=h[c])
            a=rbj[a][i];
    if(a-c)
        return -1;
    a=A;
    for(int i=20;i--;)
        if(h[obj[a][i]]<=h[c])
            a=obj[a][i],d+=1<<i;
    for(int i=20;i--;)
        if(h[rbj[a][i]]<=h[c])
            a=rbj[a][i],d+=1<<i;
    return d;
}

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