제출 #981591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981591		Muhammad_Aneeq	밀림 점프 (APIO21_jumps)	C++17	37 / 100	4070 ms	25256 KiB

jumps

#include "jumps.h"
#include <vector>
#include <set>
#include <cmath>
#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
int const N=2e5+10,LG=20;
int mx[N][LG]={};
int nextmx[N]={},premx[N]={};
bool uni=0;
vector<int>nei[N]={};
int dis[N]={};
int n;
void init(int N,vector<int> H) 
{
  n=N;
  uni=is_sorted(begin(H),end(H));
  deque<int>d;
  for (int i=0;i<N;i++)
  {
    nextmx[i]=-1;
    if (d.empty())
    {
      d.push_front(i);
      continue;
    }
    while (d.size()&&H[d.front()]<H[i])
    {
      nextmx[d.front()]=i;
      d.pop_front();
    }
    d.push_front(i);
  }
  d={};
  for (int i=N-1;i>=0;i--)
  {
    premx[i]=-1;
    if (d.empty())
    {
      d.push_front(i);
      continue;
    }
    while (d.size()&&H[d.front()]<H[i])
    {
      premx[d.front()]=i;
      d.pop_front();
    }
    d.push_front(i);
  }
  for (int i=0;i<N;i++)
  {
    if (premx[i]!=-1)
      nei[i].push_back(premx[i]);
    if (nextmx[i]!=-1)
      nei[i].push_back(nextmx[i]);
  }
}
int minimum_jumps(int A, int B, int C, int D) 
{
  if (uni)
    return C-B;
  set<pair<int,int>>s;
  for (int i=0;i<n;i++)
  {
    dis[i]=1e9+10;
    if (i>=A&&i<=B)
    {
      s.insert({0,i});
      dis[i]=0;
    }
  }
  while (s.size())
  {
    int st=(*begin(s)).second;
    if (st>=C&&st<=D)
      return (*begin(s)).first;
    s.erase(*begin(s));
    for (auto i:nei[st])
    {
      if (dis[i]>dis[st]+1)
      {
        dis[i]=dis[st]+1;
        s.insert({dis[i],i});
      }
    }
  }
  return -1;
}

• Subtask 1: 4 / 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