제출 #1190475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190475		SulA	밀림 점프 (APIO21_jumps)	C++20	0 / 100	3 ms	5852 KiB

jumps

#include <bits/stdc++.h>
#define bitcount __builtin_popcountll
#define all(a) (a).begin(), (a).end()
using namespace std;

vector<int> adj[200000];
int dist[200000];

int bfs(vector<int> start, vector<int> end) {
    memset(dist, -1, sizeof dist);
    queue<int> q;
    for (int u : start) {
        dist[u] = 0;
        q.push(u);
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v : adj[u]) if (dist[v] == -1) {
            dist[v] = dist[u] + 1;
            q.push(v);
        }
    }
    int res = 1e9;
    for (int x : end) if (dist[x] != -1)
        res = min(res, dist[x]);
    return res == 1e9 ? -1 : res;
}

void init(int n, vector<int> h) {
    vector<int> st;
    for (int i = 0; i < n; i++) {
        while (!st.empty() && h[i] > h[st.back()])
            st.pop_back();
        if (!st.empty())
            adj[h[i]].push_back(st.back());
        st.push_back(i);
    }
    st.clear();
    for (int i = n-1; i >= 0; i--) {
        while (!st.empty() && h[i] > h[st.back()])
            st.pop_back();
        if (!st.empty())
            adj[h[i]].push_back(st.back());
        st.push_back(i);
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    vector<int> start, end;
    for (int i = a; i <= b; i++)
        start.push_back(i);
    for (int i = c; i <= d; i++)
        start.push_back(i);
    return bfs(start, end);
}

• 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