Submission #1193914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193914		ezzzay	밀림 점프 (APIO21_jumps)	C++20	0 / 100	0 ms	512 KiB

jumps

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
vector<int>v[4000];
int dst[4000][4000];
void init(int N, std::vector<int> H){
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			if(H[j]>=H[i]){
				v[i].pb(j);
				break;
			}
		}
	}
	for(int i=0;i<N;i++){
		for(int j=i-1;j>=0;j--){
			if(H[j]>=H[i]){
				v[i].pb(j);
				break;
			}
		}
	}
	for(int i=0;i<N;i++){
		queue<int>q;
		q.push(i);
		while(!q.empty()){
			int a=q.front();
			q.pop();
			for(auto b:v[a]){
				if(b!=i and dst[i][b]==0){
					dst[i][b]=dst[i][a]+1;
					q.push(b);
				}
			}
		}
	}
	
}
int minimum_jumps(int A, int B, int C, int D) {
	int ans= 2e5;
	for(int i=A;i<B;i++){
		for(int j=C;j<D;j++){
			ans=min(ans,dst[i][j]);
		}
	}
	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