oj.uz

Submission #478309

# Submission time Handle Problem Language Result Execution time Memory
478309 2021-10-07T00:36:45 Z khoabright Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1347 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 (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 30 ms 15944 KB Output is correct
2 Correct 30 ms 15968 KB Output is correct
3 Correct 245 ms 55776 KB Output is correct
4 Correct 1271 ms 66072 KB Output is correct
5 Correct 812 ms 41116 KB Output is correct
6 Correct 1310 ms 65984 KB Output is correct
7 Correct 918 ms 50204 KB Output is correct
8 Correct 1344 ms 66004 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15944 KB Output is correct
2 Correct 33 ms 15944 KB Output is correct
3 Correct 35 ms 15848 KB Output is correct
4 Correct 38 ms 15944 KB Output is correct
5 Correct 38 ms 15944 KB Output is correct
6 Incorrect 36 ms 16064 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15944 KB Output is correct
2 Correct 33 ms 15944 KB Output is correct
3 Correct 35 ms 15848 KB Output is correct
4 Correct 38 ms 15944 KB Output is correct
5 Correct 38 ms 15944 KB Output is correct
6 Incorrect 36 ms 16064 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15948 KB Output is correct
2 Correct 31 ms 15944 KB Output is correct
3 Correct 31 ms 15944 KB Output is correct
4 Correct 34 ms 15892 KB Output is correct
5 Correct 122 ms 55604 KB Output is correct
6 Correct 146 ms 65216 KB Output is correct
7 Correct 87 ms 41152 KB Output is correct
8 Correct 163 ms 65240 KB Output is correct
9 Correct 43 ms 23368 KB Output is correct
10 Correct 148 ms 65216 KB Output is correct
11 Correct 139 ms 66080 KB Output is correct
12 Correct 151 ms 65816 KB Output is correct
13 Correct 139 ms 65788 KB Output is correct
14 Correct 141 ms 65216 KB Output is correct
15 Incorrect 151 ms 65504 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 32 ms 15944 KB Output is correct
2 Correct 34 ms 15944 KB Output is correct
3 Correct 32 ms 15944 KB Output is correct
4 Correct 289 ms 38420 KB Output is correct
5 Correct 1020 ms 65176 KB Output is correct
6 Correct 678 ms 24008 KB Output is correct
7 Correct 1298 ms 65212 KB Output is correct
8 Correct 714 ms 32944 KB Output is correct
9 Correct 1006 ms 65184 KB Output is correct
10 Correct 1347 ms 66076 KB Output is correct
11 Correct 1305 ms 65936 KB Output is correct
12 Correct 1345 ms 65856 KB Output is correct
13 Correct 869 ms 65224 KB Output is correct
14 Correct 1192 ms 65512 KB Output is correct
15 Correct 1133 ms 66048 KB Output is correct
16 Correct 1080 ms 66076 KB Output is correct
17 Correct 36 ms 15944 KB Output is correct
18 Correct 30 ms 15944 KB Output is correct
19 Correct 34 ms 15944 KB Output is correct
20 Correct 36 ms 15944 KB Output is correct
21 Correct 33 ms 15912 KB Output is correct
22 Correct 36 ms 16016 KB Output is correct
23 Correct 34 ms 15920 KB Output is correct
24 Correct 36 ms 15936 KB Output is correct
25 Correct 32 ms 15996 KB Output is correct
26 Correct 36 ms 16072 KB Output is correct
27 Correct 56 ms 16456 KB Output is correct
28 Correct 56 ms 16456 KB Output is correct
29 Correct 41 ms 16408 KB Output is correct
30 Correct 60 ms 16456 KB Output is correct
31 Correct 53 ms 16456 KB Output is correct
32 Correct 30 ms 15944 KB Output is correct
33 Correct 103 ms 44492 KB Output is correct
34 Correct 141 ms 65160 KB Output is correct
35 Correct 144 ms 65940 KB Output is correct
36 Correct 146 ms 65216 KB Output is correct
37 Correct 187 ms 65548 KB Output is correct
38 Correct 140 ms 66112 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15944 KB Output is correct
2 Correct 34 ms 15944 KB Output is correct
3 Correct 32 ms 15944 KB Output is correct
4 Correct 289 ms 38420 KB Output is correct
5 Correct 1020 ms 65176 KB Output is correct
6 Correct 678 ms 24008 KB Output is correct
7 Correct 1298 ms 65212 KB Output is correct
8 Correct 714 ms 32944 KB Output is correct
9 Correct 1006 ms 65184 KB Output is correct
10 Correct 1347 ms 66076 KB Output is correct
11 Correct 1305 ms 65936 KB Output is correct
12 Correct 1345 ms 65856 KB Output is correct
13 Correct 869 ms 65224 KB Output is correct
14 Correct 1192 ms 65512 KB Output is correct
15 Correct 1133 ms 66048 KB Output is correct
16 Correct 1080 ms 66076 KB Output is correct
17 Correct 36 ms 15944 KB Output is correct
18 Correct 30 ms 15944 KB Output is correct
19 Correct 34 ms 15944 KB Output is correct
20 Correct 36 ms 15944 KB Output is correct
21 Correct 33 ms 15912 KB Output is correct
22 Correct 36 ms 16016 KB Output is correct
23 Correct 34 ms 15920 KB Output is correct
24 Correct 36 ms 15936 KB Output is correct
25 Correct 32 ms 15996 KB Output is correct
26 Correct 36 ms 16072 KB Output is correct
27 Correct 56 ms 16456 KB Output is correct
28 Correct 56 ms 16456 KB Output is correct
29 Correct 41 ms 16408 KB Output is correct
30 Correct 60 ms 16456 KB Output is correct
31 Correct 53 ms 16456 KB Output is correct
32 Correct 30 ms 15944 KB Output is correct
33 Correct 103 ms 44492 KB Output is correct
34 Correct 141 ms 65160 KB Output is correct
35 Correct 144 ms 65940 KB Output is correct
36 Correct 146 ms 65216 KB Output is correct
37 Correct 187 ms 65548 KB Output is correct
38 Correct 140 ms 66112 KB Output is correct
39 Correct 30 ms 15948 KB Output is correct
40 Correct 34 ms 15944 KB Output is correct
41 Correct 31 ms 15944 KB Output is correct
42 Correct 222 ms 38548 KB Output is correct
43 Correct 1014 ms 65252 KB Output is correct
44 Correct 710 ms 24068 KB Output is correct
45 Correct 973 ms 65228 KB Output is correct
46 Correct 759 ms 32832 KB Output is correct
47 Correct 1196 ms 65172 KB Output is correct
48 Correct 1208 ms 66076 KB Output is correct
49 Correct 1002 ms 66052 KB Output is correct
50 Correct 1177 ms 65972 KB Output is correct
51 Correct 1204 ms 65180 KB Output is correct
52 Correct 1188 ms 65548 KB Output is correct
53 Correct 957 ms 66076 KB Output is correct
54 Correct 1054 ms 65984 KB Output is correct
55 Correct 30 ms 15944 KB Output is correct
56 Correct 206 ms 65068 KB Output is correct
57 Correct 1192 ms 65176 KB Output is correct
58 Correct 539 ms 24764 KB Output is correct
59 Correct 1060 ms 65176 KB Output is correct
60 Correct 553 ms 33432 KB Output is correct
61 Correct 1233 ms 65228 KB Output is correct
62 Correct 1322 ms 66060 KB Output is correct
63 Correct 1146 ms 65856 KB Output is correct
64 Correct 922 ms 65984 KB Output is correct
65 Correct 913 ms 65256 KB Output is correct
66 Correct 1223 ms 65548 KB Output is correct
67 Correct 1151 ms 65984 KB Output is correct
68 Correct 1072 ms 65960 KB Output is correct
69 Correct 30 ms 15944 KB Output is correct
70 Correct 29 ms 15944 KB Output is correct
71 Correct 35 ms 16016 KB Output is correct
72 Correct 32 ms 16016 KB Output is correct
73 Correct 32 ms 15936 KB Output is correct
74 Correct 36 ms 15976 KB Output is correct
75 Correct 31 ms 15992 KB Output is correct
76 Correct 29 ms 15968 KB Output is correct
77 Correct 29 ms 15908 KB Output is correct
78 Correct 33 ms 15944 KB Output is correct
79 Correct 33 ms 16016 KB Output is correct
80 Correct 32 ms 15944 KB Output is correct
81 Correct 32 ms 15996 KB Output is correct
82 Correct 34 ms 15944 KB Output is correct
83 Correct 36 ms 15944 KB Output is correct
84 Correct 31 ms 15944 KB Output is correct
85 Correct 33 ms 15944 KB Output is correct
86 Correct 47 ms 16464 KB Output is correct
87 Correct 51 ms 16456 KB Output is correct
88 Correct 57 ms 16456 KB Output is correct
89 Correct 59 ms 16456 KB Output is correct
90 Correct 53 ms 16456 KB Output is correct
91 Correct 35 ms 16004 KB Output is correct
92 Correct 35 ms 16072 KB Output is correct
93 Correct 50 ms 16328 KB Output is correct
94 Correct 52 ms 16388 KB Output is correct
95 Correct 57 ms 16456 KB Output is correct
96 Correct 56 ms 16448 KB Output is correct
97 Correct 56 ms 16472 KB Output is correct
98 Correct 35 ms 15952 KB Output is correct
99 Correct 141 ms 65088 KB Output is correct
100 Correct 140 ms 65216 KB Output is correct
101 Correct 144 ms 65836 KB Output is correct
102 Correct 139 ms 65252 KB Output is correct
103 Correct 169 ms 65512 KB Output is correct
104 Correct 142 ms 65976 KB Output is correct
105 Correct 29 ms 15944 KB Output is correct
106 Correct 97 ms 44512 KB Output is correct
107 Correct 155 ms 65216 KB Output is correct
108 Correct 134 ms 65940 KB Output is correct
109 Correct 145 ms 65180 KB Output is correct
110 Correct 169 ms 65592 KB Output is correct
111 Correct 144 ms 66072 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15944 KB Output is correct
2 Correct 30 ms 15968 KB Output is correct
3 Correct 245 ms 55776 KB Output is correct
4 Correct 1271 ms 66072 KB Output is correct
5 Correct 812 ms 41116 KB Output is correct
6 Correct 1310 ms 65984 KB Output is correct
7 Correct 918 ms 50204 KB Output is correct
8 Correct 1344 ms 66004 KB Output is correct
9 Correct 31 ms 15944 KB Output is correct
10 Correct 33 ms 15944 KB Output is correct
11 Correct 35 ms 15848 KB Output is correct
12 Correct 38 ms 15944 KB Output is correct
13 Correct 38 ms 15944 KB Output is correct
14 Incorrect 36 ms 16064 KB Output isn't correct
15 Halted 0 ms 0 KB -