Submission #480443

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
480443	2021-10-16 11:40:58	dantoh000	Rainforest Jumps (APIO21_jumps)	C++14	100 / 100	1483 ms	45208 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"
#include <bits/stdc++.h>
using namespace std;
vector<int> R[18], L[18], U[18];
void init(int N, std::vector<int> H) {
    for (int i = 0; i < 18; i++){
        R[i].resize(N);
        L[i].resize(N);
        U[i].resize(N);
    }
    stack<int> st;
    for (int i = 0; i < N; i++){
        while (st.size() && H[st.top()] < H[i]){
            st.pop();
        }
        if (st.empty()) L[0][i] = -1;
        else L[0][i] = st.top();
        st.push(i);
    }
    while (st.size()) st.pop();
    for (int i = N-1; i >= 0; i--){
        while (st.size() && H[st.top()] < H[i]){
            st.pop();
        }
        if (st.empty()) R[0][i] = -1;
        else R[0][i] = st.top();
        st.push(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