제출 #565097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565097		Garguy22	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	1 ms	336 KiB

jumps

#include <iostream>
#include <vector>
#include <queue>
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef pair<int, int> pii;

vector<int> adj[2007];
bool vis[2007];

void init(int N, vector<int> H){
	for(int i = 0; i < N; i++){
		for(int j = i-1; j >= 0; j--){
			if(H[j] > H[i]){
				adj[i].pb(j);
				break;
			}
		}
		for(int j = i+1; j < N; j++){
			if(H[j] > H[i]){
				adj[i].pb(j);
				break;
			}
		}
	}
}

int minimum_jumps(int A, int B, int C, int D){
	queue<pii> q;
	for(int i = A; i <= B; i++){
		q.push(mp(0, i));
		vis[i] = 1;
	}
	while(!q.empty()){
		pii u = q.front();
		q.pop();
		if(u.ss >= C && u.ss <= D)
			return u.ff;
		for(int v : adj[u.ss]){
			if(!vis[v]){
				q.push(mp(u.ff + 1, u.ss));
				vis[v] = 1;
			}
		}
	}
	return -1;
}

• 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