제출 #418763

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
418763	2021-06-05 20:33:42	REALITYNB	밀림 점프 (APIO21_jumps)	C++14	0 / 100	1 ms	200 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 <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
const int mxn = 20001, mxl = 20;
int n, l[mxn][mxl], r[mxn][mxl];
vector<int> h;
int HE[mxn][mxl];
int good(int x){
  return (0<=x&&x<n);
}
void init(int mxn, vector<int> H){
  vector<pii> sHE;
  set<int> bull;
  for(int i=0;i<n;i++) sHE.push_back(mp(h[i],i));
  n=mxn,h=H;
  sort(all(sHE)) ;
  reverse(all(sHE));
  bull.insert(n); bull.insert(-1);
  for(int i=0;i<mxn;++i)for(int j=0;j<mxl;j++)l[i][j]=r[i][j]=HE[i][j]=-1;
  for (auto xxx : sHE){
    int i=xxx.S ;
    auto it=bull.lower_bound(i);
    r[i][0]=*it,l[i][0]=*(--it);
    bull.insert(i);
    if(!good(l[i][0])&&!good(r[i][0]));
    else if(!good(r[i][0])) HE[i][0]=l[i][0];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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