제출 #981161

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

jumps

#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v,a,b;
void init(int N, vector<int> H) {
	n=N;
	v=H;
	a.resize(n,-1);
	b.resize(n,-1);
	vector<int> st;
	for(int i=0;i<n;i++){
		while(st.size()&&v[st.back()]<v[i]){
			st.pop_back();
		}
		a[i]=(st.size()?st.back():-1);
		st.push_back(i);
	}
	st.clear();
	for(int i=n-1;i>=0;i--){
		while(st.size()&&v[st.back()]<v[i]){
			st.pop_back();
		}
		b[i]=(st.size()?st.back():-1);
		st.push_back(i);
	}
	for(int i=0;i<n;i++){
		if(a[i]==-1)swap(a[i],b[i]);
		else if(b[i]==-1)continue;
		else {
			if(v[a[i]]<v[b[i]]){
				swap(a[i],b[i]);
			}
		}
	}
}
int f(int A, int C) {
    int ans=0;
	int now=A;
	while(now!=C){
		if(v[now]>v[C])return 1e9;
		if(a[now]==-1&&b[now]==-1){
			return 1e9;
		}
		if(a[now]==-1)now=b[now];
		else if(b[now]==-1)now=a[now];
		else{
			int g1=a[now],g2=b[now];
			if(v[g1]<=v[C])now=g1;
			else if(v[g2]<=v[C])now=g2;
			else return 1e9;
		}
		ans++;
	}
	return ans;
}
int minimum_jumps(int A, int B, int C, int D) {
    int ans=1e9;
	for(int i=A;i<=B;i++){
		for(int j=C;j<=D;j++){
			ans=min(ans,f(i,j));
		}
	}
	if(ans==1e9)ans=-1;
	return ans;
}

• 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