제출 #412311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412311		model_code	밀림 점프 (APIO21_jumps)	C++17	8 / 100	4094 ms	1048580 KiB

jumps

#include "jumps.h"

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

int N;
vector<vector<int>> dist;

void init(int _N, std::vector<int> H) {
  N = _N;
  dist = vector<vector<int>>(N, vector<int>(N, N));
  for (int i = 0; i < N; ++i) {
    for (int j = i - 1; j >= 0; --j) {
      if (H[j] > H[i]) {
        dist[i][j] = 1;
        break;
      }
    }
    for (int j = i + 1; j < N; ++j) {
      if (H[j] > H[i]) {
        dist[i][j] = 1;
        break;
      }
    }
  }
  for (int k = 0; k < N; ++k) {
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < N; ++j) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  int jumps = N;
  for (int st = A; st <= B; ++st) {
    for (int nd = C; nd <= D; ++nd) {
      jumps = min(jumps, dist[st][nd]);
    }
  }
  return jumps == N ? -1 : jumps;
}

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