Submission #1047560

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1047560	2024-08-07 14:02:57	Marco_Escandon	Rainforest Jumps (APIO21_jumps)	C++11	33 / 100	4066 ms	85796 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;
typedef long long ll;
ll n;
vector<vector<ll>>PD,PI;
void init(int N, std::vector<int> h)
{
    n=N; stack<ll> q;
    PD.assign(24,vector<ll>(n+6,n+5));
    PI.assign(24,vector<ll>(n+6,-1));
    for(int i=0; i<n; i++)
    {
        while(!q.empty()&&h[i]>h[q.top()])
        {
            PD[0][q.top()]=i;
            q.pop();
        }
        if(!q.empty()) PI[0][i]=q.top();
        q.push(i);
    }
    for(int i=1; i<24; i++)
        for(int j=0; j<n+6; j++)
            PD[i][j]=PD[i-1][PD[i-1][j]];
}
vector<ll> cache;
ll asd,asd2;
ll asdf;
ll sol(ll node)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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