제출 #440650

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
440650	2021-07-02 16:09:57	Elegia	밀림 점프 (APIO21_jumps)	C++17	100 / 100	1261 ms	46456 KiB

jumps

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "jumps.h"
const int MAX_N = 200010, L = 18;
int N;
int h[MAX_N], left[MAX_N][L], right[MAX_N][L], gr[MAX_N][L];
void init(int _N, std::vector<int> _H) {
  N = _N;
  std::copy(_H.begin(), _H.end(), h + 1);
  static int stack[MAX_N], ord[MAX_N];
  int cnt = 0;
  for (int i = 1; i <= N; ++i) {
    while (cnt && h[i] > h[stack[cnt]])
      right[stack[cnt--]][0] = i;
    left[i][0] = stack[cnt];
    stack[++cnt] = i;
  }
  for (int i = 1; i <= N; ++i) for (int j = 1; j != L; ++j)
    left[i][j] = left[left[i][j - 1]][j - 1];
  std::fill(right[N + 1], right[N + 1] + L, N + 1);
  for (int i = N; i; --i) {
    if (!right[i][0]) right[i][0] = N + 1;
    for (int j = 1; j != L; ++j)
      right[i][j] = right[right[i][j - 1]][j - 1];
  }
  for (int i = 1; i <= N; ++i) ord[h[i]] = i;
  std::fill(gr[N + 1], gr[N + 1] + L, N + 1);
  for (int i = N; i; --i) {
    int j = ord[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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