oj.uz

Submission #437962

# Submission time Handle Problem Language Result Execution time Memory
437962 2021-06-27T10:50:35 Z cheeheng Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 94496 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;

int nextGreater[200005][20];
int prevGreater[200005][20];
int indx[200005];
int log2_[200005];
ii val[200005][20];
int best[200005][20];
int A1[200005];

int M;

void init2(){
    for(int i = 0; i < M; i ++){
        val[i][0] = ii(A1[i], i);
    }

    for(int k = 1; k < 20; k ++){
        for(int i = 0; i <= M-(1<<k); i ++){
            val[i][k] = max(val[i][k-1], val[i+(1<<(k-1))][k-1]);
        }
    }

    log2_[1] = 0;
    for(int i = 2; i <= M; i ++){
        log2_[i] = log2_[i>>1] + 1;
    }
}

ii findMax(int l, int r){
    int k = log2_[r-l+1];
    return max(val[l][k], val[r-(1<<k)+1][k]);
}

vector<int> AdjList[200005];

void init(int N, std::vector<int> H){
    M = N;

    for(int i = 0; i < N; i ++){
        A1[i] = H[i];
    }

    init2();

    for(int i = 0; i < N; i ++){
        nextGreater[i][0] = N;
        prevGreater[i][0] = -1;
    }

    vector<ii> stack1 = vector<ii>();
    for(int i = 0; i < N; i ++){
        while(!stack1.empty()){
            ii temp = stack1.back();

            if(temp.first < H[i]){
                nextGreater[temp.second][0] = i;
                stack1.pop_back();
            }else{
                break;
            }
        }
        AdjList[H[i]].push_back(i);
        AdjList[i].push_back(H[i]);
        stack1.emplace_back(H[i], i);
    }

    stack1 = vector<ii>();
    for(int i = N-1; i >= 0; i --){
        while(!stack1.empty()){
            ii temp = stack1.back();

            if(temp.first < H[i]){
                prevGreater[temp.second][0] = i;
                stack1.pop_back();
            }else{
                break;
            }
        }
        stack1.emplace_back(H[i], i);
    }

    /*for(int i = 0; i < N; i ++){
        printf("nextGreater[%d]=%d\n", i, nextGreater[i][0]);
    }

    for(int i = 0; i < N; i ++){
        printf("prevGreater[%d]=%d\n", i, prevGreater[i][0]);
    }*/

    for(int k = 1; k < 20; k ++){
        for(int i = 0; i < N; i ++){
            if(nextGreater[i][k-1] == N){
                nextGreater[i][k] = N;
            }else{
                nextGreater[i][k] = nextGreater[nextGreater[i][k-1]][k-1];
            }

            if(prevGreater[i][k-1] == -1){
                prevGreater[i][k] = -1;
            }else{
                prevGreater[i][k] = prevGreater[prevGreater[i][k-1]][k-1];
            }
        }
    }

    for(int i = 0; i < N; i ++){
        best[i][0] = -1;
    }
}

int minimum_jumps(int A, int B, int C, int D){
    assert(0 <= A && A <= B && B < C && C <= D && D <= M-1);

    ii maxValCD = findMax(C, D);
    int maxIndxCD = prevGreater[maxValCD.second][0];
    //printf("maxValCD=%d\n", maxValCD);
    A = max(maxIndxCD+1, A);

    if(A > B){return -1;}

    ii maxValAB = findMax(A, B);
    int X = maxValAB.second;

    int ans = 0;
    int X2 = X;

    while(X2 < C){
        int X3, X4;
        if(prevGreater[X2][0] == -1){
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }else if(nextGreater[X2][0] == M){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else if(A1[prevGreater[X2][0]] > A1[nextGreater[X2][0]]){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else{
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }

        //printf("X2=%d; X3=%d; X4=%d\n", X2, X3, X4);
        if(X4 >= C && X4 <= D){
            X2 = X4;
        }else if(A1[X3] > maxValCD.first){
            X2 = X4;
        }else{
            X2 = X3;
        }
        //printf("X2=%d\n", X2);
        ans ++;
        assert(X2 >= 0 && X2 < M);
    }

    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 4 ms 4936 KB Output is correct
3 Correct 5 ms 4936 KB Output is correct
4 Correct 5 ms 4936 KB Output is correct
5 Correct 237 ms 75508 KB Output is correct
6 Correct 264 ms 92712 KB Output is correct
7 Correct 133 ms 49788 KB Output is correct
8 Correct 231 ms 92540 KB Output is correct
9 Correct 23 ms 18156 KB Output is correct
10 Correct 224 ms 92656 KB Output is correct
11 Correct 212 ms 94256 KB Output is correct
12 Correct 176 ms 93872 KB Output is correct
13 Correct 201 ms 93876 KB Output is correct
14 Correct 279 ms 92540 KB Output is correct
15 Correct 208 ms 94496 KB Output is correct
16 Correct 224 ms 92860 KB Output is correct
17 Correct 210 ms 93052 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 5064 KB Output is correct
20 Correct 4 ms 5064 KB Output is correct
21 Correct 3 ms 5064 KB Output is correct
22 Correct 4 ms 5064 KB Output is correct
23 Correct 5 ms 5064 KB Output is correct
24 Correct 4 ms 5064 KB Output is correct
25 Correct 4 ms 5084 KB Output is correct
26 Correct 5 ms 5320 KB Output is correct
27 Correct 6 ms 5832 KB Output is correct
28 Correct 6 ms 5960 KB Output is correct
29 Correct 4 ms 5832 KB Output is correct
30 Correct 4 ms 5832 KB Output is correct
31 Correct 5 ms 5832 KB Output is correct
32 Correct 4 ms 4936 KB Output is correct
33 Correct 253 ms 92664 KB Output is correct
34 Correct 282 ms 92624 KB Output is correct
35 Correct 198 ms 93956 KB Output is correct
36 Correct 233 ms 92632 KB Output is correct
37 Correct 244 ms 94436 KB Output is correct
38 Correct 204 ms 92624 KB Output is correct
39 Correct 3 ms 4936 KB Output is correct
40 Correct 130 ms 55716 KB Output is correct
41 Correct 287 ms 92672 KB Output is correct
42 Correct 183 ms 94092 KB Output is correct
43 Correct 258 ms 92672 KB Output is correct
44 Correct 260 ms 94428 KB Output is correct
45 Correct 199 ms 92748 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 409 ms 45048 KB Output is correct
5 Correct 1515 ms 92616 KB Output is correct
6 Correct 845 ms 19400 KB Output is correct
7 Correct 1434 ms 92612 KB Output is correct
8 Correct 764 ms 35136 KB Output is correct
9 Correct 1456 ms 92556 KB Output is correct
10 Execution timed out 4008 ms 94320 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 409 ms 45048 KB Output is correct
5 Correct 1515 ms 92616 KB Output is correct
6 Correct 845 ms 19400 KB Output is correct
7 Correct 1434 ms 92612 KB Output is correct
8 Correct 764 ms 35136 KB Output is correct
9 Correct 1456 ms 92556 KB Output is correct
10 Execution timed out 4008 ms 94320 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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