oj.uz

Submission #478320

# Submission time Handle Problem Language Result Execution time Memory
478320 2021-10-07T02:38:23 Z khoabright Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1452 ms 66120 KB 
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair

const int N = 2e5 + 5;
const int k = 19;

int L[N][20], R[N][20], higher[N][20], h[N], f[N][20];
int my_size;
bool sub1 = 1;

void cal_LR() {
    rep(i, 1, my_size) if (h[i] != i) {
        sub1 = 0;
        break;
    }
    
    stack<int> st;

    rep(i, 1, my_size) {
        while (!st.empty() && h[st.top()] < h[i]) st.pop();
        if (!st.empty()) L[i][0] = st.top();

        st.push(i);
    }

    while (!st.empty()) st.pop();

    rep1(i, my_size, 1) {
        while (!st.empty() && h[st.top()] < h[i]) st.pop();
        if (!st.empty()) R[i][0] = st.top();

        st.push(i);
    }

    rep(i, 1, my_size) {
        if (h[L[i][0]] > h[R[i][0]]) higher[i][0] = L[i][0];
        else higher[i][0] = R[i][0];
        if (h[higher[i][0]] < h[i]) higher[i][0] = 0;
    }

    rep(u, 1, k) {
        rep(i, 1, my_size) {
            L[i][u] = L[L[i][u - 1]][u - 1];
            R[i][u] = R[R[i][u - 1]][u - 1];
            higher[i][u] = higher[higher[i][u - 1]][u - 1];
        }
    }

    rep(i, 1, my_size) {
        f[i][0] = h[i];
    }

    rep(u, 1, k) {
        int tmp = N - (1 << u) + 1;
        rep(i, 1, tmp - 1) {
            f[i][u] = max(f[i][u - 1], f[i + (1 << (u - 1))][u - 1]);
        }
    }
}

int get_max(int l, int r) {
    if (l > r) return 0;
    int k = log2(r - l + 1);
    return max(f[l][k],f[r - (1 << k) + 1][k]);
}

int minimum_jumps_sub1234(int a, int b, int c, int d) {
    if (sub1) return c - b;
    ++a, ++b, ++c, ++d;
    queue<pii> q;
    vector<bool> vst(my_size + 1);
    vst[0] = 1;

    rep(i, a, b) q.push({i, 0}), vst[i] = 1;

    while (!q.empty()) {
        auto [u, w] = q.front();
        q.pop();
        if (c <= u && u <= d) return w;
        int v = L[u][0];
        if (!vst[v]) {
            q.push({v, w + 1});
            vst[v] = 1;
        }
        v = R[u][0];
        if (!vst[v]) {
            q.push({v, w + 1});
            vst[v] = 1;
        }
    }

    return -1;
}

int minimum_jumps_sub5(int s, int t) {
    ++s, ++t;
 
    int ans = 0;
     //cout << "s,t="<<s<<' '<<t<<'\n';
    // cout << "H,L,R="<<higher[s][0] << ' ' << L[s][0] << ' ' << R[s][0] <<' '<<
    //' '<<higher[t][0]<<' '<<L[t][0]<<' '<<R[t][0]<< '\n';
    rep1(u, k, 0) {
        if (higher[s][u] != 0 && h[higher[s][u]] < h[t]) {
            //cout<<"u,higher="<<u<<' '<<higher[s][u]<<'\n';
            ans += (1 << u);
            s = higher[s][u];
        }
    }

    //cout<<"s,ans="<<s<<' '<<ans<<'\n';

    //if (s != t) {
        //cout << "s,ans,R0="<<s<<' '<<ans<<' '<<R[s][0]<<'\n';
        rep1(u, k, 0) {
            if (R[s][u] != 0 && h[R[s][u]] < h[t]) {
                ans += (1 << u);
                s = R[s][u];
            }
        }
    //}
    if (R[s][0] != t) {
        return -1;
    }
    else return ans + 1;
}

int minimum_jumps_sub7(int a, int b, int c, int d) {
    ++a, ++b, ++c, ++d;

    //cout<<"b,L="<<b<<' '<<L[b][0]<<'\n';
    int maxi = get_max(c, d);

    int obstacle = get_max(b + 1, c - 1);
    if (h[b] > maxi) return -1;
    rep1(u, k, 0) {
        if (L[b][u] >= a && h[L[b][u]] <= maxi) {
            b = L[b][u];
        }
    }

    obstacle = max(obstacle, h[b]);
    rep1(u, k, 0) {
        if (R[c][u] != 0 && R[c][u] <= d && h[R[c][u]] < obstacle) {
            c = R[c][u];
        }
    }
    if (h[c] < obstacle && R[c][0] <= d) c = R[c][0];

    return minimum_jumps_sub5(b - 1, c - 1);
} 

int minimum_jumps(int a, int b, int c, int d) {
    return minimum_jumps_sub7(a, b, c, d);
}

void init(int sz, vector<int> array) {
    my_size = sz;
    rep(i, 1, my_size) h[i] = array[i - 1];   
    cal_LR();
}

// int main() {
//     // ios_base::sync_with_stdio(0);
//     // cin.tie(0); cout.tie(0);

//     int x; cin >> x;
//     vector<int> array(x);
//     rep(i, 1, x) cin >> array[i - 1];
//     init(x,array);

//     //rep(i, 1, my_size) cout << L[i] << ' ' << R[i]<< '\n';

//     int q; cin >> q;
//     while (q--) {
//         // int l, r; cin >> l >> r;
//         // cout << get_max(l, r) << '\n';
//         int A, B, C, D;
//         cin >> A >> B >> C >> D;
//         cout << minimum_jumps_sub7(A,B,C,D) << '\n';
//     }
// }

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15944 KB Output is correct
2 Correct 38 ms 15944 KB Output is correct
3 Correct 243 ms 55832 KB Output is correct
4 Correct 1285 ms 66080 KB Output is correct
5 Correct 1212 ms 41152 KB Output is correct
6 Correct 1295 ms 66112 KB Output is correct
7 Correct 977 ms 50200 KB Output is correct
8 Correct 1271 ms 65984 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 15944 KB Output is correct
2 Correct 34 ms 15944 KB Output is correct
3 Correct 37 ms 15944 KB Output is correct
4 Correct 34 ms 15944 KB Output is correct
5 Correct 40 ms 15964 KB Output is correct
6 Correct 40 ms 15996 KB Output is correct
7 Correct 37 ms 15944 KB Output is correct
8 Correct 39 ms 15944 KB Output is correct
9 Correct 34 ms 15944 KB Output is correct
10 Correct 46 ms 16004 KB Output is correct
11 Correct 41 ms 15944 KB Output is correct
12 Correct 37 ms 15896 KB Output is correct
13 Incorrect 36 ms 15944 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 15944 KB Output is correct
2 Correct 34 ms 15944 KB Output is correct
3 Correct 37 ms 15944 KB Output is correct
4 Correct 34 ms 15944 KB Output is correct
5 Correct 40 ms 15964 KB Output is correct
6 Correct 40 ms 15996 KB Output is correct
7 Correct 37 ms 15944 KB Output is correct
8 Correct 39 ms 15944 KB Output is correct
9 Correct 34 ms 15944 KB Output is correct
10 Correct 46 ms 16004 KB Output is correct
11 Correct 41 ms 15944 KB Output is correct
12 Correct 37 ms 15896 KB Output is correct
13 Incorrect 36 ms 15944 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15972 KB Output is correct
2 Correct 34 ms 15944 KB Output is correct
3 Correct 34 ms 15944 KB Output is correct
4 Correct 34 ms 15944 KB Output is correct
5 Correct 134 ms 55600 KB Output is correct
6 Correct 137 ms 65172 KB Output is correct
7 Correct 97 ms 41280 KB Output is correct
8 Correct 151 ms 65272 KB Output is correct
9 Correct 48 ms 23368 KB Output is correct
10 Correct 138 ms 65200 KB Output is correct
11 Correct 137 ms 66064 KB Output is correct
12 Correct 143 ms 65952 KB Output is correct
13 Incorrect 161 ms 65808 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 32 ms 15944 KB Output is correct
3 Correct 37 ms 15868 KB Output is correct
4 Correct 346 ms 38416 KB Output is correct
5 Correct 1250 ms 65348 KB Output is correct
6 Correct 830 ms 24000 KB Output is correct
7 Correct 1199 ms 65176 KB Output is correct
8 Correct 613 ms 32924 KB Output is correct
9 Correct 1188 ms 65172 KB Output is correct
10 Correct 1247 ms 65988 KB Output is correct
11 Correct 1316 ms 65952 KB Output is correct
12 Correct 1320 ms 65936 KB Output is correct
13 Correct 1281 ms 65216 KB Output is correct
14 Correct 1008 ms 65588 KB Output is correct
15 Correct 999 ms 65988 KB Output is correct
16 Correct 823 ms 66048 KB Output is correct
17 Correct 38 ms 15936 KB Output is correct
18 Correct 42 ms 15944 KB Output is correct
19 Correct 36 ms 15944 KB Output is correct
20 Correct 36 ms 16004 KB Output is correct
21 Correct 38 ms 15940 KB Output is correct
22 Correct 40 ms 15944 KB Output is correct
23 Correct 35 ms 16016 KB Output is correct
24 Correct 38 ms 15992 KB Output is correct
25 Correct 34 ms 15944 KB Output is correct
26 Correct 38 ms 16072 KB Output is correct
27 Correct 52 ms 16456 KB Output is correct
28 Correct 58 ms 16368 KB Output is correct
29 Correct 57 ms 16432 KB Output is correct
30 Correct 51 ms 16456 KB Output is correct
31 Correct 62 ms 16456 KB Output is correct
32 Correct 37 ms 16064 KB Output is correct
33 Correct 90 ms 44480 KB Output is correct
34 Correct 157 ms 65172 KB Output is correct
35 Correct 140 ms 65944 KB Output is correct
36 Correct 144 ms 65288 KB Output is correct
37 Correct 156 ms 65552 KB Output is correct
38 Correct 147 ms 65960 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 32 ms 15944 KB Output is correct
3 Correct 37 ms 15868 KB Output is correct
4 Correct 346 ms 38416 KB Output is correct
5 Correct 1250 ms 65348 KB Output is correct
6 Correct 830 ms 24000 KB Output is correct
7 Correct 1199 ms 65176 KB Output is correct
8 Correct 613 ms 32924 KB Output is correct
9 Correct 1188 ms 65172 KB Output is correct
10 Correct 1247 ms 65988 KB Output is correct
11 Correct 1316 ms 65952 KB Output is correct
12 Correct 1320 ms 65936 KB Output is correct
13 Correct 1281 ms 65216 KB Output is correct
14 Correct 1008 ms 65588 KB Output is correct
15 Correct 999 ms 65988 KB Output is correct
16 Correct 823 ms 66048 KB Output is correct
17 Correct 38 ms 15936 KB Output is correct
18 Correct 42 ms 15944 KB Output is correct
19 Correct 36 ms 15944 KB Output is correct
20 Correct 36 ms 16004 KB Output is correct
21 Correct 38 ms 15940 KB Output is correct
22 Correct 40 ms 15944 KB Output is correct
23 Correct 35 ms 16016 KB Output is correct
24 Correct 38 ms 15992 KB Output is correct
25 Correct 34 ms 15944 KB Output is correct
26 Correct 38 ms 16072 KB Output is correct
27 Correct 52 ms 16456 KB Output is correct
28 Correct 58 ms 16368 KB Output is correct
29 Correct 57 ms 16432 KB Output is correct
30 Correct 51 ms 16456 KB Output is correct
31 Correct 62 ms 16456 KB Output is correct
32 Correct 37 ms 16064 KB Output is correct
33 Correct 90 ms 44480 KB Output is correct
34 Correct 157 ms 65172 KB Output is correct
35 Correct 140 ms 65944 KB Output is correct
36 Correct 144 ms 65288 KB Output is correct
37 Correct 156 ms 65552 KB Output is correct
38 Correct 147 ms 65960 KB Output is correct
39 Correct 34 ms 15944 KB Output is correct
40 Correct 35 ms 15948 KB Output is correct
41 Correct 37 ms 15944 KB Output is correct
42 Correct 357 ms 38508 KB Output is correct
43 Correct 1161 ms 65192 KB Output is correct
44 Correct 796 ms 24000 KB Output is correct
45 Correct 1097 ms 65176 KB Output is correct
46 Correct 653 ms 32832 KB Output is correct
47 Correct 1099 ms 65344 KB Output is correct
48 Correct 1245 ms 66112 KB Output is correct
49 Correct 1309 ms 65952 KB Output is correct
50 Correct 1260 ms 65948 KB Output is correct
51 Correct 1176 ms 65480 KB Output is correct
52 Correct 1452 ms 65548 KB Output is correct
53 Correct 1126 ms 66120 KB Output is correct
54 Correct 1315 ms 65964 KB Output is correct
55 Correct 35 ms 15944 KB Output is correct
56 Correct 218 ms 64976 KB Output is correct
57 Correct 1194 ms 65256 KB Output is correct
58 Correct 510 ms 24512 KB Output is correct
59 Correct 1027 ms 65176 KB Output is correct
60 Correct 459 ms 33472 KB Output is correct
61 Correct 1111 ms 65228 KB Output is correct
62 Correct 1279 ms 66072 KB Output is correct
63 Correct 1152 ms 65888 KB Output is correct
64 Correct 1278 ms 65856 KB Output is correct
65 Correct 1057 ms 65184 KB Output is correct
66 Correct 1214 ms 65532 KB Output is correct
67 Correct 1010 ms 66040 KB Output is correct
68 Correct 1010 ms 65984 KB Output is correct
69 Correct 33 ms 15944 KB Output is correct
70 Correct 33 ms 15944 KB Output is correct
71 Correct 40 ms 15988 KB Output is correct
72 Correct 40 ms 16016 KB Output is correct
73 Correct 37 ms 15964 KB Output is correct
74 Correct 36 ms 15924 KB Output is correct
75 Correct 37 ms 15944 KB Output is correct
76 Correct 38 ms 15968 KB Output is correct
77 Correct 36 ms 15944 KB Output is correct
78 Correct 36 ms 15944 KB Output is correct
79 Correct 39 ms 15996 KB Output is correct
80 Correct 36 ms 15944 KB Output is correct
81 Correct 38 ms 15908 KB Output is correct
82 Correct 35 ms 15944 KB Output is correct
83 Correct 38 ms 16020 KB Output is correct
84 Correct 34 ms 16008 KB Output is correct
85 Correct 39 ms 16016 KB Output is correct
86 Correct 57 ms 16456 KB Output is correct
87 Correct 53 ms 16356 KB Output is correct
88 Correct 47 ms 16416 KB Output is correct
89 Correct 48 ms 16460 KB Output is correct
90 Correct 52 ms 16396 KB Output is correct
91 Correct 37 ms 15964 KB Output is correct
92 Correct 38 ms 16144 KB Output is correct
93 Correct 57 ms 16456 KB Output is correct
94 Correct 59 ms 16416 KB Output is correct
95 Correct 58 ms 16400 KB Output is correct
96 Correct 43 ms 16456 KB Output is correct
97 Correct 58 ms 16584 KB Output is correct
98 Correct 33 ms 15872 KB Output is correct
99 Correct 137 ms 65048 KB Output is correct
100 Correct 138 ms 65292 KB Output is correct
101 Correct 139 ms 65868 KB Output is correct
102 Correct 139 ms 65180 KB Output is correct
103 Correct 150 ms 65508 KB Output is correct
104 Correct 134 ms 66096 KB Output is correct
105 Correct 35 ms 15948 KB Output is correct
106 Correct 100 ms 44480 KB Output is correct
107 Correct 145 ms 65308 KB Output is correct
108 Correct 148 ms 65920 KB Output is correct
109 Correct 140 ms 65352 KB Output is correct
110 Correct 160 ms 65560 KB Output is correct
111 Correct 136 ms 65984 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15944 KB Output is correct
2 Correct 38 ms 15944 KB Output is correct
3 Correct 243 ms 55832 KB Output is correct
4 Correct 1285 ms 66080 KB Output is correct
5 Correct 1212 ms 41152 KB Output is correct
6 Correct 1295 ms 66112 KB Output is correct
7 Correct 977 ms 50200 KB Output is correct
8 Correct 1271 ms 65984 KB Output is correct
9 Correct 35 ms 15944 KB Output is correct
10 Correct 34 ms 15944 KB Output is correct
11 Correct 37 ms 15944 KB Output is correct
12 Correct 34 ms 15944 KB Output is correct
13 Correct 40 ms 15964 KB Output is correct
14 Correct 40 ms 15996 KB Output is correct
15 Correct 37 ms 15944 KB Output is correct
16 Correct 39 ms 15944 KB Output is correct
17 Correct 34 ms 15944 KB Output is correct
18 Correct 46 ms 16004 KB Output is correct
19 Correct 41 ms 15944 KB Output is correct
20 Correct 37 ms 15896 KB Output is correct
21 Incorrect 36 ms 15944 KB Output isn't correct
22 Halted 0 ms 0 KB -