제출 #555498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555498		joelau	밀림 점프 (APIO21_jumps)	C++14	27 / 100	1102 ms	55240 KiB

jumps

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

int n, p1[200005][20], p2[200005][20], X[200005], spt[20][200005];
vector<int> lst[200005];
stack<int> s;

void init(int N, std::vector<int> H) {
    n = N;
    for (int i = 0; i < N; ++i) X[i] = H[i];
    for (int i = 0; i < N; ++i) spt[0][i] = i;
    for (int i = 1; i < 20; ++i) for (int j = 0; j < N; ++j) {
        spt[i][j] = spt[i-1][j];
        if (j+(1<<(i-1)) < N && H[spt[i-1][j+(1<<(i-1))]] < H[spt[i-1][j]]) spt[i][j] = spt[i-1][j+(1<<(i-1))];
    }
    memset(p1,-1,sizeof(p1));
    memset(p2,-1,sizeof(p2));
    for (int i = 0; i < N; ++i) {
        while (!s.empty() && H[i] >= H[s.top()]) s.pop();
        if (!s.empty()) p1[i][0] = s.top();
        s.push(i);
    }
    while (!s.empty()) s.pop();
    for (int i = N-1; i >= 0; --i) {
        while (!s.empty() && H[i] >= H[s.top()]) s.pop();
        if (!s.empty()) p2[i][0] = s.top();
        s.push(i);
    }
    for (int i = 0; i < N; ++i) if (p1[i][0] == -1 || (p1[i][0] != -1 && p2[i][0] != -1 && H[p1[i][0]] < H[p2[i][0]])) swap(p1[i][0], p2[i][0]);
    for (int k = 1; k < 20; ++k) for (int i = 0; i < N; ++i) {
        if (p1[i][k-1] == -1) p1[i][k] = -1;
        else p1[i][k] = p1[p1[i][k-1]][k-1];
        if (p2[i][k-1] == -1) p2[i][k] = -1;
        else p2[i][k] = p2[p2[i][k-1]][k-1];
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    int k = 31 - __builtin_clz(B-A+1), tmp = spt[k][A];
    if (k != 0 && X[spt[k][B-(1<<(k-1))]] < X[spt[k][A]]) tmp = spt[k][B-(1<<(k-1))];
    for (int k = 19; k >= 0; --k) if (p1[tmp][k] != -1 && X[p1[tmp][k]] <= X[C] && p1[tmp][k] >= A && p1[tmp][k] <= B) tmp = p1[tmp][k];
    for (int k = 19; k >= 0; --k) if (p2[tmp][k] != -1 && X[p2[tmp][k]] <= X[C] && p2[tmp][k] >= A && p2[tmp][k] <= B) tmp = p2[tmp][k];
    int ans = 0;
    for (int k = 19; k >= 0; --k) if (p1[tmp][k] != -1 && X[p1[tmp][k]] <= X[C]) ans += (1<<k), tmp = p1[tmp][k];
    for (int k = 19; k >= 0; --k) if (p2[tmp][k] != -1 && X[p2[tmp][k]] <= X[C]) ans += (1<<k), tmp = p2[tmp][k];
    if (tmp != C) return -1;
    else return ans;
}

• 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