oj.uz

Submission #984452

# Submission time Handle Problem Language Result Execution time Memory
984452 2024-05-16T16:51:27 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1286 ms 109244 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++;
    }
    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 206 ms 91332 KB Output is correct
4 Correct 1286 ms 109232 KB Output is correct
5 Correct 978 ms 59336 KB Output is correct
6 Correct 1176 ms 108984 KB Output is correct
7 Correct 915 ms 78960 KB Output is correct
8 Correct 1226 ms 109000 KB Output is correct

Subtask #2
0 / 8.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 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 2 ms 4440 KB Output is correct
7 Incorrect 1 ms 4440 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 2 ms 4440 KB Output is correct
7 Incorrect 1 ms 4440 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2392 KB Output is correct
5 Correct 112 ms 91680 KB Output is correct
6 Correct 143 ms 107468 KB Output is correct
7 Correct 62 ms 61704 KB Output is correct
8 Correct 156 ms 107580 KB Output is correct
9 Correct 15 ms 23640 KB Output is correct
10 Correct 124 ms 107580 KB Output is correct
11 Correct 145 ms 108988 KB Output is correct
12 Correct 133 ms 108784 KB Output is correct
13 Correct 137 ms 108556 KB Output is correct
14 Correct 136 ms 107600 KB Output is correct
15 Correct 144 ms 108240 KB Output is correct
16 Correct 107 ms 108880 KB Output is correct
17 Correct 140 ms 108980 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Incorrect 1 ms 4440 KB Output isn't correct
25 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 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 220 ms 55404 KB Output is correct
5 Correct 880 ms 107452 KB Output is correct
6 Correct 493 ms 23612 KB Output is correct
7 Correct 870 ms 107580 KB Output is correct
8 Correct 469 ms 42584 KB Output is correct
9 Correct 857 ms 107580 KB Output is correct
10 Correct 1143 ms 109228 KB Output is correct
11 Correct 1046 ms 109116 KB Output is correct
12 Correct 1147 ms 108764 KB Output is correct
13 Correct 925 ms 107584 KB Output is correct
14 Correct 1116 ms 108224 KB Output is correct
15 Correct 953 ms 108980 KB Output is correct
16 Correct 940 ms 109136 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4600 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 2 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 16 ms 8792 KB Output is correct
28 Correct 13 ms 8792 KB Output is correct
29 Correct 13 ms 8792 KB Output is correct
30 Correct 13 ms 9044 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 68 ms 68012 KB Output is correct
34 Correct 121 ms 107584 KB Output is correct
35 Correct 128 ms 108980 KB Output is correct
36 Correct 118 ms 107448 KB Output is correct
37 Correct 131 ms 108392 KB Output is correct
38 Correct 128 ms 109160 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 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 220 ms 55404 KB Output is correct
5 Correct 880 ms 107452 KB Output is correct
6 Correct 493 ms 23612 KB Output is correct
7 Correct 870 ms 107580 KB Output is correct
8 Correct 469 ms 42584 KB Output is correct
9 Correct 857 ms 107580 KB Output is correct
10 Correct 1143 ms 109228 KB Output is correct
11 Correct 1046 ms 109116 KB Output is correct
12 Correct 1147 ms 108764 KB Output is correct
13 Correct 925 ms 107584 KB Output is correct
14 Correct 1116 ms 108224 KB Output is correct
15 Correct 953 ms 108980 KB Output is correct
16 Correct 940 ms 109136 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4600 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 2 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 16 ms 8792 KB Output is correct
28 Correct 13 ms 8792 KB Output is correct
29 Correct 13 ms 8792 KB Output is correct
30 Correct 13 ms 9044 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 68 ms 68012 KB Output is correct
34 Correct 121 ms 107584 KB Output is correct
35 Correct 128 ms 108980 KB Output is correct
36 Correct 118 ms 107448 KB Output is correct
37 Correct 131 ms 108392 KB Output is correct
38 Correct 128 ms 109160 KB Output is correct
39 Correct 1 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 194 ms 55384 KB Output is correct
43 Correct 769 ms 107584 KB Output is correct
44 Correct 459 ms 23640 KB Output is correct
45 Correct 737 ms 107544 KB Output is correct
46 Correct 417 ms 42704 KB Output is correct
47 Correct 762 ms 107472 KB Output is correct
48 Correct 1041 ms 108984 KB Output is correct
49 Correct 826 ms 109004 KB Output is correct
50 Correct 947 ms 109016 KB Output is correct
51 Correct 761 ms 107448 KB Output is correct
52 Correct 947 ms 108180 KB Output is correct
53 Correct 783 ms 109004 KB Output is correct
54 Correct 794 ms 109036 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 143 ms 107432 KB Output is correct
57 Correct 795 ms 107568 KB Output is correct
58 Correct 395 ms 23640 KB Output is correct
59 Correct 814 ms 107584 KB Output is correct
60 Correct 315 ms 42576 KB Output is correct
61 Correct 729 ms 107448 KB Output is correct
62 Correct 953 ms 109136 KB Output is correct
63 Correct 872 ms 108740 KB Output is correct
64 Correct 863 ms 108624 KB Output is correct
65 Correct 788 ms 107700 KB Output is correct
66 Correct 976 ms 108232 KB Output is correct
67 Correct 810 ms 109244 KB Output is correct
68 Correct 809 ms 108992 KB Output is correct
69 Correct 0 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 4440 KB Output is correct
73 Correct 2 ms 4440 KB Output is correct
74 Correct 2 ms 4440 KB Output is correct
75 Correct 1 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 1 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 3 ms 4692 KB Output is correct
83 Correct 1 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 11 ms 8792 KB Output is correct
88 Correct 11 ms 8792 KB Output is correct
89 Correct 10 ms 8792 KB Output is correct
90 Correct 11 ms 7000 KB Output is correct
91 Correct 1 ms 4440 KB Output is correct
92 Correct 1 ms 4440 KB Output is correct
93 Correct 11 ms 8792 KB Output is correct
94 Correct 10 ms 8792 KB Output is correct
95 Correct 9 ms 8792 KB Output is correct
96 Correct 13 ms 8792 KB Output is correct
97 Correct 14 ms 8788 KB Output is correct
98 Correct 1 ms 2392 KB Output is correct
99 Correct 110 ms 107468 KB Output is correct
100 Correct 104 ms 107460 KB Output is correct
101 Correct 114 ms 108624 KB Output is correct
102 Correct 108 ms 107344 KB Output is correct
103 Correct 124 ms 108232 KB Output is correct
104 Correct 135 ms 109140 KB Output is correct
105 Correct 1 ms 2388 KB Output is correct
106 Correct 62 ms 68096 KB Output is correct
107 Correct 123 ms 107464 KB Output is correct
108 Correct 123 ms 108728 KB Output is correct
109 Correct 116 ms 107576 KB Output is correct
110 Correct 121 ms 108244 KB Output is correct
111 Correct 115 ms 109244 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 206 ms 91332 KB Output is correct
4 Correct 1286 ms 109232 KB Output is correct
5 Correct 978 ms 59336 KB Output is correct
6 Correct 1176 ms 108984 KB Output is correct
7 Correct 915 ms 78960 KB Output is correct
8 Correct 1226 ms 109000 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 2 ms 4440 KB Output is correct
15 Incorrect 1 ms 4440 KB Output isn't correct
16 Halted 0 ms 0 KB -