oj.uz

Submission #489572

# Submission time Handle Problem Language Result Execution time Memory
489572 2021-11-23T09:34:33 Z dung11112003 Rainforest Jumps (APIO21_jumps) C++11
48 / 100
 1701 ms 75564 KB 
#include "jumps.h"

#include <bits/stdc++.h>

using namespace std;

int n;
vector <int> a, L, R, nxt;
vector <vector <int>> jumpL, jumpR, jumpbest;

void init(int N, vector<int> H)
{
    n = N;
    a = H;
    for (auto &x: a)
    {
        x--;
    }
    L.assign(n, 0);
    R.assign(n, 0);
    stack <int> st;
    for (int i = 0; i < n; i++)
    {
        while (!st.empty() && a[st.top()] < a[i])
        {
            st.pop();
        }
        L[i] = (st.empty() ? -1 : st.top());
        st.push(i);
    }
    st = stack <int>();
    for (int i = n - 1; i >= 0; i--)
    {
        while (!st.empty() && a[st.top()] < a[i])
        {
            st.pop();
        }
        R[i] = (st.empty() ? n : st.top());
        st.push(i);
    }
    jumpL.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        jumpL[i][0] = L[i];
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpL[i][j] = (jumpL[i][j - 1] == -1 ? -1 : jumpL[jumpL[i][j - 1]][j - 1]);
        }
    }
    jumpR.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        jumpR[i][0] = R[i];
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpR[i][j] = (jumpR[i][j - 1] == n ? n : jumpR[jumpR[i][j - 1]][j - 1]);
        }
    }
    jumpbest.assign(n, vector <int> (20));
    for (int i = 0; i < n; i++)
    {
        if (L[i] == -1)
        {
            jumpbest[i][0] = (R[i] == n ? -1 : R[i]);
        }
        else if (R[i] == n)
        {
            jumpbest[i][0] = L[i];
        }
        else
        {
            jumpbest[i][0] = (a[L[i]] < a[R[i]] ? R[i] : L[i]);
        }
    }
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i < n; i++)
        {
            jumpbest[i][j] = (jumpbest[i][j - 1] == -1 ? -1 : jumpbest[jumpbest[i][j - 1]][j - 1]);
        }
    }
}

int minimum_jumps(int A, int B, int C, int D)
{
    int cur = B;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[cur][i] < C)
        {
            cur = jumpR[cur][i];
        }
    }
    if (R[cur] > D)
    {
        return -1;
    }
    int target = R[cur];
    cur = B;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpL[cur][i] >= A && a[jumpL[cur][i]] < a[target])
        {
            cur = jumpL[cur][i];
        }
    }
    int last_target = target;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[last_target][i] <= D)
        {
            last_target = jumpR[last_target][i];
        }
    }
    if (L[cur] >= A && a[L[cur]] < a[last_target])
    {
        return 1;
    }
    int ans = 0;
    for (int i = 19; i >= 0; i--)
    {
        if (jumpbest[cur][i] != -1 && a[jumpbest[cur][i]] <= a[target])
        {
            cur = jumpbest[cur][i];
            ans += 1 << i;
        }
    }
    if (cur == target)
    {
        return ans;
    }
    int s = 0, lim = 1e9;
    if (target < last_target)
    {
        lim = 2;
    }
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[cur][i] <= target)
        {
            cur = jumpR[cur][i];
            s += 1 << i;
        }
    }
    s = min(s, lim);
    ans += s;
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 302 ms 60132 KB Output is correct
4 Correct 1352 ms 75412 KB Output is correct
5 Correct 1405 ms 38136 KB Output is correct
6 Correct 1701 ms 75424 KB Output is correct
7 Correct 1142 ms 51648 KB Output is correct
8 Correct 1562 ms 75548 KB Output is correct

Subtask #2
0 / 8.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 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Incorrect 2 ms 328 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Incorrect 2 ms 328 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 162 ms 60116 KB Output is correct
6 Correct 195 ms 74636 KB Output is correct
7 Correct 96 ms 38268 KB Output is correct
8 Correct 205 ms 74648 KB Output is correct
9 Correct 19 ms 11460 KB Output is correct
10 Correct 216 ms 74628 KB Output is correct
11 Correct 222 ms 75564 KB Output is correct
12 Incorrect 187 ms 74956 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 322 ms 34208 KB Output is correct
5 Correct 725 ms 74644 KB Output is correct
6 Correct 595 ms 12488 KB Output is correct
7 Correct 1115 ms 74560 KB Output is correct
8 Correct 560 ms 25828 KB Output is correct
9 Correct 1038 ms 74604 KB Output is correct
10 Correct 1289 ms 75484 KB Output is correct
11 Correct 1293 ms 74824 KB Output is correct
12 Correct 1313 ms 75432 KB Output is correct
13 Correct 1136 ms 74644 KB Output is correct
14 Correct 1235 ms 74560 KB Output is correct
15 Correct 1032 ms 74560 KB Output is correct
16 Correct 1062 ms 74772 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 21 ms 968 KB Output is correct
28 Correct 22 ms 968 KB Output is correct
29 Correct 9 ms 968 KB Output is correct
30 Correct 22 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 114 ms 43280 KB Output is correct
34 Correct 189 ms 74536 KB Output is correct
35 Correct 191 ms 75456 KB Output is correct
36 Correct 191 ms 74640 KB Output is correct
37 Correct 231 ms 74668 KB Output is correct
38 Correct 193 ms 74628 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 322 ms 34208 KB Output is correct
5 Correct 725 ms 74644 KB Output is correct
6 Correct 595 ms 12488 KB Output is correct
7 Correct 1115 ms 74560 KB Output is correct
8 Correct 560 ms 25828 KB Output is correct
9 Correct 1038 ms 74604 KB Output is correct
10 Correct 1289 ms 75484 KB Output is correct
11 Correct 1293 ms 74824 KB Output is correct
12 Correct 1313 ms 75432 KB Output is correct
13 Correct 1136 ms 74644 KB Output is correct
14 Correct 1235 ms 74560 KB Output is correct
15 Correct 1032 ms 74560 KB Output is correct
16 Correct 1062 ms 74772 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 21 ms 968 KB Output is correct
28 Correct 22 ms 968 KB Output is correct
29 Correct 9 ms 968 KB Output is correct
30 Correct 22 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 114 ms 43280 KB Output is correct
34 Correct 189 ms 74536 KB Output is correct
35 Correct 191 ms 75456 KB Output is correct
36 Correct 191 ms 74640 KB Output is correct
37 Correct 231 ms 74668 KB Output is correct
38 Correct 193 ms 74628 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 285 ms 34284 KB Output is correct
43 Correct 1174 ms 74560 KB Output is correct
44 Correct 628 ms 12488 KB Output is correct
45 Correct 832 ms 74684 KB Output is correct
46 Correct 624 ms 25840 KB Output is correct
47 Correct 1070 ms 74600 KB Output is correct
48 Correct 1257 ms 75476 KB Output is correct
49 Correct 1229 ms 74772 KB Output is correct
50 Correct 1367 ms 75384 KB Output is correct
51 Correct 1010 ms 74560 KB Output is correct
52 Correct 1265 ms 74676 KB Output is correct
53 Correct 1101 ms 74672 KB Output is correct
54 Correct 1000 ms 74560 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Correct 237 ms 74260 KB Output is correct
57 Correct 1158 ms 74644 KB Output is correct
58 Correct 414 ms 13340 KB Output is correct
59 Correct 1014 ms 74560 KB Output is correct
60 Correct 421 ms 26688 KB Output is correct
61 Correct 903 ms 74640 KB Output is correct
62 Correct 1404 ms 75484 KB Output is correct
63 Correct 1366 ms 74992 KB Output is correct
64 Correct 1154 ms 74944 KB Output is correct
65 Correct 1083 ms 74560 KB Output is correct
66 Correct 1235 ms 74620 KB Output is correct
67 Correct 1108 ms 74560 KB Output is correct
68 Correct 1037 ms 74740 KB Output is correct
69 Correct 0 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 3 ms 328 KB Output is correct
72 Correct 4 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 2 ms 328 KB Output is correct
86 Correct 23 ms 968 KB Output is correct
87 Correct 15 ms 968 KB Output is correct
88 Correct 21 ms 968 KB Output is correct
89 Correct 22 ms 968 KB Output is correct
90 Correct 16 ms 968 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 1 ms 456 KB Output is correct
93 Correct 21 ms 968 KB Output is correct
94 Correct 23 ms 968 KB Output is correct
95 Correct 22 ms 968 KB Output is correct
96 Correct 21 ms 968 KB Output is correct
97 Correct 16 ms 968 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 196 ms 74504 KB Output is correct
100 Correct 196 ms 74648 KB Output is correct
101 Correct 200 ms 75332 KB Output is correct
102 Correct 192 ms 74600 KB Output is correct
103 Correct 193 ms 74556 KB Output is correct
104 Correct 191 ms 74664 KB Output is correct
105 Correct 0 ms 200 KB Output is correct
106 Correct 112 ms 43296 KB Output is correct
107 Correct 205 ms 74608 KB Output is correct
108 Correct 190 ms 75236 KB Output is correct
109 Correct 197 ms 74680 KB Output is correct
110 Correct 195 ms 74560 KB Output is correct
111 Correct 204 ms 74664 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 302 ms 60132 KB Output is correct
4 Correct 1352 ms 75412 KB Output is correct
5 Correct 1405 ms 38136 KB Output is correct
6 Correct 1701 ms 75424 KB Output is correct
7 Correct 1142 ms 51648 KB Output is correct
8 Correct 1562 ms 75548 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Incorrect 2 ms 328 KB Output isn't correct
15 Halted 0 ms 0 KB -