oj.uz

Submission #887784

# Submission time Handle Problem Language Result Execution time Memory
887784 2023-12-15T08:18:45 Z hamidh100 Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 6128 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VL;
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define endl '\n'
#define dbg(x) cerr << '[' << #x << ": " << x << "]\n"
#define dbg2(x, y) cerr << '[' << #x << ": " << x << ", " << #y << ": " << y << "]\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"

const ll INF = (ll)2e18 + 1386;
const ld EPS = 0.000000000000001;
const int MOD = 1e9 + 7;

inline int _add(int a, int b){ int res = a + b; return (res >= MOD ? res - MOD : res); }
inline int _neg(int a, int b){ int res = (abs(a - b) < MOD ? a - b : (a - b) % MOD); return (res < 0 ? res + MOD : res); }
inline int _mlt(ll a, ll b){ return (a * b % MOD); }
inline void fileIO(string i, string o){ freopen(i.c_str(), "r", stdin); freopen(o.c_str(), "w", stdout); }

const int MAXN = 2e5 + 5;

int n;
int a[MAXN], dist[MAXN], cand[MAXN][2];
bitset<MAXN> mark;

void init(int N, std::vector<int> H) {
    n = N;
    VI agha;
    for (int i = 1; i <= n; i++){
        a[i] = H[i - 1];
        while (!agha.empty() && a[i] > a[agha.back()]){
            agha.pop_back();
        }
        if (!agha.empty()) cand[i][0] = agha.back();
        agha.PB(i);
    }
    agha.clear();
    for (int i = n; i >= 1; i--){
        while (!agha.empty() && a[i] > a[agha.back()]){
            agha.pop_back();
        }
        if (!agha.empty()) cand[i][1] = agha.back();
        agha.PB(i);
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    int ans = INT_MAX;
    A++, B++, C++, D++;
    mark.reset();
    fill(dist, dist + n + 1, INT_MAX);
    queue<int> q;
    for (int i = A; i <= B; i++){
        q.push(i);
        mark[i] = 1;
        dist[i] = 0;
    }
    while (!q.empty()){
        int v = q.front();
        q.pop();
        for (int i = 0; i < 2; i++){
            if (cand[v][i] != 0 && !mark[cand[v][i]]){
                mark[cand[v][i]] = 1;
                dist[cand[v][i]] = dist[v] + 1;
                q.push(cand[v][i]);
            }
        }
    }
    for (int j = C; j <= D; j++){
        ans = min(ans, dist[j]);
    }
    return ans == INT_MAX ? -1 : ans;
}

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 Execution timed out 4083 ms 5292 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 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 0 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 2 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 0 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 0 ms 2392 KB Output is correct
36 Correct 0 ms 2392 KB Output is correct
37 Correct 0 ms 2392 KB Output is correct
38 Correct 0 ms 2392 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 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 0 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 2 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 0 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 0 ms 2392 KB Output is correct
36 Correct 0 ms 2392 KB Output is correct
37 Correct 0 ms 2392 KB Output is correct
38 Correct 0 ms 2392 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct
40 Correct 0 ms 2392 KB Output is correct
41 Correct 1 ms 2392 KB Output is correct
42 Correct 0 ms 2392 KB Output is correct
43 Correct 0 ms 2392 KB Output is correct
44 Correct 1 ms 2392 KB Output is correct
45 Correct 1 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 1 ms 2392 KB Output is correct
50 Correct 2 ms 2392 KB Output is correct
51 Correct 1 ms 2392 KB Output is correct
52 Correct 2 ms 2392 KB Output is correct
53 Correct 1 ms 2392 KB Output is correct
54 Correct 2 ms 2392 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 1 ms 2392 KB Output is correct
57 Correct 0 ms 2392 KB Output is correct
58 Correct 14 ms 2648 KB Output is correct
59 Correct 22 ms 2588 KB Output is correct
60 Correct 4 ms 2392 KB Output is correct
61 Correct 21 ms 2392 KB Output is correct
62 Correct 8 ms 2392 KB Output is correct
63 Correct 19 ms 2648 KB Output is correct
64 Correct 27 ms 2392 KB Output is correct
65 Correct 30 ms 2392 KB Output is correct
66 Correct 28 ms 2392 KB Output is correct
67 Correct 21 ms 2392 KB Output is correct
68 Correct 29 ms 2392 KB Output is correct
69 Correct 25 ms 2392 KB Output is correct
70 Correct 23 ms 2392 KB Output is correct
71 Correct 0 ms 2392 KB Output is correct
72 Correct 1 ms 2392 KB Output is correct
73 Correct 1 ms 2392 KB Output is correct
74 Correct 1 ms 2392 KB Output is correct
75 Correct 1 ms 2392 KB Output is correct
76 Correct 1 ms 2392 KB Output is correct
77 Correct 1 ms 2392 KB Output is correct
78 Correct 0 ms 2392 KB Output is correct
79 Correct 0 ms 2392 KB Output is correct
80 Correct 1 ms 2392 KB Output is correct
81 Correct 1 ms 2392 KB Output is correct
82 Correct 2 ms 2392 KB Output is correct
83 Correct 1 ms 2392 KB Output is correct
84 Correct 1 ms 2392 KB Output is correct
85 Correct 2 ms 2392 KB Output is correct
86 Correct 0 ms 2392 KB Output is correct
87 Correct 0 ms 2392 KB Output is correct
88 Correct 0 ms 2392 KB Output is correct
89 Correct 0 ms 2392 KB Output is correct
90 Correct 1 ms 2392 KB Output is correct
91 Correct 0 ms 2392 KB Output is correct
92 Correct 1 ms 2392 KB Output is correct
93 Correct 0 ms 2392 KB Output is correct
94 Correct 2 ms 2392 KB Output is correct
95 Correct 18 ms 2392 KB Output is correct
96 Correct 23 ms 2392 KB Output is correct
97 Correct 18 ms 2392 KB Output is correct
98 Correct 26 ms 2392 KB Output is correct
99 Correct 24 ms 2392 KB Output is correct
100 Correct 1 ms 2388 KB Output is correct
101 Correct 1 ms 2392 KB Output is correct
102 Correct 13 ms 2392 KB Output is correct
103 Correct 22 ms 2392 KB Output is correct
104 Correct 11 ms 2392 KB Output is correct
105 Correct 17 ms 2388 KB Output is correct
106 Correct 21 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 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2520 KB Output is correct
5 Correct 18 ms 4408 KB Output is correct
6 Correct 21 ms 4824 KB Output is correct
7 Correct 12 ms 3668 KB Output is correct
8 Correct 29 ms 5036 KB Output is correct
9 Correct 4 ms 2856 KB Output is correct
10 Correct 20 ms 4816 KB Output is correct
11 Correct 20 ms 5868 KB Output is correct
12 Correct 23 ms 5956 KB Output is correct
13 Correct 21 ms 5964 KB Output is correct
14 Correct 20 ms 4816 KB Output is correct
15 Correct 19 ms 5432 KB Output is correct
16 Correct 21 ms 5704 KB Output is correct
17 Correct 21 ms 5688 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 0 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 0 ms 2392 KB Output is correct
22 Correct 0 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 0 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 0 ms 2392 KB Output is correct
33 Correct 22 ms 4808 KB Output is correct
34 Correct 24 ms 4796 KB Output is correct
35 Correct 21 ms 5952 KB Output is correct
36 Correct 20 ms 4824 KB Output is correct
37 Correct 18 ms 5616 KB Output is correct
38 Correct 30 ms 5704 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct
40 Correct 12 ms 3980 KB Output is correct
41 Correct 25 ms 4812 KB Output is correct
42 Correct 18 ms 6128 KB Output is correct
43 Correct 19 ms 4824 KB Output is correct
44 Correct 19 ms 5448 KB Output is correct
45 Correct 18 ms 5864 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 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 799 ms 3632 KB Output is correct
5 Execution timed out 4022 ms 4808 KB Time limit exceeded
6 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 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 799 ms 3632 KB Output is correct
5 Execution timed out 4022 ms 4808 KB Time limit exceeded
6 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 Execution timed out 4083 ms 5292 KB Time limit exceeded
4 Halted 0 ms 0 KB -