oj.uz

Submission #489565

# Submission time Handle Problem Language Result Execution time Memory
489565 2021-11-23T09:00:04 Z dung11112003 Rainforest Jumps (APIO21_jumps) C++11
48 / 100
 1642 ms 75484 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;
        }
    }
    for (int i = 19; i >= 0; i--)
    {
        if (jumpR[cur][i] <= target)
        {
            cur = jumpR[cur][i];
            ans += 1 << i;
        }
    }
    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 313 ms 60024 KB Output is correct
4 Correct 1494 ms 75360 KB Output is correct
5 Correct 1274 ms 38208 KB Output is correct
6 Correct 1404 ms 75480 KB Output is correct
7 Correct 1117 ms 51608 KB Output is correct
8 Correct 1642 ms 75484 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 0 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 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Incorrect 2 ms 328 KB Output isn't correct
14 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 0 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 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Incorrect 2 ms 328 KB Output isn't correct
14 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 0 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 174 ms 60096 KB Output is correct
6 Correct 207 ms 74632 KB Output is correct
7 Correct 93 ms 38236 KB Output is correct
8 Correct 201 ms 74664 KB Output is correct
9 Correct 21 ms 11464 KB Output is correct
10 Correct 203 ms 74600 KB Output is correct
11 Correct 225 ms 75476 KB Output is correct
12 Correct 205 ms 74916 KB Output is correct
13 Incorrect 190 ms 75132 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 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 267 ms 34192 KB Output is correct
5 Correct 799 ms 74600 KB Output is correct
6 Correct 686 ms 12488 KB Output is correct
7 Correct 946 ms 74560 KB Output is correct
8 Correct 700 ms 25896 KB Output is correct
9 Correct 821 ms 74660 KB Output is correct
10 Correct 1571 ms 75372 KB Output is correct
11 Correct 1431 ms 74692 KB Output is correct
12 Correct 1493 ms 75440 KB Output is correct
13 Correct 1037 ms 74672 KB Output is correct
14 Correct 1439 ms 74608 KB Output is correct
15 Correct 810 ms 74680 KB Output is correct
16 Correct 1187 ms 74624 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 328 KB Output is correct
20 Correct 2 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 22 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 26 ms 968 KB Output is correct
30 Correct 22 ms 968 KB Output is correct
31 Correct 20 ms 968 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 114 ms 43344 KB Output is correct
34 Correct 218 ms 74660 KB Output is correct
35 Correct 198 ms 75356 KB Output is correct
36 Correct 199 ms 74644 KB Output is correct
37 Correct 213 ms 74608 KB Output is correct
38 Correct 185 ms 74600 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 267 ms 34192 KB Output is correct
5 Correct 799 ms 74600 KB Output is correct
6 Correct 686 ms 12488 KB Output is correct
7 Correct 946 ms 74560 KB Output is correct
8 Correct 700 ms 25896 KB Output is correct
9 Correct 821 ms 74660 KB Output is correct
10 Correct 1571 ms 75372 KB Output is correct
11 Correct 1431 ms 74692 KB Output is correct
12 Correct 1493 ms 75440 KB Output is correct
13 Correct 1037 ms 74672 KB Output is correct
14 Correct 1439 ms 74608 KB Output is correct
15 Correct 810 ms 74680 KB Output is correct
16 Correct 1187 ms 74624 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 328 KB Output is correct
20 Correct 2 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 22 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 26 ms 968 KB Output is correct
30 Correct 22 ms 968 KB Output is correct
31 Correct 20 ms 968 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 114 ms 43344 KB Output is correct
34 Correct 218 ms 74660 KB Output is correct
35 Correct 198 ms 75356 KB Output is correct
36 Correct 199 ms 74644 KB Output is correct
37 Correct 213 ms 74608 KB Output is correct
38 Correct 185 ms 74600 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 279 ms 34180 KB Output is correct
43 Correct 1161 ms 74532 KB Output is correct
44 Correct 543 ms 12488 KB Output is correct
45 Correct 1175 ms 74604 KB Output is correct
46 Correct 370 ms 25824 KB Output is correct
47 Correct 717 ms 74664 KB Output is correct
48 Correct 1578 ms 75444 KB Output is correct
49 Correct 1274 ms 74928 KB Output is correct
50 Correct 1454 ms 75284 KB Output is correct
51 Correct 1230 ms 74560 KB Output is correct
52 Correct 1426 ms 74616 KB Output is correct
53 Correct 1024 ms 74532 KB Output is correct
54 Correct 1135 ms 74644 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 243 ms 74296 KB Output is correct
57 Correct 1244 ms 74704 KB Output is correct
58 Correct 543 ms 13264 KB Output is correct
59 Correct 1004 ms 74664 KB Output is correct
60 Correct 492 ms 26740 KB Output is correct
61 Correct 1142 ms 74640 KB Output is correct
62 Correct 1343 ms 75432 KB Output is correct
63 Correct 1149 ms 74896 KB Output is correct
64 Correct 1253 ms 75072 KB Output is correct
65 Correct 958 ms 74784 KB Output is correct
66 Correct 1333 ms 74660 KB Output is correct
67 Correct 1047 ms 74672 KB Output is correct
68 Correct 983 ms 74792 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 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 1 ms 328 KB Output is correct
75 Correct 2 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 2 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 5 ms 328 KB Output is correct
86 Correct 10 ms 968 KB Output is correct
87 Correct 22 ms 968 KB Output is correct
88 Correct 17 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 23 ms 968 KB Output is correct
94 Correct 16 ms 968 KB Output is correct
95 Correct 11 ms 968 KB Output is correct
96 Correct 22 ms 968 KB Output is correct
97 Correct 18 ms 968 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 195 ms 74520 KB Output is correct
100 Correct 191 ms 74596 KB Output is correct
101 Correct 200 ms 75292 KB Output is correct
102 Correct 203 ms 74664 KB Output is correct
103 Correct 214 ms 74660 KB Output is correct
104 Correct 189 ms 74720 KB Output is correct
105 Correct 0 ms 200 KB Output is correct
106 Correct 118 ms 43448 KB Output is correct
107 Correct 194 ms 74644 KB Output is correct
108 Correct 187 ms 75280 KB Output is correct
109 Correct 188 ms 74560 KB Output is correct
110 Correct 205 ms 74836 KB Output is correct
111 Correct 188 ms 74552 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 313 ms 60024 KB Output is correct
4 Correct 1494 ms 75360 KB Output is correct
5 Correct 1274 ms 38208 KB Output is correct
6 Correct 1404 ms 75480 KB Output is correct
7 Correct 1117 ms 51608 KB Output is correct
8 Correct 1642 ms 75484 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 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 Correct 2 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Incorrect 2 ms 328 KB Output isn't correct
22 Halted 0 ms 0 KB -