oj.uz

Submission #520786

# Submission time Handle Problem Language Result Execution time Memory
520786 2022-01-31T04:14:34 Z lohacho Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1221 ms 63964 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 ch = B;
    for(int i = 19; i >= 0; --i){
        if(r[ch][i] <= D && r[ch][i]) ch = r[ch][i];
    }
    if(ch < C) return -1;
    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 1 ms 3400 KB Output is correct
2 Correct 2 ms 3400 KB Output is correct
3 Correct 232 ms 51420 KB Output is correct
4 Correct 1130 ms 63832 KB Output is correct
5 Correct 1074 ms 33900 KB Output is correct
6 Correct 1101 ms 63708 KB Output is correct
7 Correct 916 ms 44632 KB Output is correct
8 Correct 1194 ms 63764 KB Output is correct

Subtask #2
0 / 8.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 3 ms 3400 KB Output is correct
6 Correct 4 ms 3528 KB Output is correct
7 Correct 3 ms 3400 KB Output is correct
8 Correct 4 ms 3400 KB Output is correct
9 Correct 2 ms 3400 KB Output is correct
10 Incorrect 4 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 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 3 ms 3400 KB Output is correct
6 Correct 4 ms 3528 KB Output is correct
7 Correct 3 ms 3400 KB Output is correct
8 Correct 4 ms 3400 KB Output is correct
9 Correct 2 ms 3400 KB Output is correct
10 Incorrect 4 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 1 ms 3400 KB Output is correct
5 Correct 125 ms 50764 KB Output is correct
6 Correct 165 ms 62256 KB Output is correct
7 Correct 84 ms 33556 KB Output is correct
8 Correct 140 ms 62264 KB Output is correct
9 Correct 20 ms 12360 KB Output is correct
10 Correct 139 ms 62192 KB Output is correct
11 Correct 145 ms 63964 KB Output is correct
12 Correct 151 ms 63384 KB Output is correct
13 Correct 135 ms 63328 KB Output is correct
14 Correct 140 ms 62164 KB Output is correct
15 Incorrect 173 ms 63056 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 1 ms 3400 KB Output is correct
4 Correct 275 ms 30288 KB Output is correct
5 Correct 988 ms 62260 KB Output is correct
6 Correct 579 ms 13224 KB Output is correct
7 Correct 1006 ms 62176 KB Output is correct
8 Correct 550 ms 23864 KB Output is correct
9 Correct 996 ms 62136 KB Output is correct
10 Correct 1064 ms 63796 KB Output is correct
11 Correct 1008 ms 63668 KB Output is correct
12 Correct 1184 ms 63504 KB Output is correct
13 Correct 879 ms 62180 KB Output is correct
14 Correct 1152 ms 63004 KB Output is correct
15 Correct 1004 ms 63796 KB Output is correct
16 Correct 1085 ms 63796 KB Output is correct
17 Correct 1 ms 3400 KB Output is correct
18 Correct 1 ms 3400 KB Output is correct
19 Correct 3 ms 3400 KB Output is correct
20 Correct 4 ms 3528 KB Output is correct
21 Correct 4 ms 3400 KB Output is correct
22 Correct 4 ms 3452 KB Output is correct
23 Correct 3 ms 3400 KB Output is correct
24 Correct 4 ms 3400 KB Output is correct
25 Correct 2 ms 3400 KB Output is correct
26 Correct 2 ms 3656 KB Output is correct
27 Correct 21 ms 4040 KB Output is correct
28 Correct 18 ms 4040 KB Output is correct
29 Correct 9 ms 4040 KB Output is correct
30 Correct 23 ms 4040 KB Output is correct
31 Correct 18 ms 4040 KB Output is correct
32 Correct 2 ms 3400 KB Output is correct
33 Correct 85 ms 37432 KB Output is correct
34 Correct 142 ms 62172 KB Output is correct
35 Correct 140 ms 63588 KB Output is correct
36 Correct 141 ms 62256 KB Output is correct
37 Correct 151 ms 63032 KB Output is correct
38 Correct 142 ms 63712 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 1 ms 3400 KB Output is correct
4 Correct 275 ms 30288 KB Output is correct
5 Correct 988 ms 62260 KB Output is correct
6 Correct 579 ms 13224 KB Output is correct
7 Correct 1006 ms 62176 KB Output is correct
8 Correct 550 ms 23864 KB Output is correct
9 Correct 996 ms 62136 KB Output is correct
10 Correct 1064 ms 63796 KB Output is correct
11 Correct 1008 ms 63668 KB Output is correct
12 Correct 1184 ms 63504 KB Output is correct
13 Correct 879 ms 62180 KB Output is correct
14 Correct 1152 ms 63004 KB Output is correct
15 Correct 1004 ms 63796 KB Output is correct
16 Correct 1085 ms 63796 KB Output is correct
17 Correct 1 ms 3400 KB Output is correct
18 Correct 1 ms 3400 KB Output is correct
19 Correct 3 ms 3400 KB Output is correct
20 Correct 4 ms 3528 KB Output is correct
21 Correct 4 ms 3400 KB Output is correct
22 Correct 4 ms 3452 KB Output is correct
23 Correct 3 ms 3400 KB Output is correct
24 Correct 4 ms 3400 KB Output is correct
25 Correct 2 ms 3400 KB Output is correct
26 Correct 2 ms 3656 KB Output is correct
27 Correct 21 ms 4040 KB Output is correct
28 Correct 18 ms 4040 KB Output is correct
29 Correct 9 ms 4040 KB Output is correct
30 Correct 23 ms 4040 KB Output is correct
31 Correct 18 ms 4040 KB Output is correct
32 Correct 2 ms 3400 KB Output is correct
33 Correct 85 ms 37432 KB Output is correct
34 Correct 142 ms 62172 KB Output is correct
35 Correct 140 ms 63588 KB Output is correct
36 Correct 141 ms 62256 KB Output is correct
37 Correct 151 ms 63032 KB Output is correct
38 Correct 142 ms 63712 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 291 ms 30364 KB Output is correct
43 Correct 1076 ms 62272 KB Output is correct
44 Correct 673 ms 13252 KB Output is correct
45 Correct 1029 ms 62300 KB Output is correct
46 Correct 616 ms 23736 KB Output is correct
47 Correct 817 ms 62264 KB Output is correct
48 Correct 1199 ms 63716 KB Output is correct
49 Correct 1195 ms 63584 KB Output is correct
50 Correct 1027 ms 63584 KB Output is correct
51 Correct 942 ms 62268 KB Output is correct
52 Correct 1124 ms 62952 KB Output is correct
53 Correct 990 ms 63716 KB Output is correct
54 Correct 1095 ms 63708 KB Output is correct
55 Correct 2 ms 3400 KB Output is correct
56 Correct 193 ms 62028 KB Output is correct
57 Correct 821 ms 62264 KB Output is correct
58 Correct 418 ms 13764 KB Output is correct
59 Correct 953 ms 62260 KB Output is correct
60 Correct 379 ms 24376 KB Output is correct
61 Correct 1088 ms 62260 KB Output is correct
62 Correct 1173 ms 63796 KB Output is correct
63 Correct 1221 ms 63412 KB Output is correct
64 Correct 1188 ms 63160 KB Output is correct
65 Correct 957 ms 62248 KB Output is correct
66 Correct 1083 ms 63036 KB Output is correct
67 Correct 1151 ms 63772 KB Output is correct
68 Correct 946 ms 63796 KB Output is correct
69 Correct 2 ms 3400 KB Output is correct
70 Correct 4 ms 3400 KB Output is correct
71 Correct 4 ms 3400 KB Output is correct
72 Correct 4 ms 3528 KB Output is correct
73 Correct 3 ms 3400 KB Output is correct
74 Correct 4 ms 3400 KB Output is correct
75 Correct 4 ms 3528 KB Output is correct
76 Correct 2 ms 3400 KB Output is correct
77 Correct 2 ms 3400 KB Output is correct
78 Correct 3 ms 3400 KB Output is correct
79 Correct 4 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 4 ms 3400 KB Output is correct
83 Correct 4 ms 3400 KB Output is correct
84 Correct 2 ms 3400 KB Output is correct
85 Correct 5 ms 3528 KB Output is correct
86 Correct 20 ms 4040 KB Output is correct
87 Correct 21 ms 4040 KB Output is correct
88 Correct 23 ms 4040 KB Output is correct
89 Correct 21 ms 4040 KB Output is correct
90 Correct 23 ms 4040 KB Output is correct
91 Correct 2 ms 3400 KB Output is correct
92 Correct 2 ms 3656 KB Output is correct
93 Correct 21 ms 4040 KB Output is correct
94 Correct 23 ms 4040 KB Output is correct
95 Correct 22 ms 4040 KB Output is correct
96 Correct 22 ms 4040 KB Output is correct
97 Correct 10 ms 4040 KB Output is correct
98 Correct 2 ms 3400 KB Output is correct
99 Correct 138 ms 62056 KB Output is correct
100 Correct 140 ms 62300 KB Output is correct
101 Correct 152 ms 63396 KB Output is correct
102 Correct 154 ms 62180 KB Output is correct
103 Correct 158 ms 63032 KB Output is correct
104 Correct 140 ms 63760 KB Output is correct
105 Correct 1 ms 3400 KB Output is correct
106 Correct 90 ms 37548 KB Output is correct
107 Correct 140 ms 62160 KB Output is correct
108 Correct 146 ms 63564 KB Output is correct
109 Correct 149 ms 62268 KB Output is correct
110 Correct 151 ms 62952 KB Output is correct
111 Correct 140 ms 63792 KB Output is correct

Subtask #7
0 / 19.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 232 ms 51420 KB Output is correct
4 Correct 1130 ms 63832 KB Output is correct
5 Correct 1074 ms 33900 KB Output is correct
6 Correct 1101 ms 63708 KB Output is correct
7 Correct 916 ms 44632 KB Output is correct
8 Correct 1194 ms 63764 KB Output is correct
9 Correct 2 ms 3400 KB Output is correct
10 Correct 2 ms 3400 KB Output is correct
11 Correct 2 ms 3400 KB Output is correct
12 Correct 2 ms 3400 KB Output is correct
13 Correct 3 ms 3400 KB Output is correct
14 Correct 4 ms 3528 KB Output is correct
15 Correct 3 ms 3400 KB Output is correct
16 Correct 4 ms 3400 KB Output is correct
17 Correct 2 ms 3400 KB Output is correct
18 Incorrect 4 ms 3400 KB Output isn't correct
19 Halted 0 ms 0 KB -