Submission #798307

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
798307	2023-07-30 15:09:09	Soumya1	Rainforest Jumps (APIO21_jumps)	C++17	100 / 100	1026 ms	50472 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 mxN = 2e5 + 5;
const int lg = 20;
int a[mxN], righ[mxN][lg], lef[mxN][lg], best[mxN][lg];
void init(int N, vector<int> H) {
  for (int i = 1; i <= N; i++) a[i] = H[i - 1];
  stack<int> st;
  for (int i = 1; i <= N; i++) {
    while (!st.empty() && a[st.top()] < a[i]) st.pop();
    if (st.empty()) lef[i][0] = i;
    else lef[i][0] = st.top();
    st.push(i);
  }
  while (!st.empty()) st.pop();
  for (int i = N; i >= 1; i--) {
    while (!st.empty() && a[st.top()] < a[i]) st.pop();
    if (st.empty()) righ[i][0] = i;
    else righ[i][0] = st.top();
    st.push(i);
  }
  for (int i = 1; i <= N; i++) {
    if (a[righ[i][0]] > a[lef[i][0]]) best[i][0] = righ[i][0];
    else best[i][0] = lef[i][0];
  }
  for (int j = 1; j < lg; j++) {
    for (int i = 1; i <= N; i++) {
      best[i][j] = best[best[i][j - 1]][j - 1];
      righ[i][j] = righ[righ[i][j - 1]][j - 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