Submission #550370

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
550370	2022-04-18 00:57:07	Killer2501	Rainforest Jumps (APIO21_jumps)	C++14	100 / 100	1173 ms	50540 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;
const int N = 2e5+5;
int L[N][20], R[N][20], P[N][20], a[N];
void init(int n, vector<int> A)
{
    for(int i = 1; i <= n; i ++)a[i] = A[i-1];
    stack<int> st;
    for(int i = 1; i <= n; i ++)
    {
        while(!st.empty() && a[i] > a[st.top()])st.pop();
        L[i][0] = st.empty() ? 0 : st.top();
        st.push(i);
    }
    while(!st.empty())st.pop();
    for(int i = n; i > 0; i --)
    {
        while(!st.empty() && a[i] > a[st.top()])st.pop();
        R[i][0] = st.empty() ? n+1 : st.top();
        P[i][0] = (a[L[i][0]] < a[R[i][0]] ? R[i][0] : L[i][0]);
        st.push(i);
    }
    //for(int i = 1; i <= n; i ++)cout << L[i][0] <<" "<<R[i][0] <<" "<<P[i][0] << '\n';
    for(int j = 1; j <= 18; j ++)
    {
        for(int i = 1; i <= n; i ++)
        {
            L[i][j] = L[L[i][j-1]][j-1];
            if(R[i][j-1] == n+1)R[i][j] = n+1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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