제출 #765966

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

jumps

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read the edi a long time ago: have faint memories from it

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "jumps.h"

const int LOG = 18;
int upl[N][LOG], upr[N][LOG], upb[N][LOG];
vector<int> a;

void init(int n, vector<int> h) {
    a = h;
    a.pb(inf1);

    vector<int> ngel(n,n), nger(n,n);
    stack<int> st;

    rep(i,n){
        while(!st.empty() and a[i] > a[st.top()]){
            nger[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }   

    while(!st.empty()) st.pop();

    rev(i,n-1,0){
        while(!st.empty() and a[i] > a[st.top()]){
            ngel[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }

    while(!st.empty()) st.pop();

    rep(j,LOG){
        upl[n][j] = upr[n][j] = upb[n][j] = n;
    }

    rep(i,n){
        upl[i][0] = ngel[i];
        upr[i][0] = nger[i];
        if(a[ngel[i]] > a[nger[i]]){
            upb[i][0] = ngel[i];
        }
        else{
            upb[i][0] = nger[i];
        }
    }

    rep1(j,LOG-1){
        rep(i,n){
            upl[i][j] = upl[upl[i][j-1]][j-1];
            upr[i][j] = upr[upr[i][j-1]][j-1];
            upb[i][j] = upb[upb[i][j-1]][j-1];
        }
    }
}

int minimum_jumps(int l1, int l2, int r1, int r2) {
    int l = l1, r = r1;
    if(a[l] > a[r]) return -1;

    int ans = 0;

    // big jumps until possible
    rev(j,LOG-1,0){
        int nxt = upb[l][j];
        if(a[nxt] <= a[r]){
            l = nxt;
            ans += (1 << j);
        }
    }

    // small jumps going in one direction until reach r
    rev(j,LOG-1,0){
        int nxt = upl[l][j];
        if(a[nxt] <= a[r]){
            l = nxt;
            ans += (1 << j);
        }
    }

    rev(j,LOG-1,0){
        int nxt = upr[l][j];
        if(a[nxt] <= a[r]){
            l = nxt;
            ans += (1 << j);
        }
    }
    
    return ans;
}

• 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