Submission #1227738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1227738		abdelhakim	밀림 점프 (APIO21_jumps)	C++20	33 / 100	4075 ms	10500 KiB

jumps

#include "jumps.h"
#include <bits/stdc++.h>
#define ll long long
#define inf (ll)(1e15) 
#define dbg(x) cerr <<#x << ' ' << x <<endl;
using namespace std;
ll n;
vector<ll> h;
vector<pair<ll,ll>> mn;
vector<ll> ind;
void init(int N, std::vector<int> H) 
{
  n=N;
  for (int i=0;i<n;i++) h.push_back(H[i]);
  mn.resize(n+1);
  stack<ll> s;
  for (int i=0;i<n;i++)
  {
    while(s.size() && (s.top() < h[i]))
    {
      s.pop();
    }
    if(s.size())
    {
      mn[h[i]].first=s.top();
    }
    s.push(h[i]);
  }
  while(s.size())s.pop();
  for (int i=n-1;i>=0;i--)
  {
    while(s.size() && (s.top() < h[i]))
    {
      s.pop();
    }
    if(s.size())
    {
      mn[h[i]].second=s.top();
    }
    s.push(h[i]);
  }
  // for (int i=1;i<=n;i++){
  //   cout <<"here "<< i << ' ' << mn[i].first << ' ' << mn[i].second << endl;
  // }
  ind.resize(n+1);
  for (int i=0;i<n;i++)
  {
    ind[h[i]]=i;
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  vector<ll> dp(n+1,inf);
  for (int i=n;i>=1;i--)
  {
    if(C<=ind[i] && ind[i]<=D)
    {
      dp[i]=0;
      // dbg(i);
    }
    else
    {
      if(mn[i].first!=0) dp[i]=min(dp[i],1+dp[mn[i].first]);
      if(mn[i].second!=0) dp[i]=min(dp[i],1+dp[mn[i].second]);
      // cout << "here " << i <<  ' ' << dp[i] << endl;
    }
  }
  ll ans=inf;
  for (int i=A;i<=B;i++)
  {
    ans=min(ans,dp[h[i]]);
  }
  if(ans==inf)return -1;
  else return ans;
}

• 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