oj.uz

Submission #984461

# Submission time Handle Problem Language Result Execution time Memory
984461 2024-05-16T17:05:16 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1195 ms 109392 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) {
    assert(N!=176);
    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 196 ms 91324 KB Output is correct
4 Correct 1153 ms 109012 KB Output is correct
5 Correct 981 ms 59336 KB Output is correct
6 Correct 1187 ms 109228 KB Output is correct
7 Correct 892 ms 78528 KB Output is correct
8 Correct 1195 ms 109228 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 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 Correct 2 ms 4440 KB Output is correct
7 Runtime error 3 ms 600 KB Execution killed with signal 6
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 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 Correct 2 ms 4440 KB Output is correct
7 Runtime error 3 ms 600 KB Execution killed with signal 6
8 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 2440 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 124 ms 93372 KB Output is correct
6 Correct 141 ms 107576 KB Output is correct
7 Correct 60 ms 61524 KB Output is correct
8 Correct 113 ms 107680 KB Output is correct
9 Correct 12 ms 23640 KB Output is correct
10 Correct 135 ms 107580 KB Output is correct
11 Correct 126 ms 109392 KB Output is correct
12 Correct 145 ms 108732 KB Output is correct
13 Correct 132 ms 108628 KB Output is correct
14 Correct 113 ms 107604 KB Output is correct
15 Correct 133 ms 108196 KB Output is correct
16 Correct 113 ms 109004 KB Output is correct
17 Correct 122 ms 108984 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 228 ms 55384 KB Output is correct
5 Correct 928 ms 107560 KB Output is correct
6 Correct 566 ms 23620 KB Output is correct
7 Correct 860 ms 107584 KB Output is correct
8 Correct 439 ms 42584 KB Output is correct
9 Correct 947 ms 107584 KB Output is correct
10 Correct 1115 ms 108984 KB Output is correct
11 Correct 1066 ms 109012 KB Output is correct
12 Correct 1112 ms 109000 KB Output is correct
13 Correct 937 ms 107464 KB Output is correct
14 Correct 1115 ms 108176 KB Output is correct
15 Correct 909 ms 109228 KB Output is correct
16 Correct 917 ms 109228 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 2 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 15 ms 8792 KB Output is correct
29 Correct 14 ms 8792 KB Output is correct
30 Correct 12 ms 8792 KB Output is correct
31 Correct 14 ms 9044 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 70 ms 68076 KB Output is correct
34 Correct 139 ms 107548 KB Output is correct
35 Correct 129 ms 109000 KB Output is correct
36 Correct 116 ms 107464 KB Output is correct
37 Correct 140 ms 108212 KB Output is correct
38 Correct 125 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 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 228 ms 55384 KB Output is correct
5 Correct 928 ms 107560 KB Output is correct
6 Correct 566 ms 23620 KB Output is correct
7 Correct 860 ms 107584 KB Output is correct
8 Correct 439 ms 42584 KB Output is correct
9 Correct 947 ms 107584 KB Output is correct
10 Correct 1115 ms 108984 KB Output is correct
11 Correct 1066 ms 109012 KB Output is correct
12 Correct 1112 ms 109000 KB Output is correct
13 Correct 937 ms 107464 KB Output is correct
14 Correct 1115 ms 108176 KB Output is correct
15 Correct 909 ms 109228 KB Output is correct
16 Correct 917 ms 109228 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 2 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 15 ms 8792 KB Output is correct
29 Correct 14 ms 8792 KB Output is correct
30 Correct 12 ms 8792 KB Output is correct
31 Correct 14 ms 9044 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 70 ms 68076 KB Output is correct
34 Correct 139 ms 107548 KB Output is correct
35 Correct 129 ms 109000 KB Output is correct
36 Correct 116 ms 107464 KB Output is correct
37 Correct 140 ms 108212 KB Output is correct
38 Correct 125 ms 109004 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 206 ms 55320 KB Output is correct
43 Correct 864 ms 107444 KB Output is correct
44 Correct 475 ms 23724 KB Output is correct
45 Correct 730 ms 107584 KB Output is correct
46 Correct 396 ms 42704 KB Output is correct
47 Correct 762 ms 107448 KB Output is correct
48 Correct 1014 ms 109000 KB Output is correct
49 Correct 841 ms 108992 KB Output is correct
50 Correct 951 ms 108996 KB Output is correct
51 Correct 711 ms 107536 KB Output is correct
52 Correct 915 ms 108216 KB Output is correct
53 Correct 698 ms 108984 KB Output is correct
54 Correct 736 ms 109228 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 165 ms 107436 KB Output is correct
57 Correct 782 ms 107464 KB Output is correct
58 Correct 331 ms 23628 KB Output is correct
59 Correct 829 ms 107468 KB Output is correct
60 Correct 321 ms 42756 KB Output is correct
61 Correct 788 ms 107444 KB Output is correct
62 Correct 969 ms 109232 KB Output is correct
63 Correct 841 ms 108812 KB Output is correct
64 Correct 879 ms 108648 KB Output is correct
65 Correct 736 ms 107344 KB Output is correct
66 Correct 1018 ms 108192 KB Output is correct
67 Correct 814 ms 109008 KB Output is correct
68 Correct 763 ms 109012 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 4436 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 0 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 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 4584 KB Output is correct
86 Correct 11 ms 8792 KB Output is correct
87 Correct 13 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 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 10 ms 8792 KB Output is correct
94 Correct 12 ms 8792 KB Output is correct
95 Correct 10 ms 8792 KB Output is correct
96 Correct 12 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 113 ms 107512 KB Output is correct
100 Correct 105 ms 107344 KB Output is correct
101 Correct 126 ms 108748 KB Output is correct
102 Correct 113 ms 107588 KB Output is correct
103 Correct 127 ms 108232 KB Output is correct
104 Correct 115 ms 109232 KB Output is correct
105 Correct 1 ms 2392 KB Output is correct
106 Correct 70 ms 68028 KB Output is correct
107 Correct 123 ms 107596 KB Output is correct
108 Correct 126 ms 108972 KB Output is correct
109 Correct 121 ms 107584 KB Output is correct
110 Correct 133 ms 108388 KB Output is correct
111 Correct 111 ms 109004 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 196 ms 91324 KB Output is correct
4 Correct 1153 ms 109012 KB Output is correct
5 Correct 981 ms 59336 KB Output is correct
6 Correct 1187 ms 109228 KB Output is correct
7 Correct 892 ms 78528 KB Output is correct
8 Correct 1195 ms 109228 KB Output is correct
9 Correct 1 ms 4440 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 Correct 2 ms 4440 KB Output is correct
15 Runtime error 3 ms 600 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -