oj.uz

Submission #980673

# Submission time Handle Problem Language Result Execution time Memory
980673 2024-05-12T10:02:54 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 740 ms 32072 KB 
#include <bits/stdc++.h>
#include "jumps.h"

using namespace std;

const int N = 200200;

int h[N];
int to[N][18][2];

void init(int N, vector<int> H) {
    for (int i = 0; i < N; i++)
        h[i] = H[i];
    
    vector<int> stack;
    for (int i = 0; i < N; i++) {
        while (!stack.empty() && H[stack.back()] < H[i]) 
            stack.pop_back();
        if (stack.empty()) to[i][0][0] = i;
        else to[i][0][0] = stack.back();
        stack.push_back(i);
    }
    stack.clear();
    for (int i = N - 1; i >= 0; i--) {
        while (!stack.empty() && H[stack.back()] < H[i])
            stack.pop_back();
        if (stack.empty()) to[i][0][1] = i;
        else to[i][0][1] = stack.back();
        stack.push_back(i);
    }
    for (int i = 0; i < N; i++) {
        if (H[to[i][0][0]] < H[to[i][0][1]])
            swap(to[i][0][0], to[i][0][1]);
    }
    for (int k = 1; k < 18; k++) {
        for (int i = 0; i < N; i++) {
            to[i][k][0] = to[ to[i][k - 1][0] ][k - 1][0];
            to[i][k][1] = to[ to[i][k - 1][1] ][k - 1][1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if (A == B && C == D) {
        int ans = 0;
        int cur = A;
        for (int k = 17; k >= 0; k--) {
            if (h[to[cur][k][0]] < h[C]) {
                cur = to[cur][k][0];
                ans += (1 << k);
            }
        }
        if (to[cur][0][0] == C) return ans + 1;

        for (int k = 17; k >= 0; k--) {
            if (h[to[cur][k][1]] < h[C]) {
                cur = to[cur][k][1];
                ans += (1 << k);
            }
        }
        
        if (to[cur][0][1] == C) return ans + 1;
        return -1;
    }
    return 0;
}
/*
7 1
3 2 1 6 4 5 7
4 4 6 6

*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Incorrect 101 ms 27556 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 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 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 147 ms 17704 KB Output is correct
5 Correct 640 ms 30992 KB Output is correct
6 Correct 414 ms 9048 KB Output is correct
7 Correct 602 ms 30984 KB Output is correct
8 Correct 344 ms 13268 KB Output is correct
9 Correct 655 ms 30924 KB Output is correct
10 Correct 732 ms 32056 KB Output is correct
11 Correct 740 ms 32064 KB Output is correct
12 Correct 712 ms 32072 KB Output is correct
13 Correct 639 ms 30936 KB Output is correct
14 Correct 684 ms 31472 KB Output is correct
15 Correct 616 ms 31804 KB Output is correct
16 Correct 624 ms 31808 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 10 ms 4696 KB Output is correct
28 Correct 10 ms 4696 KB Output is correct
29 Correct 14 ms 4696 KB Output is correct
30 Correct 10 ms 4696 KB Output is correct
31 Correct 10 ms 4696 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 29 ms 19844 KB Output is correct
34 Correct 55 ms 30904 KB Output is correct
35 Correct 53 ms 31944 KB Output is correct
36 Correct 63 ms 30924 KB Output is correct
37 Correct 55 ms 31276 KB Output is correct
38 Correct 56 ms 31808 KB Output is correct

Subtask #6
0 / 21.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 1 ms 2392 KB Output is correct
4 Correct 147 ms 17704 KB Output is correct
5 Correct 640 ms 30992 KB Output is correct
6 Correct 414 ms 9048 KB Output is correct
7 Correct 602 ms 30984 KB Output is correct
8 Correct 344 ms 13268 KB Output is correct
9 Correct 655 ms 30924 KB Output is correct
10 Correct 732 ms 32056 KB Output is correct
11 Correct 740 ms 32064 KB Output is correct
12 Correct 712 ms 32072 KB Output is correct
13 Correct 639 ms 30936 KB Output is correct
14 Correct 684 ms 31472 KB Output is correct
15 Correct 616 ms 31804 KB Output is correct
16 Correct 624 ms 31808 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 10 ms 4696 KB Output is correct
28 Correct 10 ms 4696 KB Output is correct
29 Correct 14 ms 4696 KB Output is correct
30 Correct 10 ms 4696 KB Output is correct
31 Correct 10 ms 4696 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 29 ms 19844 KB Output is correct
34 Correct 55 ms 30904 KB Output is correct
35 Correct 53 ms 31944 KB Output is correct
36 Correct 63 ms 30924 KB Output is correct
37 Correct 55 ms 31276 KB Output is correct
38 Correct 56 ms 31808 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct
40 Correct 0 ms 2392 KB Output is correct
41 Correct 0 ms 2392 KB Output is correct
42 Correct 173 ms 17752 KB Output is correct
43 Correct 641 ms 30980 KB Output is correct
44 Correct 419 ms 9048 KB Output is correct
45 Correct 662 ms 30984 KB Output is correct
46 Correct 378 ms 13264 KB Output is correct
47 Correct 672 ms 30980 KB Output is correct
48 Correct 728 ms 31944 KB Output is correct
49 Correct 728 ms 32052 KB Output is correct
50 Correct 719 ms 32068 KB Output is correct
51 Correct 638 ms 31076 KB Output is correct
52 Correct 696 ms 31488 KB Output is correct
53 Correct 634 ms 31788 KB Output is correct
54 Correct 616 ms 31816 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Incorrect 94 ms 30924 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Incorrect 101 ms 27556 KB Output isn't correct
4 Halted 0 ms 0 KB -