oj.uz

Submission #566702

# Submission time Handle Problem Language Result Execution time Memory
566702 2022-05-22T16:57:05 Z Ooops_sorry Rainforest Jumps (APIO21_jumps) C++14
56 / 100
 4000 ms 36536 KB 
#include<bits/stdc++.h>
#ifndef LOCAL
    #include "jumps.h"
#endif

#define ld long double
#define ll long long
#define pb push_back

using namespace std;

const int INF = 1e9;

mt19937 rnd(51);

int n;
vector<int> h, l, r;
vector<vector<int>> po, po_r;

void init(int N, std::vector<int> H) {
    h = H;
    n = N;
    l.clear(), r.clear();
    l.resize(n, -1);
    r.resize(n, n);
    po.resize(20);
    po_r.resize(20);
    for (int i = 0; i < 20; i++) {
        po[i].resize(n);
        po_r[i].resize(n);
    }
    deque<int> q;
    for (int i = 0; i < n; i++) {
        while (q.size() > 0 && h[q.back()] < h[i]) {
            r[q.back()] = i;
            q.pop_back();
        }
        q.pb(i);
    }
    q.clear();
    for (int i = n - 1; i >= 0; i--) {
        while (q.size() > 0 && h[q.back()] < h[i]) {
            l[q.back()] = i;
            q.pop_back();
        }
        q.pb(i);
    }
    for (int i = 0; i < n; i++) {
        int L = l[i], R = r[i];
        if (R == n) {
            po_r[0][i] = i;
        } else {
            po_r[0][i] = R;
        }
        if (L == -1) {
            if (R == n) {
                po[0][i] = i;
            } else {
                po[0][i] = R;
            }
        } else {
            if (R == n || h[L] > h[R]) {
                po[0][i] = L;
            } else {
                po[0][i] = R;
            }
        }
    }
    for (int i = 1; i < 20; i++) {
        for (int j = 0; j < n; j++) {
            po[i][j] = po[i - 1][po[i - 1][j]];
            po_r[i][j] = po_r[i - 1][po_r[i - 1][j]];
        }
    }
}

int minimum_jumps(int a, int b, int c, int d) {
    int j = c, k = -1;
    for (int i = c; i <= d; i++) {
        if (h[i] > h[j]) {
            j = i;
        }
    }
    for (int i = b; i >= a && h[i] < h[j]; i--) {
        if (k == -1 || h[i] > h[k]) {
            k = i;
        }
    }
    if (k == -1) return -1;
    int cnt = 1;
    for (int i = 19; i >= 0; i--) {
        int ind = po[i][k];
        if (h[ind] < h[j] && r[ind] < c) {
            k = ind;
            cnt += (1 << i);
        }
    }
    if (r[k] >= c && r[k] <= d) {
        return cnt;
    }
    if (l[k] != -1 && h[l[k]] < h[j] && r[l[k]] >= c) {
        return cnt + 1;
    }
    for (int i = 19; i >= 0; i--) {
        int ind = po_r[i][k];
        if (r[ind] < c) {
            k = ind;
            cnt += (1 << i);
        }
    }
    k = r[k];
    if (r[k] > d) return -1;
    return cnt + 1;
}

#ifdef LOCAL

int my_solve(int a, int b, int c, int d) {
    map<int,int> dist;
    deque<int> q;
    for (int i = a; i <= b; i++) {
        dist[i] = 0;
        q.pb(i);
    }
    while (q.size() > 0) {
        int v = q.front();
        if (c <= v && v <= d) return dist[v];
        q.pop_front();
        int L = l[v], R = r[v];
        if (L != -1 && dist.find(L) == dist.end()) {
            dist[L] = dist[v] + 1;
            q.pb(L);
        }
        if (R != n && dist.find(R) == dist.end()) {
            dist[R] = dist[v] + 1;
            q.pb(R);
        }
    }
    return -1;
}

int main() {
  while (1) {
    int n = rnd() % 10 + 1, q = rnd() % 10 + 1;
    vector<int> h(n);
    iota(h.begin(), h.end(), 1);
    shuffle(h.begin(), h.end(), rnd);
    init(n, h);
    cout << n << endl;
    for (auto to : h) {
        cout << to << ' ';
    }
    cout << endl;
    for (int i = 0; i < q; i++) {
        vector<int> arr(4);
        for (int j = 0; j < 4; j++) arr[j] = rnd() % n;
        sort(arr.begin(), arr.end());
        if (arr[1] >= arr[2]) continue;
        cout << arr[0] << ' ' << arr[1] << ' ' << arr[2] << ' ' << arr[3] << endl;
        auto res = minimum_jumps(arr[0], arr[1], arr[2], arr[3]), res2 = my_solve(arr[0], arr[1], arr[2], arr[3]);
        if (res != res2) {
            cout << "BAD" << endl;
            cout << res << ' ' << res2 << endl;
            return 0;
        }
    }
  }
}

#endif

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 276 KB Output is correct
3 Correct 1982 ms 28996 KB Output is correct
4 Execution timed out 4035 ms 36480 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 51 ms 28704 KB Output is correct
6 Correct 46 ms 35616 KB Output is correct
7 Correct 32 ms 18328 KB Output is correct
8 Correct 59 ms 35636 KB Output is correct
9 Correct 7 ms 5600 KB Output is correct
10 Correct 45 ms 35644 KB Output is correct
11 Correct 46 ms 36536 KB Output is correct
12 Correct 41 ms 36344 KB Output is correct
13 Correct 38 ms 36120 KB Output is correct
14 Correct 44 ms 35636 KB Output is correct
15 Correct 43 ms 36016 KB Output is correct
16 Correct 54 ms 36384 KB Output is correct
17 Correct 49 ms 36388 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 47 ms 35444 KB Output is correct
34 Correct 45 ms 35644 KB Output is correct
35 Correct 40 ms 36256 KB Output is correct
36 Correct 46 ms 35528 KB Output is correct
37 Correct 56 ms 36020 KB Output is correct
38 Correct 55 ms 36528 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 39 ms 20848 KB Output is correct
41 Correct 49 ms 35604 KB Output is correct
42 Correct 42 ms 36252 KB Output is correct
43 Correct 44 ms 35640 KB Output is correct
44 Correct 39 ms 36012 KB Output is correct
45 Correct 41 ms 36384 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 199 ms 16536 KB Output is correct
5 Correct 880 ms 35528 KB Output is correct
6 Correct 502 ms 6220 KB Output is correct
7 Correct 772 ms 35636 KB Output is correct
8 Correct 540 ms 12572 KB Output is correct
9 Correct 744 ms 35616 KB Output is correct
10 Correct 976 ms 36380 KB Output is correct
11 Correct 981 ms 36296 KB Output is correct
12 Correct 990 ms 36348 KB Output is correct
13 Correct 797 ms 35636 KB Output is correct
14 Correct 838 ms 36012 KB Output is correct
15 Correct 743 ms 36460 KB Output is correct
16 Correct 824 ms 36424 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 17 ms 592 KB Output is correct
28 Correct 17 ms 592 KB Output is correct
29 Correct 17 ms 592 KB Output is correct
30 Correct 17 ms 592 KB Output is correct
31 Correct 15 ms 592 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 28 ms 20728 KB Output is correct
34 Correct 56 ms 35756 KB Output is correct
35 Correct 39 ms 36268 KB Output is correct
36 Correct 46 ms 35636 KB Output is correct
37 Correct 39 ms 36012 KB Output is correct
38 Correct 37 ms 36376 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 199 ms 16536 KB Output is correct
5 Correct 880 ms 35528 KB Output is correct
6 Correct 502 ms 6220 KB Output is correct
7 Correct 772 ms 35636 KB Output is correct
8 Correct 540 ms 12572 KB Output is correct
9 Correct 744 ms 35616 KB Output is correct
10 Correct 976 ms 36380 KB Output is correct
11 Correct 981 ms 36296 KB Output is correct
12 Correct 990 ms 36348 KB Output is correct
13 Correct 797 ms 35636 KB Output is correct
14 Correct 838 ms 36012 KB Output is correct
15 Correct 743 ms 36460 KB Output is correct
16 Correct 824 ms 36424 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 17 ms 592 KB Output is correct
28 Correct 17 ms 592 KB Output is correct
29 Correct 17 ms 592 KB Output is correct
30 Correct 17 ms 592 KB Output is correct
31 Correct 15 ms 592 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 28 ms 20728 KB Output is correct
34 Correct 56 ms 35756 KB Output is correct
35 Correct 39 ms 36268 KB Output is correct
36 Correct 46 ms 35636 KB Output is correct
37 Correct 39 ms 36012 KB Output is correct
38 Correct 37 ms 36376 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 231 ms 16416 KB Output is correct
43 Correct 838 ms 35636 KB Output is correct
44 Correct 510 ms 6224 KB Output is correct
45 Correct 855 ms 35528 KB Output is correct
46 Correct 492 ms 12496 KB Output is correct
47 Correct 733 ms 35528 KB Output is correct
48 Correct 898 ms 36516 KB Output is correct
49 Correct 834 ms 36380 KB Output is correct
50 Correct 968 ms 36280 KB Output is correct
51 Correct 756 ms 35604 KB Output is correct
52 Correct 924 ms 36040 KB Output is correct
53 Correct 828 ms 36464 KB Output is correct
54 Correct 803 ms 36424 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Correct 117 ms 35452 KB Output is correct
57 Correct 968 ms 35616 KB Output is correct
58 Correct 322 ms 6568 KB Output is correct
59 Correct 813 ms 35604 KB Output is correct
60 Correct 363 ms 12880 KB Output is correct
61 Correct 899 ms 35640 KB Output is correct
62 Execution timed out 4014 ms 36424 KB Time limit exceeded
63 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 276 KB Output is correct
3 Correct 1982 ms 28996 KB Output is correct
4 Execution timed out 4035 ms 36480 KB Time limit exceeded
5 Halted 0 ms 0 KB -