oj.uz

Submission #618029

# Submission time Handle Problem Language Result Execution time Memory
618029 2022-08-01T19:37:52 Z AmirElarbi Rainforest Jumps (APIO21_jumps) C++14
56 / 100
 4000 ms 75596 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 4e5+5;
const int lg = 30;
int nxt[nax][lg],lst[nax][lg], mx[nax],bst[nax][lg];
vi s;
void init(int n, vi h) {
    s = h;
    stack<ii> st;
    for (int i = n-1; i >= 0; --i)
    {
        while(!st.empty() && st.top().fi <= h[i]){
            st.pop();
        }
        if(st.empty()) bst[i][0] = nxt[i][0] = i; 
        else bst[i][0] = nxt[i][0] = st.top().se, mx[i] = st.top().fi;
        st.push({h[i], i});
    }
    while(!st.empty()) st.pop();
    for (int i = 0; i < n-1; ++i)
    {
        while(!st.empty() && st.top().fi <= h[i]){
            st.pop();
        }
        if(st.empty()) lst[i][0] = i; 
        if(!st.empty()) {
            lst[i][0] = st.top().se; 
            if(mx[i] < st.top().fi) bst[i][0] = st.top().se;
        }
        st.push({h[i], i});
    }
    for (int i = 1; i < lg; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            nxt[j][i] = nxt[nxt[j][i-1]][i-1];
            bst[j][i] = bst[bst[j][i-1]][i-1];
            lst[j][i] = lst[lst[j][i-1]][i-1];
        }
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    int mn = INF;
    int mxp = b+1;
    if(mxp ==c){
        if(c <= nxt[b][0] && nxt[b][0] <= d) return 1 ;
        return -1;
    }
    for (int i = lg-1; i >= 0; i--)
    {
        if(nxt[mxp][i] < c){
            mxp = nxt[mxp][i];
        }
    }
    if(nxt[mxp][0] > d) return -1;
    for (int j = a; j <= b; ++j)
    {
        int cur = j, res = 0;
        for (int i = lg-1; i >= 0; i--)
        {
            if(s[bst[cur][i]] < s[mxp]){
                cur = bst[cur][i];
                res += (1 << i);
            }
        }
        int u = lst[cur][0], v = nxt[u][0];
        if(v >= c && v <= d){
            if(u >= a && u <= b) return 1;
            else mn = min(mn,res+2);
        }
        for (int i = lg-1; i >= 0; i--)
        {
            if(nxt[cur][i] < c){
                cur = nxt[cur][i];
                res += (1 << i);
            }
        }
        if(nxt[cur][0] >= c && nxt[cur][0] <= d) mn = min(mn, res+1);
    }
    if(mn == INF) return -1;
    return mn;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Execution timed out 4098 ms 60196 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 4 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 3 ms 400 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 4 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 4 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 3 ms 400 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 4 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 2 ms 336 KB Output is correct
45 Correct 4 ms 336 KB Output is correct
46 Correct 2 ms 336 KB Output is correct
47 Correct 3 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 4 ms 336 KB Output is correct
50 Correct 4 ms 336 KB Output is correct
51 Correct 5 ms 336 KB Output is correct
52 Correct 3 ms 336 KB Output is correct
53 Correct 3 ms 336 KB Output is correct
54 Correct 4 ms 336 KB Output is correct
55 Correct 3 ms 336 KB Output is correct
56 Correct 3 ms 336 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 83 ms 848 KB Output is correct
59 Correct 137 ms 976 KB Output is correct
60 Correct 16 ms 592 KB Output is correct
61 Correct 157 ms 976 KB Output is correct
62 Correct 18 ms 336 KB Output is correct
63 Correct 132 ms 976 KB Output is correct
64 Correct 162 ms 976 KB Output is correct
65 Correct 179 ms 976 KB Output is correct
66 Correct 143 ms 976 KB Output is correct
67 Correct 155 ms 976 KB Output is correct
68 Correct 116 ms 976 KB Output is correct
69 Correct 49 ms 976 KB Output is correct
70 Correct 28 ms 976 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 0 ms 336 KB Output is correct
73 Correct 3 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 4 ms 336 KB Output is correct
76 Correct 4 ms 336 KB Output is correct
77 Correct 3 ms 336 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 3 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 3 ms 336 KB Output is correct
85 Correct 2 ms 336 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 0 ms 336 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 336 KB Output is correct
93 Correct 0 ms 336 KB Output is correct
94 Correct 5 ms 336 KB Output is correct
95 Correct 132 ms 976 KB Output is correct
96 Correct 123 ms 976 KB Output is correct
97 Correct 57 ms 976 KB Output is correct
98 Correct 113 ms 976 KB Output is correct
99 Correct 151 ms 976 KB Output is correct
100 Correct 0 ms 336 KB Output is correct
101 Correct 1 ms 592 KB Output is correct
102 Correct 15 ms 976 KB Output is correct
103 Correct 19 ms 976 KB Output is correct
104 Correct 18 ms 976 KB Output is correct
105 Correct 17 ms 976 KB Output is correct
106 Correct 17 ms 976 KB Output is correct
107 Correct 1 ms 336 KB Output is correct
108 Correct 1 ms 592 KB Output is correct
109 Correct 1 ms 976 KB Output is correct
110 Correct 1 ms 976 KB Output is correct
111 Correct 1 ms 976 KB Output is correct
112 Correct 1 ms 976 KB Output is correct
113 Correct 1 ms 976 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 155 ms 59496 KB Output is correct
6 Correct 222 ms 73920 KB Output is correct
7 Correct 96 ms 37956 KB Output is correct
8 Correct 207 ms 73912 KB Output is correct
9 Correct 26 ms 11344 KB Output is correct
10 Correct 198 ms 73912 KB Output is correct
11 Correct 230 ms 75452 KB Output is correct
12 Correct 208 ms 75012 KB Output is correct
13 Correct 226 ms 75000 KB Output is correct
14 Correct 188 ms 73908 KB Output is correct
15 Correct 214 ms 74612 KB Output is correct
16 Correct 188 ms 75564 KB Output is correct
17 Correct 211 ms 75404 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 668 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 188 ms 73772 KB Output is correct
34 Correct 212 ms 73896 KB Output is correct
35 Correct 205 ms 75104 KB Output is correct
36 Correct 196 ms 74016 KB Output is correct
37 Correct 204 ms 74644 KB Output is correct
38 Correct 227 ms 74940 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 174 ms 42916 KB Output is correct
41 Correct 279 ms 73912 KB Output is correct
42 Correct 308 ms 75396 KB Output is correct
43 Correct 261 ms 73896 KB Output is correct
44 Correct 313 ms 74748 KB Output is correct
45 Correct 253 ms 74924 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 361 ms 33960 KB Output is correct
5 Correct 1252 ms 73916 KB Output is correct
6 Correct 751 ms 12560 KB Output is correct
7 Correct 1298 ms 73908 KB Output is correct
8 Correct 416 ms 25656 KB Output is correct
9 Correct 1129 ms 73916 KB Output is correct
10 Correct 1347 ms 75596 KB Output is correct
11 Correct 1077 ms 75092 KB Output is correct
12 Correct 1260 ms 75336 KB Output is correct
13 Correct 1122 ms 73912 KB Output is correct
14 Correct 1249 ms 74608 KB Output is correct
15 Correct 919 ms 74892 KB Output is correct
16 Correct 1059 ms 74912 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 20 ms 976 KB Output is correct
28 Correct 19 ms 1072 KB Output is correct
29 Correct 17 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 25 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 102 ms 42924 KB Output is correct
34 Correct 180 ms 73896 KB Output is correct
35 Correct 198 ms 75296 KB Output is correct
36 Correct 196 ms 74024 KB Output is correct
37 Correct 204 ms 74684 KB Output is correct
38 Correct 191 ms 75080 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 361 ms 33960 KB Output is correct
5 Correct 1252 ms 73916 KB Output is correct
6 Correct 751 ms 12560 KB Output is correct
7 Correct 1298 ms 73908 KB Output is correct
8 Correct 416 ms 25656 KB Output is correct
9 Correct 1129 ms 73916 KB Output is correct
10 Correct 1347 ms 75596 KB Output is correct
11 Correct 1077 ms 75092 KB Output is correct
12 Correct 1260 ms 75336 KB Output is correct
13 Correct 1122 ms 73912 KB Output is correct
14 Correct 1249 ms 74608 KB Output is correct
15 Correct 919 ms 74892 KB Output is correct
16 Correct 1059 ms 74912 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 20 ms 976 KB Output is correct
28 Correct 19 ms 1072 KB Output is correct
29 Correct 17 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 25 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 102 ms 42924 KB Output is correct
34 Correct 180 ms 73896 KB Output is correct
35 Correct 198 ms 75296 KB Output is correct
36 Correct 196 ms 74024 KB Output is correct
37 Correct 204 ms 74684 KB Output is correct
38 Correct 191 ms 75080 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 296 ms 33964 KB Output is correct
43 Correct 842 ms 73916 KB Output is correct
44 Correct 503 ms 12472 KB Output is correct
45 Correct 1176 ms 73916 KB Output is correct
46 Correct 601 ms 25656 KB Output is correct
47 Correct 1063 ms 73912 KB Output is correct
48 Correct 1235 ms 75464 KB Output is correct
49 Correct 1248 ms 75092 KB Output is correct
50 Correct 1125 ms 75292 KB Output is correct
51 Correct 950 ms 73952 KB Output is correct
52 Correct 1259 ms 74684 KB Output is correct
53 Correct 1173 ms 74824 KB Output is correct
54 Correct 1105 ms 74856 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Execution timed out 4103 ms 73552 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Execution timed out 4098 ms 60196 KB Time limit exceeded
4 Halted 0 ms 0 KB -