Submission #1193938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193938		ezzzay	Rainforest Jumps (APIO21_jumps)	C++20	0 / 100	2143 ms	18372 KiB

jumps

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
vector<int>v[400000];
vector<int>dst(3e5);
void init(int N, std::vector<int> H){
    
	for(int i=0;i<3e5;i++)dst[i]=1e6;
	vector<pair<int,int>>vc;
    for(int i=0;i<N;i++){
        while(!vc.empty()){
            if(vc.back().ff<H[i])vc.pop_back();
            else{
            	v[i].pb(vc.back().ss);
            	break;
            }
        }
        vc.pb({H[i],i});
    }
    vc.clear();
    for(int i=N-1;i>=0;i--){
        while(!vc.empty()){
            if(vc.back().ff<H[i])vc.pop_back();
            else{
            	v[i].pb(vc.back().ss);
            	break;
            }
        }
        vc.pb({H[i],i});
    }
}

int minimum_jumps(int A, int B, int C, int D) {
	queue<int>q;
	for(int i=A;i<=B;i++){
		dst[i]=0;
		q.push(i);
	}
	while(!q.empty()){
		int a=q.front();
		q.pop();
		for(auto b:v[a]){
			if(dst[b]>dst[a]+1){
				dst[b]=dst[a]+1;
				q.push(b);
			}
		}
	}
	int ans=1e6;
	for(int i=C;i<=D;i++){
		ans=min(ans,dst[i]);
	}
	if(ans==1e6)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