Submission #858358

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
858358	2023-10-08 08:33:03	chanhchuong123	Rainforest Jumps (APIO21_jumps)	C++14	100 / 100	816 ms	45416 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>
using namespace std;
#define task ""
const int MAX = 200020;
int n, q;
int H[MAX];
stack<int> st;
int dp[18][MAX], rg[18][MAX], hi[18][MAX];
#define combine(x, y) (H[(x)] < H[(y)] ? y : x)
void init(int N, vector<int> _H) {
    n = N;
    for (int i = 0; i < n; ++i) {
        H[i + 1] = _H[i];
    }
    H[0] = H[n + 1] = n + 1; st.push(0);
    for (int i = 1; i <= n; ++i) {
        while (H[st.top()] < H[i]) st.pop();
        hi[0][i] = st.top(); st.push(i);
    }
    st.push(n + 1); rg[0][0] = rg[0][n + 1] = n + 1;
    for (int i = n; i >= 1; --i) {
        while (H[st.top()] < H[i]) st.pop();
        rg[0][i] = st.top(); st.push(i);
    }
    for (int i = 1; i <= n; ++i) {
        dp[0][i] = i;
        hi[0][i] = combine(hi[0][i], rg[0][i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:36:95: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   36 |             if (i + (1 << j) - 1 <= n) dp[j][i] = combine(dp[j - 1][i], dp[j - 1][i + (1 << j - 1)]);
      |                                                                                             ~~^~~
jumps.cpp:10:36: note: in definition of macro 'combine'
   10 | #define combine(x, y) (H[(x)] < H[(y)] ? y : x)
      |                                    ^
jumps.cpp:36:95: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   36 |             if (i + (1 << j) - 1 <= n) dp[j][i] = combine(dp[j - 1][i], dp[j - 1][i + (1 << j - 1)]);
      |                                                                                             ~~^~~
jumps.cpp:10:42: note: in definition of macro 'combine'
   10 | #define combine(x, y) (H[(x)] < H[(y)] ? y : x)
      |                                          ^
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:60:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |         int m = l + r >> 1;
      |                 ~~^~~

• 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