oj.uz

Submission #984451

# Submission time Handle Problem Language Result Execution time Memory
984451 2024-05-16T16:50:49 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1199 ms 109344 KB 
#include "jumps.h"
 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <vector>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <list>
using namespace std;
typedef long long ll;
vector<ll> v;
ll n;
ll L[202020][22];
ll R[202020][22];
ll M[202020][22];
void init(int N, std::vector<int> H) {
    n=N;
    v.resize(n+1,0);
    for(int i = 1 ; i <= n ; i++)v[i] = H[i-1];
    stack<ll> st;
    for(int i = 1 ; i <= n ; i++){
        while(st.size() and v[st.top()] < v[i]){
            M[st.top()][0] = R[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    while(st.size())st.pop();
    for(int i = n ; i >= 1 ; i--){
        while(st.size() and v[st.top()] < v[i]){
            L[st.top()][0] = i;
            M[st.top()][0] = (v[i] > v[R[st.top()][0]] ? i : R[st.top()][0]);
            st.pop();
        }
        st.push(i);
    }
    for(int j = 1 ; j <= 20 ; j++){
        for(int i = 1 ; i <= n ; i++){
            L[i][j] = L[L[i][j-1]][j-1];
            R[i][j] = R[R[i][j-1]][j-1];
            M[i][j] = M[M[i][j-1]][j-1];
        }
    }
}
 
ll RMQ(ll l, ll r){
    ll ret = l;
    for(int i = 20 ; i >= 0 ; i--){
        if(R[ret][i]>0 and R[ret][i]<=r)ret = R[ret][i];
    }
    return v[ret];
}
int minimum_jumps(int A, int B, int C, int D) {
    A++; B++; C++; D++;
    ll H = RMQ(B,C-1);
    ll mx = RMQ(C,D);
    ll cur = B;
    for(int i = 20 ; i >= 0 ; i--){
        if(L[cur][i]>0 and L[cur][i]>=A and v[L[cur][i]]<=mx)cur = L[cur][i];
    }
    ll ret = 0;
    for(int i = 20 ; i >= 0 ; i--){
        if(M[cur][i]>0 and v[M[cur][i]]<=H)cur = M[cur][i], ret += (1<<i);
    }
    bool flag = 0;
    ll x = ret+1;
    if(v[cur] == H)flag = 1;
    else if(0<M[cur][0] and v[M[cur][0]]<mx){
        cur = M[cur][0], ret++;
        return (C <= R[cur][0] and R[cur][0] <= D ? ret+1 : -1);
    }
    for(int i = 20 ; i >= 0 ; i--){
        if(R[cur][i]>0 and R[cur][i]<C)cur = R[cur][i], ret += (1<<i);
    }
    if(cur<C)cur = R[cur][0], ret++;
    if(flag)assert(x==ret);
    return C <= cur and cur <= D ? ret : -1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 193 ms 91328 KB Output is correct
4 Correct 1082 ms 108996 KB Output is correct
5 Correct 853 ms 59216 KB Output is correct
6 Correct 1014 ms 109032 KB Output is correct
7 Correct 733 ms 78548 KB Output is correct
8 Correct 1039 ms 109240 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4692 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2484 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Incorrect 2 ms 4596 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4692 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2484 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Incorrect 2 ms 4596 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 102 ms 93416 KB Output is correct
6 Correct 113 ms 107536 KB Output is correct
7 Correct 59 ms 61724 KB Output is correct
8 Correct 118 ms 107448 KB Output is correct
9 Correct 11 ms 23640 KB Output is correct
10 Correct 108 ms 107468 KB Output is correct
11 Correct 120 ms 109000 KB Output is correct
12 Incorrect 108 ms 108748 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 191 ms 55336 KB Output is correct
5 Correct 784 ms 107548 KB Output is correct
6 Correct 459 ms 23964 KB Output is correct
7 Correct 758 ms 107432 KB Output is correct
8 Correct 421 ms 42584 KB Output is correct
9 Correct 768 ms 107464 KB Output is correct
10 Correct 1059 ms 109244 KB Output is correct
11 Correct 888 ms 109104 KB Output is correct
12 Correct 985 ms 109256 KB Output is correct
13 Correct 750 ms 107584 KB Output is correct
14 Correct 896 ms 108228 KB Output is correct
15 Correct 752 ms 108992 KB Output is correct
16 Correct 785 ms 109048 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 10 ms 8792 KB Output is correct
29 Correct 12 ms 8664 KB Output is correct
30 Correct 13 ms 8788 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
33 Correct 65 ms 67964 KB Output is correct
34 Correct 112 ms 107580 KB Output is correct
35 Correct 121 ms 108832 KB Output is correct
36 Correct 116 ms 107340 KB Output is correct
37 Correct 127 ms 108240 KB Output is correct
38 Correct 110 ms 109004 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 191 ms 55336 KB Output is correct
5 Correct 784 ms 107548 KB Output is correct
6 Correct 459 ms 23964 KB Output is correct
7 Correct 758 ms 107432 KB Output is correct
8 Correct 421 ms 42584 KB Output is correct
9 Correct 768 ms 107464 KB Output is correct
10 Correct 1059 ms 109244 KB Output is correct
11 Correct 888 ms 109104 KB Output is correct
12 Correct 985 ms 109256 KB Output is correct
13 Correct 750 ms 107584 KB Output is correct
14 Correct 896 ms 108228 KB Output is correct
15 Correct 752 ms 108992 KB Output is correct
16 Correct 785 ms 109048 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 10 ms 8792 KB Output is correct
29 Correct 12 ms 8664 KB Output is correct
30 Correct 13 ms 8788 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
33 Correct 65 ms 67964 KB Output is correct
34 Correct 112 ms 107580 KB Output is correct
35 Correct 121 ms 108832 KB Output is correct
36 Correct 116 ms 107340 KB Output is correct
37 Correct 127 ms 108240 KB Output is correct
38 Correct 110 ms 109004 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 1 ms 2392 KB Output is correct
42 Correct 207 ms 55384 KB Output is correct
43 Correct 755 ms 107448 KB Output is correct
44 Correct 473 ms 23712 KB Output is correct
45 Correct 947 ms 107580 KB Output is correct
46 Correct 472 ms 42744 KB Output is correct
47 Correct 916 ms 107600 KB Output is correct
48 Correct 1114 ms 109244 KB Output is correct
49 Correct 1022 ms 109004 KB Output is correct
50 Correct 1117 ms 109000 KB Output is correct
51 Correct 762 ms 107532 KB Output is correct
52 Correct 944 ms 108176 KB Output is correct
53 Correct 722 ms 108988 KB Output is correct
54 Correct 865 ms 108980 KB Output is correct
55 Correct 1 ms 2388 KB Output is correct
56 Correct 172 ms 107204 KB Output is correct
57 Correct 900 ms 107464 KB Output is correct
58 Correct 404 ms 23628 KB Output is correct
59 Correct 894 ms 107592 KB Output is correct
60 Correct 360 ms 42768 KB Output is correct
61 Correct 955 ms 107460 KB Output is correct
62 Correct 1199 ms 109244 KB Output is correct
63 Correct 1120 ms 108816 KB Output is correct
64 Correct 1014 ms 108408 KB Output is correct
65 Correct 950 ms 107448 KB Output is correct
66 Correct 1123 ms 108184 KB Output is correct
67 Correct 999 ms 109344 KB Output is correct
68 Correct 769 ms 109228 KB Output is correct
69 Correct 1 ms 2392 KB Output is correct
70 Correct 1 ms 4440 KB Output is correct
71 Correct 2 ms 4440 KB Output is correct
72 Correct 2 ms 4444 KB Output is correct
73 Correct 2 ms 4440 KB Output is correct
74 Correct 2 ms 4440 KB Output is correct
75 Correct 2 ms 4440 KB Output is correct
76 Correct 1 ms 4440 KB Output is correct
77 Correct 1 ms 2392 KB Output is correct
78 Correct 1 ms 4440 KB Output is correct
79 Correct 2 ms 4440 KB Output is correct
80 Correct 2 ms 4440 KB Output is correct
81 Correct 2 ms 4440 KB Output is correct
82 Correct 2 ms 4572 KB Output is correct
83 Correct 2 ms 4440 KB Output is correct
84 Correct 1 ms 4440 KB Output is correct
85 Correct 2 ms 4440 KB Output is correct
86 Correct 10 ms 8792 KB Output is correct
87 Correct 12 ms 8796 KB Output is correct
88 Correct 12 ms 8792 KB Output is correct
89 Correct 15 ms 8792 KB Output is correct
90 Correct 13 ms 7000 KB Output is correct
91 Correct 1 ms 4692 KB Output is correct
92 Correct 2 ms 4440 KB Output is correct
93 Correct 13 ms 8792 KB Output is correct
94 Correct 12 ms 8792 KB Output is correct
95 Correct 13 ms 8792 KB Output is correct
96 Correct 12 ms 8792 KB Output is correct
97 Correct 15 ms 8792 KB Output is correct
98 Correct 1 ms 2388 KB Output is correct
99 Correct 139 ms 107512 KB Output is correct
100 Correct 120 ms 107664 KB Output is correct
101 Correct 143 ms 108832 KB Output is correct
102 Correct 135 ms 107588 KB Output is correct
103 Correct 138 ms 108232 KB Output is correct
104 Correct 120 ms 109008 KB Output is correct
105 Correct 1 ms 2552 KB Output is correct
106 Correct 68 ms 68032 KB Output is correct
107 Correct 123 ms 107596 KB Output is correct
108 Correct 144 ms 108756 KB Output is correct
109 Correct 132 ms 107584 KB Output is correct
110 Correct 149 ms 108240 KB Output is correct
111 Correct 120 ms 109236 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 193 ms 91328 KB Output is correct
4 Correct 1082 ms 108996 KB Output is correct
5 Correct 853 ms 59216 KB Output is correct
6 Correct 1014 ms 109032 KB Output is correct
7 Correct 733 ms 78548 KB Output is correct
8 Correct 1039 ms 109240 KB Output is correct
9 Correct 1 ms 4692 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2484 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Incorrect 2 ms 4596 KB Output isn't correct
14 Halted 0 ms 0 KB -