oj.uz

Submission #415875

# Submission time Handle Problem Language Result Execution time Memory
415875 2021-06-01T16:20:15 Z valerikk Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 5812 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 7;
const int INF = 1e9;

int n, h[N];
int l[N], r[N], m[N];

void init(int nn, vector<int> hh) {
    for (int i = 0; i < nn; i++) h[i + 1] = hh[i] - 1;
    h[0] = nn;
    h[nn + 1] = nn + 1;
    n = nn + 2;
    vector<int> st;
    for (int i = 0; i < n; ++i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            r[st.back()] = i;
            st.pop_back();
        }
        st.push_back(i);
    }
    r[n - 1] = n - 1;
    st.clear();
    for (int i = n - 1; i >= 0; --i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            l[st.back()] = i;
            st.pop_back();
        }
        st.push_back(i);
    }
    l[0] = 0;
    st.clear();
    for (int i = 0; i < n; ++i) m[i] = h[l[i]] > h[r[i]] ? l[i] : r[i];
}

int minimum_jumps(int aa, int bb, int cc, int dd) {
    int a = aa + 1, b = bb + 1, c = cc + 1, d = dd + 1;
    int mx = 0;
    for (int i = c; i <= d; ++i) mx = max(mx, h[i]);
    int mx1  = -INF;
    for (int i = b + 1; i < c; ++i) mx1 = max(mx1, h[i]);
    if (mx1 > mx || h[b] > mx) return -1;
    for (int i = a; i <= b; ++i) {
        if (h[i] > mx) a = max(a, i + 1);
    }
    int st = b;
    for (int i = a; i <= b; ++i) {
        if (h[i] < mx && h[i] > h[st]) st = i;
    }
    int res = 1;
    while (h[st] < mx1) {
        ++res;
        //cout << st - 1 << " " << h[st] + 1 << endl;
        if (h[m[st]] < mx) st = m[st]; else st = r[st];
    }
    //cout << st - 1 << " " << h[st] + 1 << endl;
    return res;
}

int get_ans(int a, int b, int c, int d) {
    ++a, ++b, ++c, ++d;
    vector<int> dist(n, INF);
    queue<int> q;
    for (int i = a; i <= b; ++i) {
        dist[i] = 0;
        q.push(i);
    }
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        if (v >= c && v <= d) return dist[v];
        for (auto u : {l[v], r[v]}) {
            if (dist[v] +1 < dist[u]) {
                dist[u] = dist[v] + 1;
                q.push(u);
            }
        }
    }
    return -1;
}

#ifdef LOCAL

int main() {
    freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (0) {
        int nn, qq;
        cin >> nn >> qq;
        vector<int> hh(nn);
        for (auto &x : hh) cin >> x;
        init(nn, hh);
        while (qq--) {
            int aa, bb, cc, dd;
            cin >> aa >> bb >> cc >> dd;
            cout << minimum_jumps(aa, bb, cc, dd) << endl;
        }
    } else {
        srand(0);
        int nn = 15;
        vector<int> hh(nn);
        for (int i = 0; i < nn; ++i) hh[i] = i + 1;
        random_shuffle(hh.begin(), hh.end());
        init(nn, hh);
        int qq = 1000000;
        while (qq--) {
            vector<int> v;
            for (int i = 0; i < 4; ++i) v.push_back(rand() % nn);
            sort(v.begin(), v.end());
            if (v[1] == v[2]) continue;
            int a = v[0], b = v[1], c = v[2], d = v[3];
            int ans = get_ans(a, b, c, d);
            int ans1 = minimum_jumps(a, b, c, d);
            if (ans != ans1) {
                cout << nn << endl;
                for (auto i : hh) cout << i << " ";
                cout << endl << a << " " << b << " " << c << " " << d << endl;
                cout << ans << " " << ans1 << endl;
                return 0;
            }
        }
    }
    return 0;
}

#endif

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 3297 ms 4740 KB Output is correct
4 Execution timed out 4097 ms 5812 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 2 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 200 KB Output is correct
7 Correct 4 ms 200 KB Output is correct
8 Correct 6 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 5 ms 200 KB Output is correct
11 Correct 5 ms 200 KB Output is correct
12 Correct 4 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 6 ms 200 KB Output is correct
15 Correct 6 ms 200 KB Output is correct
16 Correct 3 ms 292 KB Output is correct
17 Correct 3 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 5 ms 200 KB Output is correct
21 Correct 2 ms 200 KB Output is correct
22 Correct 4 ms 200 KB Output is correct
23 Correct 4 ms 200 KB Output is correct
24 Correct 3 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 4 ms 200 KB Output is correct
31 Correct 4 ms 200 KB Output is correct
32 Correct 5 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 200 KB Output is correct
37 Correct 1 ms 200 KB Output is correct
38 Correct 1 ms 200 KB Output is correct
39 Correct 1 ms 200 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 2 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 200 KB Output is correct
7 Correct 4 ms 200 KB Output is correct
8 Correct 6 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 5 ms 200 KB Output is correct
11 Correct 5 ms 200 KB Output is correct
12 Correct 4 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 6 ms 200 KB Output is correct
15 Correct 6 ms 200 KB Output is correct
16 Correct 3 ms 292 KB Output is correct
17 Correct 3 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 5 ms 200 KB Output is correct
21 Correct 2 ms 200 KB Output is correct
22 Correct 4 ms 200 KB Output is correct
23 Correct 4 ms 200 KB Output is correct
24 Correct 3 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 4 ms 200 KB Output is correct
31 Correct 4 ms 200 KB Output is correct
32 Correct 5 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 200 KB Output is correct
37 Correct 1 ms 200 KB Output is correct
38 Correct 1 ms 200 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 2 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 1 ms 200 KB Output is correct
43 Correct 2 ms 200 KB Output is correct
44 Correct 3 ms 200 KB Output is correct
45 Correct 4 ms 200 KB Output is correct
46 Correct 3 ms 288 KB Output is correct
47 Correct 4 ms 200 KB Output is correct
48 Correct 2 ms 200 KB Output is correct
49 Correct 4 ms 200 KB Output is correct
50 Correct 3 ms 200 KB Output is correct
51 Correct 4 ms 200 KB Output is correct
52 Correct 5 ms 200 KB Output is correct
53 Correct 3 ms 200 KB Output is correct
54 Correct 4 ms 200 KB Output is correct
55 Correct 4 ms 200 KB Output is correct
56 Correct 4 ms 200 KB Output is correct
57 Correct 1 ms 200 KB Output is correct
58 Correct 24 ms 328 KB Output is correct
59 Correct 25 ms 328 KB Output is correct
60 Correct 6 ms 328 KB Output is correct
61 Correct 24 ms 328 KB Output is correct
62 Correct 18 ms 200 KB Output is correct
63 Correct 27 ms 328 KB Output is correct
64 Correct 36 ms 328 KB Output is correct
65 Correct 25 ms 328 KB Output is correct
66 Correct 25 ms 328 KB Output is correct
67 Correct 32 ms 328 KB Output is correct
68 Correct 33 ms 328 KB Output is correct
69 Correct 36 ms 328 KB Output is correct
70 Correct 36 ms 328 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 2 ms 200 KB Output is correct
73 Correct 4 ms 200 KB Output is correct
74 Correct 5 ms 200 KB Output is correct
75 Correct 3 ms 200 KB Output is correct
76 Correct 3 ms 200 KB Output is correct
77 Correct 4 ms 200 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 3 ms 200 KB Output is correct
81 Correct 4 ms 200 KB Output is correct
82 Correct 4 ms 200 KB Output is correct
83 Correct 4 ms 200 KB Output is correct
84 Correct 5 ms 200 KB Output is correct
85 Correct 3 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 288 KB Output is correct
89 Correct 2 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 2 ms 200 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 8 ms 200 KB Output is correct
95 Correct 30 ms 328 KB Output is correct
96 Correct 40 ms 328 KB Output is correct
97 Correct 33 ms 328 KB Output is correct
98 Correct 39 ms 328 KB Output is correct
99 Correct 22 ms 328 KB Output is correct
100 Correct 1 ms 200 KB Output is correct
101 Correct 2 ms 328 KB Output is correct
102 Correct 33 ms 328 KB Output is correct
103 Correct 26 ms 328 KB Output is correct
104 Correct 31 ms 328 KB Output is correct
105 Correct 32 ms 328 KB Output is correct
106 Correct 19 ms 328 KB Output is correct
107 Correct 1 ms 296 KB Output is correct
108 Correct 1 ms 328 KB Output is correct
109 Correct 1 ms 328 KB Output is correct
110 Correct 1 ms 328 KB Output is correct
111 Correct 2 ms 328 KB Output is correct
112 Correct 1 ms 328 KB Output is correct
113 Correct 2 ms 328 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 30 ms 4116 KB Output is correct
6 Correct 44 ms 4908 KB Output is correct
7 Correct 17 ms 2624 KB Output is correct
8 Correct 37 ms 4888 KB Output is correct
9 Correct 8 ms 1008 KB Output is correct
10 Correct 37 ms 4892 KB Output is correct
11 Correct 31 ms 5776 KB Output is correct
12 Correct 32 ms 5644 KB Output is correct
13 Correct 29 ms 5556 KB Output is correct
14 Correct 34 ms 4928 KB Output is correct
15 Correct 29 ms 5432 KB Output is correct
16 Correct 31 ms 5812 KB Output is correct
17 Correct 32 ms 5764 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 3 ms 328 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 2 ms 328 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 39 ms 5012 KB Output is correct
34 Correct 51 ms 4904 KB Output is correct
35 Correct 31 ms 5664 KB Output is correct
36 Correct 38 ms 4916 KB Output is correct
37 Correct 29 ms 5412 KB Output is correct
38 Correct 30 ms 5812 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 21 ms 2964 KB Output is correct
41 Correct 37 ms 4896 KB Output is correct
42 Correct 30 ms 5648 KB Output is correct
43 Correct 35 ms 4892 KB Output is correct
44 Correct 31 ms 5512 KB Output is correct
45 Correct 30 ms 5772 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 902 ms 2368 KB Output is correct
5 Execution timed out 4062 ms 4928 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 902 ms 2368 KB Output is correct
5 Execution timed out 4062 ms 4928 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 3297 ms 4740 KB Output is correct
4 Execution timed out 4097 ms 5812 KB Time limit exceeded
5 Halted 0 ms 0 KB -