oj.uz

Submission #939966

# Submission time Handle Problem Language Result Execution time Memory
939966 2024-03-07T02:40:13 Z bobbilyking Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 17656 KB 
#include "jumps.h"
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

template<typename A, typename B>
A& chmax(A &a, B b) { return a < b ? (a=b): a; }

template<typename A, typename B>
A& chmin(A &a, B b) { return a > b ? (a=b): a; }

const ll NN = 2e5 + 10;
const ll INF = 1e9 + 1;
ll n;

vl graph[NN];


void init(int _N, std::vector<int> H) {
    n = _N;
    vl lst(n);
    F(i, 0, n) {
        lst[i] = i - 1;
        while (lst[i] != -1 and H[lst[i]] < H[i]) lst[i] = lst[lst[i]];
        if (lst[i] != -1) graph[i].push_back(lst[i]);
    }
    FD(i, n-1, -1) {
        lst[i] = i + 1;
        while (lst[i] != n and H[lst[i]] < H[i]) lst[i] = lst[lst[i]];
        if (lst[i] != n) graph[i].push_back(lst[i]);
    }
    


}

int minimum_jumps(int A, int B, int C, int D) {
   vl dist(n, INF);

    vl q;
    F(i, A, B+1) q.push_back(i), dist[i] = 0;

    while (q.size()) for (auto i: exchange(q, {})) {
        for (auto x: graph[i]) if (dist[i] + 1 < dist[x]) {
            dist[x] = dist[i] + 1; q.push_back(x);
        }
    }

    ll res = *min_element(dist.begin() + C, dist.begin() +D + 1);

    return res == INF ? -1: res;
}

Subtask #1
0 / 4.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 27 ms 13864 KB Output is correct
6 Correct 36 ms 15652 KB Output is correct
7 Correct 17 ms 9896 KB Output is correct
8 Correct 39 ms 17656 KB Output is correct
9 Correct 9 ms 6744 KB Output is correct
10 Correct 34 ms 15056 KB Output is correct
11 Correct 36 ms 17120 KB Output is correct
12 Correct 39 ms 16100 KB Output is correct
13 Correct 36 ms 15840 KB Output is correct
14 Correct 37 ms 15072 KB Output is correct
15 Correct 43 ms 16056 KB Output is correct
16 Correct 37 ms 17144 KB Output is correct
17 Correct 42 ms 17144 KB Output is correct
18 Correct 1 ms 4952 KB Output is correct
19 Correct 1 ms 4952 KB Output is correct
20 Correct 1 ms 4952 KB Output is correct
21 Correct 3 ms 4952 KB Output is correct
22 Correct 1 ms 4952 KB Output is correct
23 Correct 1 ms 4952 KB Output is correct
24 Correct 1 ms 4952 KB Output is correct
25 Correct 1 ms 4952 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 5208 KB Output is correct
28 Correct 2 ms 5208 KB Output is correct
29 Correct 2 ms 5208 KB Output is correct
30 Correct 2 ms 5208 KB Output is correct
31 Correct 2 ms 5208 KB Output is correct
32 Correct 1 ms 4952 KB Output is correct
33 Correct 35 ms 14364 KB Output is correct
34 Correct 35 ms 15844 KB Output is correct
35 Correct 35 ms 16104 KB Output is correct
36 Correct 32 ms 15180 KB Output is correct
37 Correct 38 ms 15092 KB Output is correct
38 Correct 30 ms 17140 KB Output is correct
39 Correct 1 ms 4952 KB Output is correct
40 Correct 19 ms 10880 KB Output is correct
41 Correct 36 ms 15084 KB Output is correct
42 Correct 33 ms 15092 KB Output is correct
43 Correct 34 ms 15076 KB Output is correct
44 Correct 49 ms 15128 KB Output is correct
45 Correct 36 ms 14356 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 684 ms 9536 KB Output is correct
5 Execution timed out 4038 ms 15096 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 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 684 ms 9536 KB Output is correct
5 Execution timed out 4038 ms 15096 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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