Submission #1101300

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1101300	2024-10-16 03:59:48	Sunbae	Rainforest Jumps (APIO21_jumps)	C++17	33 / 100	4014 ms	15972 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 z exit(0)
using namespace std;
const int MXN = 2e5 + 5;
vector<int> g[MXN];
queue<int> q;
int stk[MXN], nxt[2][MXN], d[MXN], n, sz;
bool V(int i){ return 0 <= i && i < n;}
void init(int N, vector<int> H){
  n = N; 
  int st = sz = 0, ed = n, del = 1;
  for(int j = 0; j<2; ++j){
    for(int i = st; i != ed; i += del){
      while(sz && H[stk[sz-1]] <= H[i]) --sz;
      if(sz) nxt[j][i] = stk[sz-1];
      stk[sz++] = i;
    }
    st = n-1; ed = del = -1; sz = 0;
  }
    for(int j = 0; j<2; ++j){
        for(int i = 0; i<n; ++i){
            if(V(nxt[j][i])) g[i].push_back(nxt[j][i]);
        }
    }
}
int minimum_jumps(int A, int B, int C, int D){
  while(!q.empty()) q.pop();
    fill(d, d+n, 1e8);
    for(int i = A; i<=B; ++i) d[i] = 0, q.emplace(i);
    while(!q.empty()){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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