oj.uz

Submission #973521

# Submission time Handle Problem Language Result Execution time Memory
973521 2024-05-02T06:33:04 Z Tuanlinh123 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 919 ms 64532 KB 
// #include "stub.cpp"
#include "jumps.h"
#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll maxn=200005, inf=1e9;
ll n, sp[20][maxn];
ll L[20][maxn], R[20][maxn], Max[20][maxn];

void init(ll N, vector<ll> H) 
{
    n=N, H.insert(H.begin(), inf), H.insert(H.end(), inf);
    for (ll i=0; i<=n+1; i++) sp[0][i]=H[i];
    for (ll i=1; i<20; i++)
        for (ll j=0; j+(1<<i)<=n+2; j++)
            sp[i][j]=max(sp[i-1][j], sp[i-1][j+(1<<i-1)]);
    stack <ll> st; st.push(0), L[0][0]=0;
    for (ll i=1; i<=n+1; i++)
    {
        while (H[st.top()]<H[i]) st.pop();
        L[0][i]=st.top(), st.push(i);
    }
    while (sz(st)) st.pop(); st.push(n+1), R[0][n+1]=n+1;
    for (ll i=n; i>=0; i--)
    {
        while (H[st.top()]<H[i]) st.pop();
        R[0][i]=st.top(), st.push(i);
    }
    for (ll i=0; i<=n+1; i++)
        Max[0][i]=H[L[0][i]]>H[R[0][i]]?L[0][i]:R[0][i];
    for (ll i=1; i<20; i++)
        for (ll j=0; j<=n+1; j++)
        {
            L[i][j]=L[i-1][L[i-1][j]];
            R[i][j]=R[i-1][R[i-1][j]];
            Max[i][j]=Max[i-1][Max[i-1][j]];
        }
}

ll query(ll l, ll r)
{
    ll j=__lg(r-l+1);
    return max(sp[j][l], sp[j][r-(1<<j)+1]);
}
bool check(ll i, ll l, ll r) {return query(i, r)==query(l, r);}

int minimum_jumps(int A, int B, int C, int D) 
{
    A++, B++, C++, D++;
    for (ll i=19; i>=0; i--)
        if (check(L[i][B], C, D) && L[i][B]>=A)
            B=L[i][B];
    // cout << "after left jumps: " << B << endl;
    ll ans=0;
    for (ll i=19; i>=0; i--)
        if (Max[i][B]<C && check(Max[i][B], C, D))
            ans+=1<<i, B=Max[i][B];
    // cout << "after max jumps: " << B << endl;
    for (ll i=19; i>=0; i--)
        if (R[i][B]<C)
            ans+=1<<i, B=R[i][B];
    // cout << "after right jumps: " << B << endl;
    if (R[0][B]<C || R[0][B]>D) return -1;
    return ans+1;
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:24:53: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   24 |             sp[i][j]=max(sp[i-1][j], sp[i-1][j+(1<<i-1)]);
      |                                                    ~^~
jumps.cpp:31:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   31 |     while (sz(st)) st.pop(); st.push(n+1), R[0][n+1]=n+1;
      |     ^~~~~
jumps.cpp:31:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   31 |     while (sz(st)) st.pop(); st.push(n+1), R[0][n+1]=n+1;
      |                              ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 49496 KB Output is correct
2 Correct 6 ms 49496 KB Output is correct
3 Correct 106 ms 63924 KB Output is correct
4 Correct 778 ms 64488 KB Output is correct
5 Correct 715 ms 61120 KB Output is correct
6 Correct 792 ms 64424 KB Output is correct
7 Correct 579 ms 63788 KB Output is correct
8 Correct 862 ms 64528 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 49496 KB Output is correct
2 Correct 5 ms 49496 KB Output is correct
3 Correct 6 ms 49496 KB Output is correct
4 Correct 8 ms 49496 KB Output is correct
5 Correct 7 ms 51544 KB Output is correct
6 Incorrect 7 ms 53712 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 49496 KB Output is correct
2 Correct 5 ms 49496 KB Output is correct
3 Correct 6 ms 49496 KB Output is correct
4 Correct 8 ms 49496 KB Output is correct
5 Correct 7 ms 51544 KB Output is correct
6 Incorrect 7 ms 53712 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 49496 KB Output is correct
2 Correct 6 ms 49496 KB Output is correct
3 Correct 6 ms 49496 KB Output is correct
4 Correct 7 ms 49496 KB Output is correct
5 Correct 30 ms 63424 KB Output is correct
6 Correct 35 ms 63664 KB Output is correct
7 Correct 21 ms 60860 KB Output is correct
8 Correct 35 ms 63672 KB Output is correct
9 Correct 11 ms 60200 KB Output is correct
10 Correct 36 ms 63680 KB Output is correct
11 Correct 35 ms 64424 KB Output is correct
12 Correct 33 ms 64196 KB Output is correct
13 Correct 34 ms 64192 KB Output is correct
14 Correct 38 ms 63680 KB Output is correct
15 Incorrect 32 ms 63940 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 6 ms 49496 KB Output is correct
2 Correct 6 ms 49596 KB Output is correct
3 Correct 6 ms 49660 KB Output is correct
4 Correct 186 ms 60588 KB Output is correct
5 Correct 788 ms 63676 KB Output is correct
6 Correct 469 ms 60116 KB Output is correct
7 Correct 740 ms 63544 KB Output is correct
8 Correct 464 ms 60616 KB Output is correct
9 Correct 782 ms 63692 KB Output is correct
10 Correct 824 ms 64440 KB Output is correct
11 Correct 828 ms 64456 KB Output is correct
12 Correct 882 ms 64444 KB Output is correct
13 Correct 807 ms 63684 KB Output is correct
14 Correct 919 ms 63932 KB Output is correct
15 Correct 756 ms 64428 KB Output is correct
16 Correct 774 ms 64452 KB Output is correct
17 Correct 5 ms 49496 KB Output is correct
18 Correct 6 ms 49492 KB Output is correct
19 Correct 6 ms 49496 KB Output is correct
20 Correct 7 ms 53592 KB Output is correct
21 Correct 8 ms 53592 KB Output is correct
22 Correct 7 ms 53592 KB Output is correct
23 Correct 7 ms 53592 KB Output is correct
24 Correct 7 ms 53760 KB Output is correct
25 Correct 6 ms 53592 KB Output is correct
26 Correct 7 ms 55640 KB Output is correct
27 Correct 16 ms 55868 KB Output is correct
28 Correct 15 ms 55640 KB Output is correct
29 Correct 15 ms 55640 KB Output is correct
30 Correct 16 ms 55640 KB Output is correct
31 Correct 15 ms 55640 KB Output is correct
32 Correct 6 ms 49496 KB Output is correct
33 Correct 23 ms 62836 KB Output is correct
34 Correct 39 ms 63844 KB Output is correct
35 Correct 34 ms 64404 KB Output is correct
36 Correct 36 ms 63676 KB Output is correct
37 Correct 36 ms 63932 KB Output is correct
38 Correct 39 ms 64444 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 49496 KB Output is correct
2 Correct 6 ms 49596 KB Output is correct
3 Correct 6 ms 49660 KB Output is correct
4 Correct 186 ms 60588 KB Output is correct
5 Correct 788 ms 63676 KB Output is correct
6 Correct 469 ms 60116 KB Output is correct
7 Correct 740 ms 63544 KB Output is correct
8 Correct 464 ms 60616 KB Output is correct
9 Correct 782 ms 63692 KB Output is correct
10 Correct 824 ms 64440 KB Output is correct
11 Correct 828 ms 64456 KB Output is correct
12 Correct 882 ms 64444 KB Output is correct
13 Correct 807 ms 63684 KB Output is correct
14 Correct 919 ms 63932 KB Output is correct
15 Correct 756 ms 64428 KB Output is correct
16 Correct 774 ms 64452 KB Output is correct
17 Correct 5 ms 49496 KB Output is correct
18 Correct 6 ms 49492 KB Output is correct
19 Correct 6 ms 49496 KB Output is correct
20 Correct 7 ms 53592 KB Output is correct
21 Correct 8 ms 53592 KB Output is correct
22 Correct 7 ms 53592 KB Output is correct
23 Correct 7 ms 53592 KB Output is correct
24 Correct 7 ms 53760 KB Output is correct
25 Correct 6 ms 53592 KB Output is correct
26 Correct 7 ms 55640 KB Output is correct
27 Correct 16 ms 55868 KB Output is correct
28 Correct 15 ms 55640 KB Output is correct
29 Correct 15 ms 55640 KB Output is correct
30 Correct 16 ms 55640 KB Output is correct
31 Correct 15 ms 55640 KB Output is correct
32 Correct 6 ms 49496 KB Output is correct
33 Correct 23 ms 62836 KB Output is correct
34 Correct 39 ms 63844 KB Output is correct
35 Correct 34 ms 64404 KB Output is correct
36 Correct 36 ms 63676 KB Output is correct
37 Correct 36 ms 63932 KB Output is correct
38 Correct 39 ms 64444 KB Output is correct
39 Correct 5 ms 49496 KB Output is correct
40 Correct 6 ms 49492 KB Output is correct
41 Correct 6 ms 49496 KB Output is correct
42 Correct 202 ms 60604 KB Output is correct
43 Correct 735 ms 63480 KB Output is correct
44 Correct 441 ms 60348 KB Output is correct
45 Correct 807 ms 63684 KB Output is correct
46 Correct 466 ms 60608 KB Output is correct
47 Correct 784 ms 63916 KB Output is correct
48 Correct 807 ms 64444 KB Output is correct
49 Correct 806 ms 64432 KB Output is correct
50 Correct 801 ms 64428 KB Output is correct
51 Correct 731 ms 63684 KB Output is correct
52 Correct 893 ms 63936 KB Output is correct
53 Correct 746 ms 64444 KB Output is correct
54 Correct 720 ms 64444 KB Output is correct
55 Correct 6 ms 49496 KB Output is correct
56 Correct 69 ms 63708 KB Output is correct
57 Correct 822 ms 63680 KB Output is correct
58 Correct 357 ms 60364 KB Output is correct
59 Correct 796 ms 63656 KB Output is correct
60 Correct 298 ms 60612 KB Output is correct
61 Correct 775 ms 63676 KB Output is correct
62 Correct 836 ms 64532 KB Output is correct
63 Correct 823 ms 64192 KB Output is correct
64 Correct 815 ms 64216 KB Output is correct
65 Correct 733 ms 63680 KB Output is correct
66 Correct 866 ms 64444 KB Output is correct
67 Correct 753 ms 64444 KB Output is correct
68 Correct 749 ms 64452 KB Output is correct
69 Correct 6 ms 49496 KB Output is correct
70 Correct 6 ms 51544 KB Output is correct
71 Correct 7 ms 53784 KB Output is correct
72 Correct 7 ms 53744 KB Output is correct
73 Correct 7 ms 53592 KB Output is correct
74 Correct 7 ms 53592 KB Output is correct
75 Correct 7 ms 53592 KB Output is correct
76 Correct 6 ms 49496 KB Output is correct
77 Correct 5 ms 49644 KB Output is correct
78 Correct 6 ms 49496 KB Output is correct
79 Correct 7 ms 53592 KB Output is correct
80 Correct 7 ms 53592 KB Output is correct
81 Correct 7 ms 53592 KB Output is correct
82 Correct 7 ms 53592 KB Output is correct
83 Correct 7 ms 53592 KB Output is correct
84 Correct 6 ms 53592 KB Output is correct
85 Correct 7 ms 53740 KB Output is correct
86 Correct 16 ms 55788 KB Output is correct
87 Correct 15 ms 55640 KB Output is correct
88 Correct 16 ms 55636 KB Output is correct
89 Correct 17 ms 55892 KB Output is correct
90 Correct 17 ms 55640 KB Output is correct
91 Correct 6 ms 53592 KB Output is correct
92 Correct 7 ms 55800 KB Output is correct
93 Correct 15 ms 55640 KB Output is correct
94 Correct 16 ms 55640 KB Output is correct
95 Correct 20 ms 56100 KB Output is correct
96 Correct 17 ms 55640 KB Output is correct
97 Correct 16 ms 55640 KB Output is correct
98 Correct 5 ms 49496 KB Output is correct
99 Correct 35 ms 63664 KB Output is correct
100 Correct 35 ms 63560 KB Output is correct
101 Correct 33 ms 64172 KB Output is correct
102 Correct 35 ms 63660 KB Output is correct
103 Correct 33 ms 63924 KB Output is correct
104 Correct 32 ms 64448 KB Output is correct
105 Correct 6 ms 49496 KB Output is correct
106 Correct 23 ms 63044 KB Output is correct
107 Correct 40 ms 63972 KB Output is correct
108 Correct 34 ms 64432 KB Output is correct
109 Correct 35 ms 63668 KB Output is correct
110 Correct 31 ms 63948 KB Output is correct
111 Correct 35 ms 64432 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 49496 KB Output is correct
2 Correct 6 ms 49496 KB Output is correct
3 Correct 106 ms 63924 KB Output is correct
4 Correct 778 ms 64488 KB Output is correct
5 Correct 715 ms 61120 KB Output is correct
6 Correct 792 ms 64424 KB Output is correct
7 Correct 579 ms 63788 KB Output is correct
8 Correct 862 ms 64528 KB Output is correct
9 Correct 6 ms 49496 KB Output is correct
10 Correct 5 ms 49496 KB Output is correct
11 Correct 6 ms 49496 KB Output is correct
12 Correct 8 ms 49496 KB Output is correct
13 Correct 7 ms 51544 KB Output is correct
14 Incorrect 7 ms 53712 KB Output isn't correct
15 Halted 0 ms 0 KB -