제출 #1035844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1035844		_8_8_	밀림 점프 (APIO21_jumps)	C++17	0 / 100	4093 ms	90464 KiB

jumps

#include "jumps.h"
 
#include <vector>
#include <bits/stdc++.h>
using namespace std;
 
const int B = 20;
int n;
vector<vector<int>> build(vector<vector<int>> g,vector<int>rt){
    vector<vector<int>> up(n+1);
    function<void(int,int )> dfs = [&](int v,int pr) {
        up[v].resize(B);
        up[v][0] = pr;
        for(int i = 1;i < B;i++){
            up[v][i] = up[up[v][i - 1]][i - 1];
        }
        for(int to:g[v]) {  
            dfs(to,v);
        }
    };
    for(int i:rt) {
        dfs(i,i);
    }
    return up;
}
vector<vector<int>> up,up1;
const int maxn = (int)2e5 + 12;
int l[maxn],r[maxn];
vector<int> h;
void init(int N, vector<int> H) {
    h = H;
    n = N;
    vector<int> st,rt;
    vector<vector<int>> G(n);
    for(int i = 0;i < N;i++) {
        while(!(int)st.empty() && H[st.back()] < H[i]) {
            st.pop_back();
        }
        if(st.empty()){
            rt.push_back(i);
            l[i] = -1;
        }else {
            G[st.back()].push_back(i);            
            l[i] = st.back();
        }
        st.push_back(i);
    }
    up = build(G,rt);
    for(int i = 0;i < n;i++){
        G[i].clear();
    }
    rt.clear();
    st.clear();
    for(int i = N - 1;i >= 0;i--){
        while(!st.empty() && H[st.back()] < H[i]){
            st.pop_back();
        }
        if(st.empty()){
            rt.push_back(i);
            r[i] = -1;
        }else {
            G[st.back()].push_back(i);
            r[i] = st.back();
        }
        st.push_back(i);
    }
    up1 = build(G,rt);
}
bool check(int ver,int C,int D){
    for(int i = B - 1;i >= 0;i--){
        if(up1[ver][i] < C){
            ver = up1[ver][i];
        }
    }
    ver = up1[ver][0];
    return (ver >= C && ver <= D);
}
int go(int ver,int C,int D) {
    if(ver >= C && ver <= D) return 0;
    if(r[ver] >= C && r[ver] <= D) return 1;

    if(l[ver] == -1 || h[r[ver]] > h[l[ver]] || !check(l[ver],C,D)){
        return go(r[ver],C,D) + 1;
    }
    return go(l[ver],C,D) + 1;
}
int minimum_jumps(int A, int B, int C, int D) {
    if(!check(B,C,D)) return -1;
    int res = 1e9;
    for(int i = A;i <= B;i++) {
        if(check(i,C,D)){
            res = min(res,go(i,C,D));
        }
    }
    int ver = B;
    for(int i = 19;i >= 0;i--){
        if(up[ver][i] >= A && check(ver,C,D) != -1){
            ver = up[ver][i];
        }
    }
    assert(res == go(ver,C,D));

    return res;
    // if(!check(ver,C,D)){
    //     return -1;
    // }
    // return go(ver,C,D);
}

컴파일 시 표준 에러 (stderr) 메시지

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:97:46: warning: comparison of constant '-1' with boolean expression is always true [-Wbool-compare]
   97 |         if(up[ver][i] >= A && check(ver,C,D) != -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