제출 #960634

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

jumps

#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
 
#include <vector>
#define sz 200005
int n;
vector<int> v;
int dp[sz];
 
void init(int N, std::vector<int> H) {
 
    int i;
    n = N;
    for(i=0;i<N;i++)
        v.push_back(H[i]);
}
 
int FuN(int last,int C,int D)
{
    if(last>=C && last<=D)
        return 0;
    if(dp[last]!=-1)
        return dp[last];
    int ret = 1e9;
 
    for(int i=last+1;i<n;i++){
        if(v[i]>v[last]){
            ret = min(ret,1+FuN(i,C,D));
            break;
        }
    }
    for(int i=last-1;i>=0;i--){
        if(v[i]>v[last]){
            ret = min(ret,1+FuN(i,C,D));
            break;
        }
    }
    return dp[last] = ret;
}
 
int minimum_jumps(int A, int B, int C, int D) {
 
  memset(dp,-1,sizeof(dp));
  int ans=1e9;
  for(int i=A;i<=B;i++)
    ans = min(ans,FuN(i,C,D));
  if(ans==1e9)
    ans = -1;
  return ans;
}

• 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