제출 #960627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960627		Trisanu_Das	밀림 점프 (APIO21_jumps)	C++17	0 / 100	4046 ms	12336 KiB

jumps

#include <bits/stdc++.h>
#include "jumps.h"
using namespace std;
 
int n, dp[200005];
vector<int> h;
 
void init(int N, vector<int> H){
  n = N;
  for(int x : H) h.push_back(x);
}
 
int solve(int s, int c, int d){
  if(c <= s && s <= d) return 0;
  if(dp[s] != -1) return dp[s];
  int ans = INT_MAX;
  for(int i = s + 1; i < n; i++){
    if(h[i] > h[s]){
      ans = min(ans, solve(i, c, d) + 1);
      break;
    }
  }
  for(int i = s - 1; i > -1; i--){
    if(h[i] > h[s]){
      ans = min(ans, solve(i, c, d) + 1);
      break;
    }
  }
  return dp[s] = ans;
}
 
int minimum_jumps(int a, int b, int c, int d){
  memset(dp, -1, sizeof(dp));
  int ans = INT_MAX;
  for(int i = a; i <= b; i++) ans = min(ans, solve(i, c, d));
  if(ans == INT_MAX) ans = -1;
  return ans;
}

• 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