제출 #1054323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054323		stdfloat	Rainforest Jumps (APIO21_jumps)	C++17	21 / 100	4094 ms	1048576 KiB

jumps

#include <bits/stdc++.h>
#include "jumps.h"
using namespace std;

vector<vector<int>> E, dis;

void init(int n, vector<int> v) {
    E.assign(n, {});
    for (int i = 0; i < n; i++) {
        for (int j = i - 1; j >= 0; j--) {
            if (v[i] < v[j]) {
                E[i].push_back(j);
                break;
            }
        }
        
        for (int j = i + 1; j < n; j++) {
            if (v[i] < v[j]) {
                E[i].push_back(j);
                break;
            }
        }
    }
    
    dis.assign(n, vector<int>(n, INT_MAX));
    for (int i = 0; i < n; i++) {
        queue<int> q;
        q.push(i); dis[i][i] = 0;
        while (!q.empty()) {
            int x = q.front(); q.pop();

            for (auto j : E[x]) {
                if (dis[i][j] == INT_MAX) {
                    dis[i][j] = dis[i][x] + 1;
                    q.push(j);
                }
            }
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    int mn = INT_MAX;
    for (int i = A; i <= B; i++) {
        for (int j = C; j <= D; j++) {
            mn = min(mn, dis[i][j]);
        }
    }

    return (mn == INT_MAX ? -1 : mn);
}

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