제출 #1167283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167283		adriannok	밀림 점프 (APIO21_jumps)	C++20	33 / 100	4099 ms	15268 KiB

jumps

#include "jumps.h"

#include <bits/stdc++.h>

using namespace std;

int N;
vector<int> H;
vector<int> sorted;
vector< vector<int> > adj;

void init(int n, vector<int> h) 
{
	N = n;
	H = h;
	adj.resize( N );
	
	vector<int> ind(N+1);
	
	{
		stack<int> closest;
	
		for(int i = 0; i < N; ++i)
		{
			ind[H[i]] = i;
			while(!closest.empty() && closest.top() < H[i])
				closest.pop();
			
			if( !closest.empty() )
			{
				adj[i].push_back( ind[closest.top()] );
			}
			closest.push( H[i] );
		}
	}
	
	stack<int> closest;
	for(int i = N-1; i >= 0; --i)
	{
		while(!closest.empty() && closest.top() < H[i])
			closest.pop();
		
		if( !closest.empty() )
		{
			adj[i].push_back( ind[closest.top()] );
		}
		closest.push( H[i] );
	}
}

int minimum_jumps(int A, int B, int C, int D)
{
	int minJ = N+1;
	queue<int> q;
	vector<int> distance(N, N+1);
	
	for(int i = A; i <= B; ++i)
	{
		q.push(i);
		distance[i] = 0;
	}
	
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		
		if( C <= u && u <= D)
			minJ = min(minJ, distance[u]);
		
		for(const int& v : adj[u])
		{
			if(distance[v] <= distance[u] + 1)
				continue;
			distance[v] = distance[u] + 1;
			q.push(v);
		}
	}
	
	if(minJ == N+1)
		minJ = -1;
	return minJ;
}

• Subtask 1: 0 / 4
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19