oj.uz

Submission #750604

# Submission time Handle Problem Language Result Execution time Memory
750604 2023-05-29T21:51:11 Z snpmrnhlol Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1313 ms 50504 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int K = 20;
int v[N + 2];
int l[N + 2][K];
int r[N + 2][K];
int p[N + 2][K];
stack <int> stk;
int en;
void init(int n, std::vector<int> H) {
    int i,j;en = n;
    for(i = 1;i <= n;i++){
        v[i] = H[i - 1];
    }
    r[n + 1][0] = n + 1;
    l[0][0] = 0;
    for(i = 1;i <= n;i++){
        while(!stk.empty() && v[stk.top()] < v[i]){
            r[stk.top()][0] = i;stk.pop();
        }
        stk.push(i);
    }
    while(!stk.empty()){
        r[stk.top()][0] = n + 1;
        stk.pop();
    }
    for(i = n;i >= 1;i--){
        while(!stk.empty() && v[stk.top()] < v[i]){
            l[stk.top()][0] = i;stk.pop();
        }
        stk.push(i);
    }
    while(!stk.empty()){
        l[stk.top()][0] = 0;
        stk.pop();
    }
    v[0] = v[n + 1] = -2e9;
    for(i = 0;i <= n + 1;i++){
        if(v[l[i][0]] > v[r[i][0]]){
            p[i][0] = l[i][0];
        }else p[i][0] = r[i][0];
    }
    for(j = 1;j <= 19;j++){
        for(i = 0;i <= n + 1;i++){
            if(i > 0 && i < n + 1)p[i][j] = p[p[i][j - 1]][j - 1];
            l[i][j] = l[l[i][j - 1]][j - 1];
            r[i][j] = r[r[i][j - 1]][j - 1];
        }
    }
    /*for(j = 0;j <= 19;j++){
        for(i = 0;i <= n + 1;i++){
            cout<<p[i][j]<<' '<<r[i][j]<<' '<<l[i][j]<<'\n';
        }
    }*/
}

int minimum_jumps(int a, int b, int c, int d){
    a++;b++;c++;d++;
    int x = b,i,r2 = 0;
    int n = en;
    for(i = 19;i >= 0;i--){
        if(l[x][i] >= a && r[l[x][i]][0] <= d){
            x = l[x][i];
        }
    }
    //cout<<x<<'\n';
    for(i = 19;i >= 0;i--){
        if(1 <= p[x][i] && p[x][i] <= n && p[x][i] < c && r[p[x][i]][0] <= d){
            r2+=(1<<i);
            x = p[x][i];
        }
    }
    //cout<<x<<'\n';
    for(i = 19;i >= 0;i--){
        if(r[x][i] < c){
            x = r[x][i];
            r2+=(1<<i);
        }
    }
    //cout<<x<<'\n';
    if(x < c){
        x = r[x][0];
        r2++;
    }
    //cout<<x<<'\n';
    if(c <= x && x <= d)return r2;
    return -1;
}
/**
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2
**/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 176 ms 40212 KB Output is correct
4 Correct 1215 ms 50376 KB Output is correct
5 Correct 1014 ms 25528 KB Output is correct
6 Correct 1159 ms 50340 KB Output is correct
7 Correct 736 ms 34568 KB Output is correct
8 Correct 1034 ms 50428 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 89 ms 39972 KB Output is correct
6 Correct 108 ms 49684 KB Output is correct
7 Correct 54 ms 25568 KB Output is correct
8 Correct 105 ms 49604 KB Output is correct
9 Correct 10 ms 7632 KB Output is correct
10 Correct 101 ms 49584 KB Output is correct
11 Correct 99 ms 50432 KB Output is correct
12 Correct 105 ms 50244 KB Output is correct
13 Correct 104 ms 50196 KB Output is correct
14 Correct 112 ms 49600 KB Output is correct
15 Incorrect 116 ms 49976 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 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 286 ms 22860 KB Output is correct
5 Correct 1180 ms 49608 KB Output is correct
6 Correct 411 ms 8400 KB Output is correct
7 Correct 755 ms 49588 KB Output is correct
8 Correct 637 ms 17224 KB Output is correct
9 Correct 903 ms 49584 KB Output is correct
10 Correct 1216 ms 50328 KB Output is correct
11 Correct 779 ms 50140 KB Output is correct
12 Correct 1060 ms 50436 KB Output is correct
13 Correct 1118 ms 49608 KB Output is correct
14 Correct 883 ms 50020 KB Output is correct
15 Correct 802 ms 50480 KB Output is correct
16 Correct 644 ms 50388 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 284 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 15 ms 720 KB Output is correct
28 Correct 22 ms 720 KB Output is correct
29 Correct 16 ms 720 KB Output is correct
30 Correct 11 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 59 ms 28744 KB Output is correct
34 Correct 110 ms 49556 KB Output is correct
35 Correct 102 ms 50248 KB Output is correct
36 Correct 108 ms 49564 KB Output is correct
37 Correct 118 ms 49884 KB Output is correct
38 Correct 95 ms 50380 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 286 ms 22860 KB Output is correct
5 Correct 1180 ms 49608 KB Output is correct
6 Correct 411 ms 8400 KB Output is correct
7 Correct 755 ms 49588 KB Output is correct
8 Correct 637 ms 17224 KB Output is correct
9 Correct 903 ms 49584 KB Output is correct
10 Correct 1216 ms 50328 KB Output is correct
11 Correct 779 ms 50140 KB Output is correct
12 Correct 1060 ms 50436 KB Output is correct
13 Correct 1118 ms 49608 KB Output is correct
14 Correct 883 ms 50020 KB Output is correct
15 Correct 802 ms 50480 KB Output is correct
16 Correct 644 ms 50388 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 284 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 15 ms 720 KB Output is correct
28 Correct 22 ms 720 KB Output is correct
29 Correct 16 ms 720 KB Output is correct
30 Correct 11 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 59 ms 28744 KB Output is correct
34 Correct 110 ms 49556 KB Output is correct
35 Correct 102 ms 50248 KB Output is correct
36 Correct 108 ms 49564 KB Output is correct
37 Correct 118 ms 49884 KB Output is correct
38 Correct 95 ms 50380 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 264 ms 22828 KB Output is correct
43 Correct 840 ms 49572 KB Output is correct
44 Correct 667 ms 8364 KB Output is correct
45 Correct 940 ms 49700 KB Output is correct
46 Correct 405 ms 17216 KB Output is correct
47 Correct 857 ms 49576 KB Output is correct
48 Correct 974 ms 50504 KB Output is correct
49 Correct 1038 ms 50248 KB Output is correct
50 Correct 1147 ms 50320 KB Output is correct
51 Correct 1006 ms 49584 KB Output is correct
52 Correct 967 ms 50036 KB Output is correct
53 Correct 815 ms 50436 KB Output is correct
54 Correct 902 ms 50436 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 150 ms 49328 KB Output is correct
57 Correct 1016 ms 49588 KB Output is correct
58 Correct 375 ms 8872 KB Output is correct
59 Correct 883 ms 49608 KB Output is correct
60 Correct 469 ms 17736 KB Output is correct
61 Correct 977 ms 49480 KB Output is correct
62 Correct 794 ms 50356 KB Output is correct
63 Correct 1057 ms 50096 KB Output is correct
64 Correct 1177 ms 50208 KB Output is correct
65 Correct 1014 ms 49484 KB Output is correct
66 Correct 1265 ms 49968 KB Output is correct
67 Correct 1226 ms 50368 KB Output is correct
68 Correct 1313 ms 50328 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 3 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 0 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 5 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 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 0 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 18 ms 744 KB Output is correct
87 Correct 21 ms 720 KB Output is correct
88 Correct 19 ms 720 KB Output is correct
89 Correct 17 ms 720 KB Output is correct
90 Correct 18 ms 720 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 22 ms 720 KB Output is correct
94 Correct 14 ms 720 KB Output is correct
95 Correct 25 ms 720 KB Output is correct
96 Correct 22 ms 720 KB Output is correct
97 Correct 16 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 101 ms 49532 KB Output is correct
100 Correct 100 ms 49604 KB Output is correct
101 Correct 98 ms 50348 KB Output is correct
102 Correct 114 ms 49560 KB Output is correct
103 Correct 118 ms 49940 KB Output is correct
104 Correct 95 ms 50376 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 59 ms 28864 KB Output is correct
107 Correct 106 ms 49608 KB Output is correct
108 Correct 100 ms 50308 KB Output is correct
109 Correct 113 ms 49480 KB Output is correct
110 Correct 115 ms 49936 KB Output is correct
111 Correct 96 ms 50336 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 176 ms 40212 KB Output is correct
4 Correct 1215 ms 50376 KB Output is correct
5 Correct 1014 ms 25528 KB Output is correct
6 Correct 1159 ms 50340 KB Output is correct
7 Correct 736 ms 34568 KB Output is correct
8 Correct 1034 ms 50428 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Incorrect 2 ms 336 KB Output isn't correct
15 Halted 0 ms 0 KB -