oj.uz

Submission #478244

# Submission time Handle Problem Language Result Execution time Memory
478244 2021-10-06T16:51:35 Z khoabright Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1339 ms 66112 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) {
    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 c, int d, int maxi) {
    ++s, ++c, ++d;
    //cout<<"s,c,d,maxi="<<s<<' '<<c << ' '<<d<<' '<<maxi<<'\n';

    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) {
        int tmp = higher[s][u];
        if (tmp != 0 && tmp < c && h[tmp] <= maxi) {
            //cout<<"u,higher="<<u<<' '<<tmp<<'\n';
            ans += (1 << u);
            s = tmp;
        }
    }
    if (c <= higher[s][0] && higher[s][0] <= d) {
        return ans + 1;
    }

    if (s < c) {
        //cout << "s,ans,R0="<<s<<' '<<ans<<' '<<R[s][0]<<'\n';
        rep1(u, k, 0) {
            int tmp = R[s][u];
            if (tmp != 0 && tmp < c && h[tmp] <= maxi) {
                ans += (1 << u);
                s = tmp;
            }
        }
    }

    //cout << "she\n"<<s<<' '<<'\n';

    if (c <= R[s][0] && R[s][0] <= d) {
        return ans + 1;
    }

    return -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);
    if (h[b] > maxi) return -1;
    rep1(u, k, 0) {
        if (L[b][u] >= a && h[L[b][u]] <= maxi) {
            b = L[b][u];
        }
    }
    return minimum_jumps_sub5(b - 1, c - 1, d - 1, maxi);
} 

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 32 ms 15944 KB Output is correct
2 Correct 34 ms 15968 KB Output is correct
3 Correct 223 ms 55948 KB Output is correct
4 Correct 1335 ms 66020 KB Output is correct
5 Correct 1225 ms 41168 KB Output is correct
6 Correct 1201 ms 66076 KB Output is correct
7 Correct 1044 ms 50172 KB Output is correct
8 Correct 1243 ms 66024 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 33 ms 15956 KB Output is correct
3 Correct 33 ms 15944 KB Output is correct
4 Correct 33 ms 15924 KB Output is correct
5 Correct 36 ms 15952 KB Output is correct
6 Incorrect 40 ms 15944 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15944 KB Output is correct
2 Correct 33 ms 15956 KB Output is correct
3 Correct 33 ms 15944 KB Output is correct
4 Correct 33 ms 15924 KB Output is correct
5 Correct 36 ms 15952 KB Output is correct
6 Incorrect 40 ms 15944 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15944 KB Output is correct
2 Correct 33 ms 15948 KB Output is correct
3 Correct 36 ms 15960 KB Output is correct
4 Correct 41 ms 15948 KB Output is correct
5 Correct 123 ms 55616 KB Output is correct
6 Correct 142 ms 65224 KB Output is correct
7 Correct 86 ms 41096 KB Output is correct
8 Correct 166 ms 65340 KB Output is correct
9 Correct 48 ms 23368 KB Output is correct
10 Correct 161 ms 65228 KB Output is correct
11 Correct 141 ms 66052 KB Output is correct
12 Correct 137 ms 65948 KB Output is correct
13 Correct 159 ms 65804 KB Output is correct
14 Correct 143 ms 65220 KB Output is correct
15 Incorrect 149 ms 65588 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 33 ms 15968 KB Output is correct
2 Correct 37 ms 16012 KB Output is correct
3 Correct 32 ms 15912 KB Output is correct
4 Correct 265 ms 38504 KB Output is correct
5 Correct 1047 ms 65216 KB Output is correct
6 Correct 764 ms 23980 KB Output is correct
7 Correct 967 ms 65216 KB Output is correct
8 Correct 746 ms 32960 KB Output is correct
9 Correct 1071 ms 65216 KB Output is correct
10 Correct 1166 ms 66072 KB Output is correct
11 Correct 1284 ms 65948 KB Output is correct
12 Correct 1027 ms 65948 KB Output is correct
13 Correct 1274 ms 65296 KB Output is correct
14 Correct 1248 ms 65528 KB Output is correct
15 Correct 883 ms 65984 KB Output is correct
16 Correct 1102 ms 65960 KB Output is correct
17 Correct 33 ms 15944 KB Output is correct
18 Correct 34 ms 15956 KB Output is correct
19 Correct 39 ms 15856 KB Output is correct
20 Correct 39 ms 15992 KB Output is correct
21 Correct 37 ms 15944 KB Output is correct
22 Correct 38 ms 16016 KB Output is correct
23 Correct 36 ms 16008 KB Output is correct
24 Correct 40 ms 15944 KB Output is correct
25 Correct 37 ms 15944 KB Output is correct
26 Correct 33 ms 16124 KB Output is correct
27 Correct 59 ms 16456 KB Output is correct
28 Correct 59 ms 16456 KB Output is correct
29 Correct 61 ms 16456 KB Output is correct
30 Correct 52 ms 16456 KB Output is correct
31 Correct 52 ms 16376 KB Output is correct
32 Correct 36 ms 15960 KB Output is correct
33 Correct 97 ms 44504 KB Output is correct
34 Correct 143 ms 65216 KB Output is correct
35 Correct 159 ms 65952 KB Output is correct
36 Correct 144 ms 65196 KB Output is correct
37 Correct 151 ms 65496 KB Output is correct
38 Correct 153 ms 66052 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15968 KB Output is correct
2 Correct 37 ms 16012 KB Output is correct
3 Correct 32 ms 15912 KB Output is correct
4 Correct 265 ms 38504 KB Output is correct
5 Correct 1047 ms 65216 KB Output is correct
6 Correct 764 ms 23980 KB Output is correct
7 Correct 967 ms 65216 KB Output is correct
8 Correct 746 ms 32960 KB Output is correct
9 Correct 1071 ms 65216 KB Output is correct
10 Correct 1166 ms 66072 KB Output is correct
11 Correct 1284 ms 65948 KB Output is correct
12 Correct 1027 ms 65948 KB Output is correct
13 Correct 1274 ms 65296 KB Output is correct
14 Correct 1248 ms 65528 KB Output is correct
15 Correct 883 ms 65984 KB Output is correct
16 Correct 1102 ms 65960 KB Output is correct
17 Correct 33 ms 15944 KB Output is correct
18 Correct 34 ms 15956 KB Output is correct
19 Correct 39 ms 15856 KB Output is correct
20 Correct 39 ms 15992 KB Output is correct
21 Correct 37 ms 15944 KB Output is correct
22 Correct 38 ms 16016 KB Output is correct
23 Correct 36 ms 16008 KB Output is correct
24 Correct 40 ms 15944 KB Output is correct
25 Correct 37 ms 15944 KB Output is correct
26 Correct 33 ms 16124 KB Output is correct
27 Correct 59 ms 16456 KB Output is correct
28 Correct 59 ms 16456 KB Output is correct
29 Correct 61 ms 16456 KB Output is correct
30 Correct 52 ms 16456 KB Output is correct
31 Correct 52 ms 16376 KB Output is correct
32 Correct 36 ms 15960 KB Output is correct
33 Correct 97 ms 44504 KB Output is correct
34 Correct 143 ms 65216 KB Output is correct
35 Correct 159 ms 65952 KB Output is correct
36 Correct 144 ms 65196 KB Output is correct
37 Correct 151 ms 65496 KB Output is correct
38 Correct 153 ms 66052 KB Output is correct
39 Correct 31 ms 15944 KB Output is correct
40 Correct 32 ms 15944 KB Output is correct
41 Correct 32 ms 15944 KB Output is correct
42 Correct 300 ms 38468 KB Output is correct
43 Correct 1206 ms 65316 KB Output is correct
44 Correct 743 ms 24004 KB Output is correct
45 Correct 858 ms 65188 KB Output is correct
46 Correct 643 ms 32960 KB Output is correct
47 Correct 1242 ms 65168 KB Output is correct
48 Correct 1097 ms 66080 KB Output is correct
49 Correct 1216 ms 65984 KB Output is correct
50 Correct 1047 ms 65948 KB Output is correct
51 Correct 1339 ms 65376 KB Output is correct
52 Correct 1279 ms 65548 KB Output is correct
53 Correct 1151 ms 66048 KB Output is correct
54 Correct 1187 ms 66076 KB Output is correct
55 Correct 33 ms 15944 KB Output is correct
56 Correct 241 ms 65052 KB Output is correct
57 Correct 1243 ms 65164 KB Output is correct
58 Correct 517 ms 24512 KB Output is correct
59 Correct 1161 ms 65256 KB Output is correct
60 Correct 543 ms 33468 KB Output is correct
61 Correct 1127 ms 65216 KB Output is correct
62 Correct 1103 ms 66112 KB Output is correct
63 Correct 1137 ms 65852 KB Output is correct
64 Correct 1233 ms 65728 KB Output is correct
65 Correct 1006 ms 65236 KB Output is correct
66 Correct 1186 ms 65636 KB Output is correct
67 Correct 963 ms 65984 KB Output is correct
68 Correct 1137 ms 66024 KB Output is correct
69 Correct 33 ms 15944 KB Output is correct
70 Correct 33 ms 15944 KB Output is correct
71 Correct 38 ms 15948 KB Output is correct
72 Correct 36 ms 16000 KB Output is correct
73 Correct 35 ms 15944 KB Output is correct
74 Correct 38 ms 15944 KB Output is correct
75 Correct 38 ms 15944 KB Output is correct
76 Correct 35 ms 15848 KB Output is correct
77 Correct 35 ms 15944 KB Output is correct
78 Correct 34 ms 15944 KB Output is correct
79 Correct 36 ms 15944 KB Output is correct
80 Correct 38 ms 15944 KB Output is correct
81 Correct 40 ms 15944 KB Output is correct
82 Correct 36 ms 15944 KB Output is correct
83 Correct 37 ms 16016 KB Output is correct
84 Correct 36 ms 15976 KB Output is correct
85 Correct 38 ms 16072 KB Output is correct
86 Correct 60 ms 16444 KB Output is correct
87 Correct 55 ms 16452 KB Output is correct
88 Correct 63 ms 16404 KB Output is correct
89 Correct 60 ms 16456 KB Output is correct
90 Correct 51 ms 16448 KB Output is correct
91 Correct 33 ms 15888 KB Output is correct
92 Correct 36 ms 16140 KB Output is correct
93 Correct 56 ms 16444 KB Output is correct
94 Correct 53 ms 16456 KB Output is correct
95 Correct 50 ms 16468 KB Output is correct
96 Correct 58 ms 16460 KB Output is correct
97 Correct 57 ms 16456 KB Output is correct
98 Correct 33 ms 15944 KB Output is correct
99 Correct 140 ms 65176 KB Output is correct
100 Correct 154 ms 65232 KB Output is correct
101 Correct 138 ms 65892 KB Output is correct
102 Correct 151 ms 65224 KB Output is correct
103 Correct 177 ms 65500 KB Output is correct
104 Correct 145 ms 66080 KB Output is correct
105 Correct 36 ms 15876 KB Output is correct
106 Correct 96 ms 44448 KB Output is correct
107 Correct 167 ms 65216 KB Output is correct
108 Correct 142 ms 65984 KB Output is correct
109 Correct 143 ms 65180 KB Output is correct
110 Correct 156 ms 65512 KB Output is correct
111 Correct 136 ms 66076 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15944 KB Output is correct
2 Correct 34 ms 15968 KB Output is correct
3 Correct 223 ms 55948 KB Output is correct
4 Correct 1335 ms 66020 KB Output is correct
5 Correct 1225 ms 41168 KB Output is correct
6 Correct 1201 ms 66076 KB Output is correct
7 Correct 1044 ms 50172 KB Output is correct
8 Correct 1243 ms 66024 KB Output is correct
9 Correct 33 ms 15944 KB Output is correct
10 Correct 33 ms 15956 KB Output is correct
11 Correct 33 ms 15944 KB Output is correct
12 Correct 33 ms 15924 KB Output is correct
13 Correct 36 ms 15952 KB Output is correct
14 Incorrect 40 ms 15944 KB Output isn't correct
15 Halted 0 ms 0 KB -