제출 #744736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744736		t6twotwo	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	4010 ms	12228 KiB

jumps

#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> H, G;
bool subtask1;
vector<vector<int>> adj;
void init(int n, vector<int> h) {
    N = n, H = h;
    subtask1 = 1;
    for (int i = 0; i < N; i++) {
        H[i]--;
        if (i != H[i]) {
            subtask1 = 0;
        }
    }
    G.resize(N);
    for (int i = 0; i < N; i++) {
        G[H[i]] = i;
    }
    adj.resize(N);
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            if (G[j] > G[i]) {
                adj[i].push_back(j);
                break;
            }
        }
        for (int j = i + 1; j < N; j++) {
            if (G[j] < G[i]) {
                adj[i].push_back(j);
                break;
            }
        }
    }
}
int minimum_jumps(int A, int B, int C, int D) {
    if (subtask1) {
        return C - B;
    }
    vector<int> dis(N, -1);
    queue<int> q;
    for (int i = A; i <= B; i++) {
        dis[H[i]] = 0;
        q.push(H[i]);
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        if (C <= G[x] && G[x] <= D) {
            return dis[x];
        }
        for (int y : adj[x]) {
            if (dis[y] == -1) {
                dis[y] = dis[x] + 1;
                q.push(y);
            }
        }
    }
    return -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