oj.uz

Submission #520776

# Submission time Handle Problem Language Result Execution time Memory
520776 2022-01-31T03:28:00 Z lohacho Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1305 ms 63920 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;

struct Seg{
    int n;
    vector<int> tree;
    Seg(int N):n(N){
        tree.resize(n * 4);
    }
    void add(int x, int l, int r, int val){
        tree[x] = val;
    }
    void push(int x, int l, int r, int pl, int pr, int val){
        if(pr < l || pl > r || pl > pr) return;
        if(l >= pl && r <= pr){
            add(x, l, r, val);
            return;
        }
        int mid = (l + r) >> 1;
        push(x * 2, l, mid, pl, pr, val), push(x * 2 + 1, mid + 1, r, pl, pr, val);
        tree[x] = max(tree[x * 2], tree[x * 2 + 1]);
    }
    int get(int x, int l, int r, int fl, int fr){
        if(fr < l || fl > r || fl > fr) return -1;
        if(l >= fl && r <= fr) return tree[x];
        int mid = (l + r) >> 1;
        return max(get(x * 2, l, mid, fl, fr), get(x * 2 + 1, mid + 1, r, fl, fr));
    }
};

const int NS = (int)2e5 + 4;
int l[NS][24], r[NS][24], lr[NS][24], n;
Seg tree(NS);
vector<int> h;

void init(int N, std::vector<int> H) {
    n = N;
    h.push_back((int)1e9);
    for(int i = 0; i < n; ++i){
        h.push_back(H[i]);
    }
    h.push_back((int)1e9);
    for(int i = 1; i <= n; ++i){
        tree.push(1, 1, n, i, i, h[i]);
    }
    vector<pair<int, int>> stk = {{h[0], 0}};
    for(int i = 1; i <= n; ++i){
        while(stk.back().first < h[i]){
            stk.pop_back();
        }
        l[i][0] = stk.back().second;
        stk.push_back({h[i], i});
    }
    stk = {{h[n + 1], n + 1}};
    for(int i = n; i >= 1; --i){
        while(stk.back().first < h[i]){
            stk.pop_back();
        }
        r[i][0] = stk.back().second;
        stk.push_back({h[i], i});
    }
    for(int i = 1; i <= n; ++i){
        lr[i][0] = (h[l[i][0]] > h[r[i][0]] ? l[i][0] : r[i][0]);
    }
    for(int j = 1; j < 20; ++j){
        for(int i = 1; i <= n; ++i){
            l[i][j] = l[l[i][j - 1]][j - 1];
            r[i][j] = r[r[i][j - 1]][j - 1];
            lr[i][j] = lr[lr[i][j - 1]][j - 1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    int mh = tree.get(1, 1, n, B + 1, C - 1), rh = tree.get(1, 1, n, C, D);
    int pos = B;
    for(int i = 19; i >= 0; --i){
        if(l[pos][i] >= A && h[l[pos][i]] < rh){
            pos = l[pos][i];
        }
    }
    int rv = 0;
    for(int i = 19; i >= 0; --i){
        if(h[pos] < mh && h[lr[pos][i]] < rh){
            pos = lr[pos][i]; rv += (1 << i);
        }
    }
    if(h[pos] > rh || mh > rh) return -1;
    if(h[pos] > mh) return rv + 1;
    for(int i = 19; i >= 0; --i){
        if(r[pos][i] < C && r[pos][i]){
            pos = r[pos][i]; rv += (1 << i);
        }
    }
    return rv + 1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 235 ms 51424 KB Output is correct
4 Correct 1294 ms 63840 KB Output is correct
5 Correct 1154 ms 33896 KB Output is correct
6 Correct 1261 ms 63796 KB Output is correct
7 Correct 894 ms 44640 KB Output is correct
8 Correct 1305 ms 63764 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 3 ms 3400 KB Output is correct
4 Correct 2 ms 3400 KB Output is correct
5 Correct 4 ms 3400 KB Output is correct
6 Correct 4 ms 3424 KB Output is correct
7 Correct 4 ms 3400 KB Output is correct
8 Correct 3 ms 3400 KB Output is correct
9 Correct 2 ms 3400 KB Output is correct
10 Incorrect 3 ms 3400 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 3 ms 3400 KB Output is correct
4 Correct 2 ms 3400 KB Output is correct
5 Correct 4 ms 3400 KB Output is correct
6 Correct 4 ms 3424 KB Output is correct
7 Correct 4 ms 3400 KB Output is correct
8 Correct 3 ms 3400 KB Output is correct
9 Correct 2 ms 3400 KB Output is correct
10 Incorrect 3 ms 3400 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3400 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 2 ms 3400 KB Output is correct
4 Correct 2 ms 3400 KB Output is correct
5 Correct 130 ms 50768 KB Output is correct
6 Correct 146 ms 62164 KB Output is correct
7 Correct 73 ms 33488 KB Output is correct
8 Correct 152 ms 62164 KB Output is correct
9 Correct 22 ms 12360 KB Output is correct
10 Correct 139 ms 62156 KB Output is correct
11 Correct 159 ms 63768 KB Output is correct
12 Correct 155 ms 63376 KB Output is correct
13 Correct 139 ms 63248 KB Output is correct
14 Correct 142 ms 62252 KB Output is correct
15 Incorrect 158 ms 63044 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3400 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 2 ms 3400 KB Output is correct
4 Correct 278 ms 30364 KB Output is correct
5 Correct 1137 ms 62292 KB Output is correct
6 Correct 594 ms 13116 KB Output is correct
7 Correct 1117 ms 62264 KB Output is correct
8 Correct 684 ms 23716 KB Output is correct
9 Correct 1128 ms 62172 KB Output is correct
10 Correct 1186 ms 63760 KB Output is correct
11 Correct 1157 ms 63668 KB Output is correct
12 Correct 1183 ms 63508 KB Output is correct
13 Correct 737 ms 62260 KB Output is correct
14 Correct 1173 ms 63056 KB Output is correct
15 Correct 808 ms 63824 KB Output is correct
16 Correct 909 ms 63920 KB Output is correct
17 Correct 2 ms 3400 KB Output is correct
18 Correct 2 ms 3400 KB Output is correct
19 Correct 3 ms 3400 KB Output is correct
20 Correct 4 ms 3400 KB Output is correct
21 Correct 4 ms 3528 KB Output is correct
22 Correct 4 ms 3400 KB Output is correct
23 Correct 3 ms 3400 KB Output is correct
24 Correct 3 ms 3400 KB Output is correct
25 Correct 2 ms 3480 KB Output is correct
26 Correct 2 ms 3676 KB Output is correct
27 Correct 21 ms 4040 KB Output is correct
28 Correct 26 ms 4040 KB Output is correct
29 Correct 22 ms 4040 KB Output is correct
30 Correct 22 ms 4040 KB Output is correct
31 Correct 22 ms 4040 KB Output is correct
32 Correct 2 ms 3400 KB Output is correct
33 Correct 85 ms 37672 KB Output is correct
34 Correct 140 ms 62260 KB Output is correct
35 Correct 135 ms 63564 KB Output is correct
36 Correct 141 ms 62268 KB Output is correct
37 Correct 173 ms 63000 KB Output is correct
38 Correct 138 ms 63820 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3400 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 2 ms 3400 KB Output is correct
4 Correct 278 ms 30364 KB Output is correct
5 Correct 1137 ms 62292 KB Output is correct
6 Correct 594 ms 13116 KB Output is correct
7 Correct 1117 ms 62264 KB Output is correct
8 Correct 684 ms 23716 KB Output is correct
9 Correct 1128 ms 62172 KB Output is correct
10 Correct 1186 ms 63760 KB Output is correct
11 Correct 1157 ms 63668 KB Output is correct
12 Correct 1183 ms 63508 KB Output is correct
13 Correct 737 ms 62260 KB Output is correct
14 Correct 1173 ms 63056 KB Output is correct
15 Correct 808 ms 63824 KB Output is correct
16 Correct 909 ms 63920 KB Output is correct
17 Correct 2 ms 3400 KB Output is correct
18 Correct 2 ms 3400 KB Output is correct
19 Correct 3 ms 3400 KB Output is correct
20 Correct 4 ms 3400 KB Output is correct
21 Correct 4 ms 3528 KB Output is correct
22 Correct 4 ms 3400 KB Output is correct
23 Correct 3 ms 3400 KB Output is correct
24 Correct 3 ms 3400 KB Output is correct
25 Correct 2 ms 3480 KB Output is correct
26 Correct 2 ms 3676 KB Output is correct
27 Correct 21 ms 4040 KB Output is correct
28 Correct 26 ms 4040 KB Output is correct
29 Correct 22 ms 4040 KB Output is correct
30 Correct 22 ms 4040 KB Output is correct
31 Correct 22 ms 4040 KB Output is correct
32 Correct 2 ms 3400 KB Output is correct
33 Correct 85 ms 37672 KB Output is correct
34 Correct 140 ms 62260 KB Output is correct
35 Correct 135 ms 63564 KB Output is correct
36 Correct 141 ms 62268 KB Output is correct
37 Correct 173 ms 63000 KB Output is correct
38 Correct 138 ms 63820 KB Output is correct
39 Correct 2 ms 3400 KB Output is correct
40 Correct 2 ms 3400 KB Output is correct
41 Correct 2 ms 3400 KB Output is correct
42 Correct 313 ms 30400 KB Output is correct
43 Correct 1163 ms 62260 KB Output is correct
44 Correct 782 ms 13152 KB Output is correct
45 Correct 1147 ms 62184 KB Output is correct
46 Correct 564 ms 23788 KB Output is correct
47 Correct 1020 ms 62260 KB Output is correct
48 Correct 1170 ms 63848 KB Output is correct
49 Correct 1133 ms 63696 KB Output is correct
50 Correct 1178 ms 63564 KB Output is correct
51 Correct 937 ms 62256 KB Output is correct
52 Correct 1209 ms 63000 KB Output is correct
53 Correct 1018 ms 63796 KB Output is correct
54 Correct 872 ms 63796 KB Output is correct
55 Correct 1 ms 3400 KB Output is correct
56 Correct 192 ms 61908 KB Output is correct
57 Correct 1012 ms 62152 KB Output is correct
58 Correct 566 ms 13796 KB Output is correct
59 Correct 1093 ms 62260 KB Output is correct
60 Correct 458 ms 24376 KB Output is correct
61 Correct 1050 ms 62280 KB Output is correct
62 Correct 1140 ms 63828 KB Output is correct
63 Correct 1159 ms 63364 KB Output is correct
64 Correct 1054 ms 63264 KB Output is correct
65 Correct 1004 ms 62168 KB Output is correct
66 Correct 1068 ms 63052 KB Output is correct
67 Correct 1020 ms 63796 KB Output is correct
68 Correct 928 ms 63704 KB Output is correct
69 Correct 2 ms 3400 KB Output is correct
70 Correct 2 ms 3400 KB Output is correct
71 Correct 4 ms 3400 KB Output is correct
72 Correct 4 ms 3444 KB Output is correct
73 Correct 4 ms 3400 KB Output is correct
74 Correct 3 ms 3400 KB Output is correct
75 Correct 4 ms 3400 KB Output is correct
76 Correct 1 ms 3400 KB Output is correct
77 Correct 1 ms 3400 KB Output is correct
78 Correct 3 ms 3400 KB Output is correct
79 Correct 3 ms 3400 KB Output is correct
80 Correct 4 ms 3400 KB Output is correct
81 Correct 3 ms 3400 KB Output is correct
82 Correct 3 ms 3400 KB Output is correct
83 Correct 3 ms 3528 KB Output is correct
84 Correct 2 ms 3400 KB Output is correct
85 Correct 4 ms 3440 KB Output is correct
86 Correct 17 ms 4040 KB Output is correct
87 Correct 23 ms 4040 KB Output is correct
88 Correct 20 ms 4040 KB Output is correct
89 Correct 22 ms 4040 KB Output is correct
90 Correct 22 ms 4040 KB Output is correct
91 Correct 2 ms 3528 KB Output is correct
92 Correct 2 ms 3656 KB Output is correct
93 Correct 21 ms 4040 KB Output is correct
94 Correct 18 ms 4040 KB Output is correct
95 Correct 23 ms 4040 KB Output is correct
96 Correct 21 ms 4040 KB Output is correct
97 Correct 21 ms 4040 KB Output is correct
98 Correct 1 ms 3400 KB Output is correct
99 Correct 144 ms 62176 KB Output is correct
100 Correct 146 ms 62160 KB Output is correct
101 Correct 136 ms 63452 KB Output is correct
102 Correct 143 ms 62172 KB Output is correct
103 Correct 149 ms 62948 KB Output is correct
104 Correct 136 ms 63796 KB Output is correct
105 Correct 2 ms 3400 KB Output is correct
106 Correct 89 ms 37720 KB Output is correct
107 Correct 137 ms 62164 KB Output is correct
108 Correct 143 ms 63588 KB Output is correct
109 Correct 135 ms 62160 KB Output is correct
110 Correct 168 ms 62952 KB Output is correct
111 Correct 135 ms 63708 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 235 ms 51424 KB Output is correct
4 Correct 1294 ms 63840 KB Output is correct
5 Correct 1154 ms 33896 KB Output is correct
6 Correct 1261 ms 63796 KB Output is correct
7 Correct 894 ms 44640 KB Output is correct
8 Correct 1305 ms 63764 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 2 ms 3400 KB Output is correct
11 Correct 3 ms 3400 KB Output is correct
12 Correct 2 ms 3400 KB Output is correct
13 Correct 4 ms 3400 KB Output is correct
14 Correct 4 ms 3424 KB Output is correct
15 Correct 4 ms 3400 KB Output is correct
16 Correct 3 ms 3400 KB Output is correct
17 Correct 2 ms 3400 KB Output is correct
18 Incorrect 3 ms 3400 KB Output isn't correct
19 Halted 0 ms 0 KB -