제출 #946452

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

jumps

#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10,lg=20;
int inf=1e9;
int n,all[maxn],fr[maxn],fl[maxn],sp[lg][maxn],spr[lg][maxn],mxsp[lg][maxn];

void pre(){
	all[0]=all[n+1]=inf;
	vector<int>v;
	v.push_back(0);
	for(int i=1;i<=n;i++){
		while((int)v.size()>0&&all[v.back()]<=all[i]){
			v.pop_back();
		}
		fl[i]=v.back();
		v.push_back(i);
	}
	v.clear();
	v.push_back(n+1);
	for(int i=n;i>=1;i--){
		while((int)v.size()>0&&all[v.back()]<=all[i]){
			v.pop_back();
		}
		fr[i]=v.back();
		v.push_back(i);
		mxsp[0][i]=fr[i];
	}
	mxsp[0][n+1]=n+1;
	for(int i=1;i<=n;i++){
		spr[0][i]=fr[i];
		if(all[fr[i]]>=all[fl[i]]){
			sp[0][i]=fr[i];
		}else{
			sp[0][i]=fl[i];
		}
	}
	for(int i=1;i<lg;i++){
		for(int j=1;j<=n;j++){
			sp[i][j]=sp[i-1][sp[i-1][j]];
			spr[i][j]=spr[i-1][spr[i-1][j]];
			mxsp[i][j]=max(mxsp[i-1][j],mxsp[i-1][sp[i-1][j]]);
		}
	}
}

void init(int N,vector<int> H) {
	n=N;
	for(int i=1;i<=n;i++){
		all[i]=H[i-1];
	}
	pre();
}

int cal(int a,int b,int c,int mx){
	if(all[a]>=mx){
		return inf;
	}
	int ret=0;
	for(int i=lg-1;i>=0;i--){
		if(sp[i][a]!=0&&mxsp[i][a]<b){
			ret+=(1<<i);
			a=sp[i][a];
			if(a>=b&&a<=c){
				return ret;
			}
		}
	}
	//cout<<"wtf: "<<a<<" "<<b<<" "<<c<<" "<<ret<<endl;
	for(int i=lg-1;i>=0;i--){
		if(spr[i][a]!=0&&spr[i][a]<b){
			a=spr[i][a];
			ret+=(1<<i);
		}
	}
	if(all[a]>=mx){
		return inf;
	}
	return ret+1;
	/*if(all[a]>mx){
		return inf;
	}
	if(a>=b&&a<=c){
		return 0;
	}
	if(spr[0][a]>=b&&spr[0][a]<=c){
		return 1;
	}
	if(all[sp[0][a]]<=mx){
		return cal(sp[0][a],b,c,mx)+1;
	}
	return cal(spr[0][a],b,c,mx)+1;*/
}

int solve(int a,int b,int c,int d){
	int mxb=all[c];
	for(int i=c;i<=d;i++){
		mxb=max(mxb,all[i]);
	}
	int wh=b,mx=all[b];
	for(int i=b-1;i>=a;i--){
		if(all[i]>=mxb){
			break;
		}
		if(all[i]>mx){
			mx=all[i];
			wh=i;
		}
	}
	int res=cal(wh,c,d,mxb);
	if(res>=inf){
		res=-1;
	}
	return res;
}

int minimum_jumps(int A, int B, int C, int D) {
 	A++;
 	B++;
 	C++;
 	D++;
 	return solve(A,B,C,D);
}

• 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