제출 #1307477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307477		repmann	Rainforest Jumps (APIO21_jumps)	C++20	23 / 100	411 ms	34112 KiB

jumps

#include <bits/stdc++.h>
#include "jumps.h"
using namespace std;
int N;
int A[200001];
int MAX[18][200001], MIN[18][200001];
void init(int n, vector <int> a)
{
  N = n;
  for(int i = 1; i <= N; i++) A[i] = a[i - 1];
  stack <pair <int, int>> S;
  for(int i = 1; i <= N; i++)
  {
    while(S.size() && (S.top().first < A[i])) S.pop();
    if(S.size()) MIN[0][i] = S.top().second;
    S.push({A[i], i});
  }
  while(S.size()) S.pop();
  for(int i = N; i >= 1; i--)
  {
    while(S.size() && (S.top().first < A[i])) S.pop();
    if(S.size()) MAX[0][i] = S.top().second;
    S.push({A[i], i});
  }
  for(int i = 1; i <= N; i++) if(A[MIN[0][i]] > A[MAX[0][i]]) swap(MIN[0][i], MAX[0][i]);
  vector <pair <int, int>> V;
  for(int i = 1; i <= N; i++) V.push_back({A[i], i});
  sort(V.begin(), V.end(), greater <pair <int, int>>());
  for(pair <int, int> p : V)
  {
    int i = p.second;
    for(int j = 1; j <= 17; j++) MIN[j][i] = MIN[j - 1][MIN[j - 1][i]];
    for(int j = 1; j <= 17; j++) MAX[j][i] = MAX[j - 1][MAX[j - 1][i]];
  }
  return;
}
int minimum_jumps(int a, int b, int c, int d)
{
  if((a != b) || (c != d)) return -1;
  a++, b++, c++, d++;
  int ret = 0;
  for(int j = 17; j >= 0; j--) if(MAX[j][a] && (A[MAX[j][a]] <= A[c])) {a = MAX[j][a]; ret += 1 << j;}
  for(int j = 17; j >= 0; j--) if(MIN[j][a] && (A[MIN[j][a]] <= A[c])) {a = MIN[j][a]; ret += 1 << j;}
  if(a != c) return -1;
  return ret;
}

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