oj.uz

Submission #962919

# Submission time Handle Problem Language Result Execution time Memory
962919 2024-04-14T09:45:52 Z BhavayGoyal Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 5960 KB 
#include <bits/stdc++.h>
#include <jumps.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 2e5+5;
int n, arr[N], Next[N], Prev[N];

void init(int nn, vi h) {
    n = nn;
    for (int i = 1; i <= n; i++) arr[i] = h[i-1];

    stack<int> st;
    for (int i = 1; i <= n; i++) {
        while (st.size() && arr[st.top()] < arr[i]) st.pop();
        if (st.size()) Prev[i] = st.top();
        else Prev[i] = -1;
        st.push(i);
    }
    while (st.size()) st.pop();

    for (int i = n; i >= 1; i--) {
        while (st.size() && arr[st.top()] < arr[i]) st.pop();
        if (st.size()) Next[i] = st.top();
        else Next[i] = -1;
        st.push(i);
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    a++; b++; c++; d++;
    queue<int> q;
    vi dis(n+1, inf), vis(n+1, 0);
    for (int i = a; i <= b; i++) {
        q.push(i); 
        dis[i] = 0;
    }

    while (!q.empty()) {
        int f = q.front(); q.pop();
        if (f >= c && f <= d) return dis[f];
        if (vis[f]) continue;
        vis[f] = true;

        int ch = Next[f];
        if (ch != -1 && dis[ch] > dis[f]+1) {
            dis[ch] = dis[f]+1;
            q.push(ch);
        }

        ch = Prev[f];
        if (ch != -1 && dis[ch] > dis[f]+1) {
            dis[ch] = dis[f]+1;
            q.push(ch);
        }
    }

    return -1;
}

Subtask #1
0 / 4.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 Execution timed out 4022 ms 5180 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2548 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 3 ms 2392 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 2 ms 2392 KB Output is correct
16 Correct 2 ms 2392 KB Output is correct
17 Correct 2 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 2 ms 2392 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 2 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 1 ms 2392 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2392 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 2 ms 2392 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 18 ms 4728 KB Output is correct
6 Correct 23 ms 5420 KB Output is correct
7 Correct 14 ms 3780 KB Output is correct
8 Correct 24 ms 5932 KB Output is correct
9 Correct 5 ms 3052 KB Output is correct
10 Correct 23 ms 5156 KB Output is correct
11 Correct 23 ms 5500 KB Output is correct
12 Correct 25 ms 5620 KB Output is correct
13 Correct 31 ms 5432 KB Output is correct
14 Correct 27 ms 5144 KB Output is correct
15 Correct 28 ms 5376 KB Output is correct
16 Correct 26 ms 5784 KB Output is correct
17 Correct 33 ms 5856 KB Output is correct
18 Correct 1 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 1 ms 2392 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2388 KB Output is correct
33 Correct 30 ms 5036 KB Output is correct
34 Correct 23 ms 5284 KB Output is correct
35 Correct 22 ms 5424 KB Output is correct
36 Correct 22 ms 5148 KB Output is correct
37 Correct 22 ms 5672 KB Output is correct
38 Correct 22 ms 5960 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 20 ms 4016 KB Output is correct
41 Correct 23 ms 5316 KB Output is correct
42 Correct 21 ms 5148 KB Output is correct
43 Correct 31 ms 5268 KB Output is correct
44 Correct 24 ms 5552 KB Output is correct
45 Correct 26 ms 5116 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Execution timed out 4072 ms 5192 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Execution timed out 4072 ms 5192 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 Execution timed out 4022 ms 5180 KB Time limit exceeded
4 Halted 0 ms 0 KB -