oj.uz

Submission #984425

# Submission time Handle Problem Language Result Execution time Memory
984425 2024-05-16T16:04:58 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1039 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);
    }
    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++;
    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 0 ms 2392 KB Output is correct
3 Correct 182 ms 91164 KB Output is correct
4 Correct 1037 ms 109224 KB Output is correct
5 Correct 804 ms 59204 KB Output is correct
6 Correct 1039 ms 109244 KB Output is correct
7 Correct 736 ms 78716 KB Output is correct
8 Correct 1016 ms 109068 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 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 1 ms 4440 KB Output is correct
6 Incorrect 2 ms 4440 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 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 1 ms 4440 KB Output is correct
6 Incorrect 2 ms 4440 KB Output isn't correct
7 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 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 105 ms 93412 KB Output is correct
6 Correct 119 ms 107448 KB Output is correct
7 Correct 55 ms 61648 KB Output is correct
8 Correct 109 ms 107344 KB Output is correct
9 Correct 13 ms 23640 KB Output is correct
10 Correct 118 ms 107588 KB Output is correct
11 Correct 124 ms 109228 KB Output is correct
12 Correct 121 ms 108928 KB Output is correct
13 Correct 128 ms 108532 KB Output is correct
14 Correct 116 ms 107704 KB Output is correct
15 Incorrect 126 ms 108232 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2736 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 203 ms 55572 KB Output is correct
5 Correct 776 ms 107468 KB Output is correct
6 Correct 453 ms 23640 KB Output is correct
7 Correct 669 ms 107460 KB Output is correct
8 Correct 475 ms 42704 KB Output is correct
9 Correct 743 ms 107580 KB Output is correct
10 Correct 953 ms 109136 KB Output is correct
11 Correct 857 ms 109104 KB Output is correct
12 Correct 968 ms 109004 KB Output is correct
13 Correct 741 ms 107472 KB Output is correct
14 Correct 948 ms 108244 KB Output is correct
15 Correct 722 ms 109204 KB Output is correct
16 Correct 695 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 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 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 12 ms 8792 KB Output is correct
28 Correct 14 ms 8792 KB Output is correct
29 Correct 11 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 9 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 73 ms 68100 KB Output is correct
34 Correct 108 ms 107588 KB Output is correct
35 Correct 122 ms 108980 KB Output is correct
36 Correct 111 ms 107596 KB Output is correct
37 Correct 131 ms 108216 KB Output is correct
38 Correct 113 ms 109040 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2736 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 203 ms 55572 KB Output is correct
5 Correct 776 ms 107468 KB Output is correct
6 Correct 453 ms 23640 KB Output is correct
7 Correct 669 ms 107460 KB Output is correct
8 Correct 475 ms 42704 KB Output is correct
9 Correct 743 ms 107580 KB Output is correct
10 Correct 953 ms 109136 KB Output is correct
11 Correct 857 ms 109104 KB Output is correct
12 Correct 968 ms 109004 KB Output is correct
13 Correct 741 ms 107472 KB Output is correct
14 Correct 948 ms 108244 KB Output is correct
15 Correct 722 ms 109204 KB Output is correct
16 Correct 695 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 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 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 12 ms 8792 KB Output is correct
28 Correct 14 ms 8792 KB Output is correct
29 Correct 11 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 9 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 73 ms 68100 KB Output is correct
34 Correct 108 ms 107588 KB Output is correct
35 Correct 122 ms 108980 KB Output is correct
36 Correct 111 ms 107596 KB Output is correct
37 Correct 131 ms 108216 KB Output is correct
38 Correct 113 ms 109040 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 0 ms 2392 KB Output is correct
42 Correct 216 ms 55384 KB Output is correct
43 Correct 733 ms 107580 KB Output is correct
44 Correct 461 ms 23640 KB Output is correct
45 Correct 754 ms 107464 KB Output is correct
46 Correct 429 ms 42720 KB Output is correct
47 Correct 715 ms 107584 KB Output is correct
48 Correct 947 ms 109232 KB Output is correct
49 Correct 851 ms 109000 KB Output is correct
50 Correct 983 ms 108992 KB Output is correct
51 Correct 700 ms 107588 KB Output is correct
52 Correct 905 ms 108220 KB Output is correct
53 Correct 720 ms 109228 KB Output is correct
54 Correct 790 ms 109236 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 165 ms 107428 KB Output is correct
57 Correct 755 ms 107560 KB Output is correct
58 Correct 342 ms 23632 KB Output is correct
59 Correct 785 ms 107544 KB Output is correct
60 Correct 323 ms 42948 KB Output is correct
61 Correct 739 ms 107584 KB Output is correct
62 Correct 984 ms 109240 KB Output is correct
63 Correct 850 ms 108612 KB Output is correct
64 Correct 852 ms 108728 KB Output is correct
65 Correct 783 ms 107444 KB Output is correct
66 Correct 888 ms 108232 KB Output is correct
67 Correct 744 ms 109232 KB Output is correct
68 Correct 775 ms 108988 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 4600 KB Output is correct
72 Correct 2 ms 4440 KB Output is correct
73 Correct 2 ms 4440 KB Output is correct
74 Correct 1 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 1 ms 4440 KB Output is correct
80 Correct 2 ms 4440 KB Output is correct
81 Correct 1 ms 4440 KB Output is correct
82 Correct 1 ms 4440 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 11 ms 8792 KB Output is correct
87 Correct 12 ms 8792 KB Output is correct
88 Correct 12 ms 8792 KB Output is correct
89 Correct 11 ms 9044 KB Output is correct
90 Correct 9 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 12 ms 8848 KB Output is correct
94 Correct 12 ms 8792 KB Output is correct
95 Correct 11 ms 8792 KB Output is correct
96 Correct 13 ms 8792 KB Output is correct
97 Correct 11 ms 8792 KB Output is correct
98 Correct 1 ms 2392 KB Output is correct
99 Correct 111 ms 107508 KB Output is correct
100 Correct 115 ms 107448 KB Output is correct
101 Correct 122 ms 108836 KB Output is correct
102 Correct 113 ms 107448 KB Output is correct
103 Correct 140 ms 108216 KB Output is correct
104 Correct 113 ms 109008 KB Output is correct
105 Correct 1 ms 2392 KB Output is correct
106 Correct 65 ms 68084 KB Output is correct
107 Correct 111 ms 107500 KB Output is correct
108 Correct 122 ms 108828 KB Output is correct
109 Correct 116 ms 107460 KB Output is correct
110 Correct 127 ms 108216 KB Output is correct
111 Correct 110 ms 109032 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 0 ms 2392 KB Output is correct
3 Correct 182 ms 91164 KB Output is correct
4 Correct 1037 ms 109224 KB Output is correct
5 Correct 804 ms 59204 KB Output is correct
6 Correct 1039 ms 109244 KB Output is correct
7 Correct 736 ms 78716 KB Output is correct
8 Correct 1016 ms 109068 KB Output is correct
9 Correct 2 ms 4436 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 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 Incorrect 2 ms 4440 KB Output isn't correct
15 Halted 0 ms 0 KB -