oj.uz

Submission #980713

# Submission time Handle Problem Language Result Execution time Memory
980713 2024-05-12T10:47:35 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
56 / 100
 4000 ms 46352 KB 
#include <bits/stdc++.h>
#include "jumps.h"

using namespace std;

const int N = 200200;

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

vector<int> g[N];
    
vector<int> bfs(vector<int> st) {
    vector<int> dist(n, 1e9);
    queue<int> q;
    for (int c : st) {
        dist[c] = 0;
        q.push(c);
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int to : g[x]) {
            if (dist[to] > dist[x] + 1) {
                dist[to] = dist[x] + 1;
                q.push(to);
            }
        }
    }
    return dist;
}

void init(int N, vector<int> H) {
    n = N;
    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++) {
        g[i].push_back(to[i][0][0]);
        g[i].push_back(to[i][0][1]);

        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;
    }

    vector<int> st;
    for (int i = A; i <= B; i++) st.push_back(i);
    auto dist = bfs(st);
    int res = 1e9;
    for (int i = C; i <= D; i++) 
        res = min(res, dist[i]);
    if (res == 1e9) return -1;
    return res;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8788 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Execution timed out 4019 ms 41464 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 3 ms 8792 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 5 ms 8792 KB Output is correct
11 Correct 3 ms 8792 KB Output is correct
12 Correct 3 ms 9048 KB Output is correct
13 Correct 3 ms 8868 KB Output is correct
14 Correct 3 ms 9088 KB Output is correct
15 Correct 3 ms 9048 KB Output is correct
16 Correct 3 ms 8792 KB Output is correct
17 Correct 3 ms 8792 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 3 ms 9048 KB Output is correct
21 Correct 3 ms 9048 KB Output is correct
22 Correct 3 ms 9048 KB Output is correct
23 Correct 3 ms 8792 KB Output is correct
24 Correct 3 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 3 ms 8788 KB Output is correct
28 Correct 3 ms 8792 KB Output is correct
29 Correct 3 ms 8792 KB Output is correct
30 Correct 4 ms 8792 KB Output is correct
31 Correct 2 ms 8792 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 2 ms 8792 KB Output is correct
34 Correct 2 ms 8792 KB Output is correct
35 Correct 2 ms 8792 KB Output is correct
36 Correct 2 ms 8808 KB Output is correct
37 Correct 2 ms 8792 KB Output is correct
38 Correct 2 ms 8792 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 2 ms 8792 KB Output is correct
41 Correct 1 ms 8792 KB Output is correct
42 Correct 2 ms 8792 KB Output is correct
43 Correct 2 ms 8792 KB Output is correct
44 Correct 2 ms 8792 KB Output is correct
45 Correct 3 ms 9048 KB Output is correct
46 Correct 3 ms 8792 KB Output is correct
47 Correct 3 ms 8792 KB Output is correct
48 Correct 2 ms 8792 KB Output is correct
49 Correct 3 ms 9048 KB Output is correct
50 Correct 4 ms 9048 KB Output is correct
51 Correct 3 ms 8792 KB Output is correct
52 Correct 3 ms 8596 KB Output is correct
53 Correct 3 ms 8792 KB Output is correct
54 Correct 3 ms 8792 KB Output is correct
55 Correct 3 ms 8792 KB Output is correct
56 Correct 3 ms 8792 KB Output is correct
57 Correct 2 ms 8792 KB Output is correct
58 Correct 18 ms 9688 KB Output is correct
59 Correct 20 ms 9196 KB Output is correct
60 Correct 5 ms 9048 KB Output is correct
61 Correct 22 ms 9076 KB Output is correct
62 Correct 10 ms 9100 KB Output is correct
63 Correct 22 ms 9556 KB Output is correct
64 Correct 38 ms 9816 KB Output is correct
65 Correct 39 ms 9816 KB Output is correct
66 Correct 31 ms 9048 KB Output is correct
67 Correct 24 ms 9312 KB Output is correct
68 Correct 29 ms 9304 KB Output is correct
69 Correct 29 ms 9304 KB Output is correct
70 Correct 28 ms 9304 KB Output is correct
71 Correct 2 ms 8792 KB Output is correct
72 Correct 2 ms 8600 KB Output is correct
73 Correct 3 ms 9048 KB Output is correct
74 Correct 2 ms 8792 KB Output is correct
75 Correct 2 ms 9048 KB Output is correct
76 Correct 3 ms 8792 KB Output is correct
77 Correct 3 ms 8792 KB Output is correct
78 Correct 2 ms 8792 KB Output is correct
79 Correct 2 ms 8792 KB Output is correct
80 Correct 2 ms 8792 KB Output is correct
81 Correct 3 ms 8792 KB Output is correct
82 Correct 2 ms 8792 KB Output is correct
83 Correct 3 ms 8796 KB Output is correct
84 Correct 2 ms 8792 KB Output is correct
85 Correct 2 ms 8792 KB Output is correct
86 Correct 2 ms 8792 KB Output is correct
87 Correct 2 ms 8792 KB Output is correct
88 Correct 2 ms 8792 KB Output is correct
89 Correct 2 ms 8792 KB Output is correct
90 Correct 2 ms 8792 KB Output is correct
91 Correct 2 ms 8792 KB Output is correct
92 Correct 2 ms 8792 KB Output is correct
93 Correct 2 ms 8792 KB Output is correct
94 Correct 3 ms 9048 KB Output is correct
95 Correct 19 ms 9304 KB Output is correct
96 Correct 29 ms 9324 KB Output is correct
97 Correct 21 ms 9584 KB Output is correct
98 Correct 29 ms 9304 KB Output is correct
99 Correct 28 ms 9560 KB Output is correct
100 Correct 2 ms 8792 KB Output is correct
101 Correct 2 ms 8792 KB Output is correct
102 Correct 9 ms 8792 KB Output is correct
103 Correct 11 ms 8792 KB Output is correct
104 Correct 10 ms 8792 KB Output is correct
105 Correct 9 ms 8792 KB Output is correct
106 Correct 9 ms 8792 KB Output is correct
107 Correct 3 ms 8792 KB Output is correct
108 Correct 2 ms 8792 KB Output is correct
109 Correct 2 ms 8792 KB Output is correct
110 Correct 2 ms 8792 KB Output is correct
111 Correct 2 ms 8828 KB Output is correct
112 Correct 2 ms 8792 KB Output is correct
113 Correct 2 ms 8792 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 69 ms 39004 KB Output is correct
6 Correct 76 ms 42852 KB Output is correct
7 Correct 30 ms 27480 KB Output is correct
8 Correct 77 ms 44352 KB Output is correct
9 Correct 9 ms 14368 KB Output is correct
10 Correct 74 ms 42552 KB Output is correct
11 Correct 85 ms 43980 KB Output is correct
12 Correct 83 ms 43224 KB Output is correct
13 Correct 78 ms 43216 KB Output is correct
14 Correct 77 ms 42696 KB Output is correct
15 Correct 84 ms 43360 KB Output is correct
16 Correct 77 ms 44288 KB Output is correct
17 Correct 77 ms 44304 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8792 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 2 ms 8792 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 3 ms 9048 KB Output is correct
29 Correct 2 ms 8792 KB Output is correct
30 Correct 2 ms 8792 KB Output is correct
31 Correct 2 ms 8792 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 70 ms 41840 KB Output is correct
34 Correct 73 ms 43364 KB Output is correct
35 Correct 85 ms 43140 KB Output is correct
36 Correct 74 ms 42716 KB Output is correct
37 Correct 78 ms 42836 KB Output is correct
38 Correct 80 ms 44232 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 38 ms 30016 KB Output is correct
41 Correct 83 ms 41808 KB Output is correct
42 Correct 69 ms 42484 KB Output is correct
43 Correct 69 ms 41856 KB Output is correct
44 Correct 82 ms 42236 KB Output is correct
45 Correct 68 ms 42692 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 143 ms 24800 KB Output is correct
5 Correct 658 ms 41868 KB Output is correct
6 Correct 412 ms 14076 KB Output is correct
7 Correct 626 ms 41856 KB Output is correct
8 Correct 360 ms 19852 KB Output is correct
9 Correct 652 ms 41808 KB Output is correct
10 Correct 749 ms 42576 KB Output is correct
11 Correct 798 ms 42476 KB Output is correct
12 Correct 760 ms 42464 KB Output is correct
13 Correct 679 ms 41788 KB Output is correct
14 Correct 727 ms 42220 KB Output is correct
15 Correct 642 ms 42748 KB Output is correct
16 Correct 617 ms 42736 KB Output is correct
17 Correct 2 ms 8792 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 3 ms 8792 KB Output is correct
20 Correct 3 ms 8792 KB Output is correct
21 Correct 3 ms 8792 KB Output is correct
22 Correct 3 ms 8792 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 9 ms 8792 KB Output is correct
28 Correct 11 ms 8792 KB Output is correct
29 Correct 10 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 34 ms 29988 KB Output is correct
34 Correct 69 ms 41840 KB Output is correct
35 Correct 68 ms 42480 KB Output is correct
36 Correct 81 ms 41860 KB Output is correct
37 Correct 86 ms 42232 KB Output is correct
38 Correct 67 ms 42716 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 143 ms 24800 KB Output is correct
5 Correct 658 ms 41868 KB Output is correct
6 Correct 412 ms 14076 KB Output is correct
7 Correct 626 ms 41856 KB Output is correct
8 Correct 360 ms 19852 KB Output is correct
9 Correct 652 ms 41808 KB Output is correct
10 Correct 749 ms 42576 KB Output is correct
11 Correct 798 ms 42476 KB Output is correct
12 Correct 760 ms 42464 KB Output is correct
13 Correct 679 ms 41788 KB Output is correct
14 Correct 727 ms 42220 KB Output is correct
15 Correct 642 ms 42748 KB Output is correct
16 Correct 617 ms 42736 KB Output is correct
17 Correct 2 ms 8792 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 3 ms 8792 KB Output is correct
20 Correct 3 ms 8792 KB Output is correct
21 Correct 3 ms 8792 KB Output is correct
22 Correct 3 ms 8792 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 9 ms 8792 KB Output is correct
28 Correct 11 ms 8792 KB Output is correct
29 Correct 10 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 34 ms 29988 KB Output is correct
34 Correct 69 ms 41840 KB Output is correct
35 Correct 68 ms 42480 KB Output is correct
36 Correct 81 ms 41860 KB Output is correct
37 Correct 86 ms 42232 KB Output is correct
38 Correct 67 ms 42716 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 2 ms 8792 KB Output is correct
41 Correct 2 ms 8792 KB Output is correct
42 Correct 142 ms 24804 KB Output is correct
43 Correct 688 ms 41860 KB Output is correct
44 Correct 427 ms 14168 KB Output is correct
45 Correct 613 ms 41856 KB Output is correct
46 Correct 407 ms 19848 KB Output is correct
47 Correct 688 ms 41840 KB Output is correct
48 Correct 773 ms 42660 KB Output is correct
49 Correct 697 ms 42468 KB Output is correct
50 Correct 721 ms 42416 KB Output is correct
51 Correct 661 ms 42064 KB Output is correct
52 Correct 696 ms 42240 KB Output is correct
53 Correct 674 ms 42736 KB Output is correct
54 Correct 631 ms 42740 KB Output is correct
55 Correct 2 ms 8792 KB Output is correct
56 Correct 2661 ms 46124 KB Output is correct
57 Execution timed out 4050 ms 46352 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8788 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Execution timed out 4019 ms 41464 KB Time limit exceeded
4 Halted 0 ms 0 KB -