제출 #1196834

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196834		GoBananas69	Rainforest Jumps (APIO21_jumps)	C++20	37 / 100	4043 ms	13716 KiB

jumps

#include <cassert>
#include <cstdio>
#include <queue>
#include <vector>
#include <iostream>
#include "jumps.h"
using namespace std;
vector<vector<int>> adj;
bool subtask1 = true;
void init(int n, vector<int> h) {
    adj.resize(n);
    vector<int> q;
    for (int i = 0; i < n; ++i) {
        if (h[i] != i + 1) subtask1 = false;
        while (!q.empty() && h[q.back()] < h[i]) {
            q.pop_back();
        }
        if (!q.empty()) {
            adj[i].push_back(q.back());
        }
        q.push_back(i);
    }
    q.clear();
    for (int i = n - 1; i>=0; --i) {
        while (!q.empty() && h[q.back()] < h[i]) {
            q.pop_back();
        }
        if (!q.empty()) {
            adj[i].push_back(q.back());
        }
        q.push_back(i);
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if (subtask1) {
        return C - B;
    }
    queue<int> q;
    int n = adj.size();
    vector<int> dist(n, -1);
    for (int i = A; i <= B; ++i) {
        q.push(i);
        dist[i] = 0;
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int &v : adj[u]) {
            if (C <= v && v <= D) return dist[u] + 1;
            if (dist[v] != -1) continue;
            dist[v] = dist[u] + 1;
            q.push(v);
        }
    }
    
    return -1;
}

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