oj.uz

Submission #973553

# Submission time Handle Problem Language Result Execution time Memory
973553 2024-05-02T07:12:05 Z Tuanlinh123 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 864 ms 64692 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) 
{
    if (R[0][i]>l) return 0;
    return query(i, r)==query(l, r);
}

int minimum_jumps(int A, int B, int C, int D) 
{
    A++, B++, C++, D++;
    if (!check(B, C, D)) return -1;
    for (ll i=19; i>=0; i--)
        if (check(L[i][B], C, D) && L[i][B]>=A)
            B=L[i][B];
    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];
    if (R[0][B]>=C) return ans+1;
    if (query(Max[0][B], D)==query(C, D)) B=Max[0][B], ans++;
    for (ll i=19; i>=0; i--)
        if (R[i][B]<C)
            ans+=1<<i, B=R[i][B];
    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 49492 KB Output is correct
2 Correct 7 ms 49496 KB Output is correct
3 Correct 106 ms 63936 KB Output is correct
4 Correct 811 ms 64432 KB Output is correct
5 Correct 622 ms 61104 KB Output is correct
6 Correct 773 ms 64444 KB Output is correct
7 Correct 626 ms 63692 KB Output is correct
8 Correct 730 ms 64520 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 49496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 49496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 49496 KB Output isn't correct
2 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 49496 KB Output is correct
3 Correct 7 ms 49496 KB Output is correct
4 Correct 136 ms 60620 KB Output is correct
5 Correct 612 ms 63680 KB Output is correct
6 Correct 359 ms 60116 KB Output is correct
7 Correct 593 ms 63672 KB Output is correct
8 Correct 340 ms 60428 KB Output is correct
9 Correct 581 ms 63680 KB Output is correct
10 Correct 793 ms 64692 KB Output is correct
11 Correct 748 ms 64436 KB Output is correct
12 Correct 760 ms 64452 KB Output is correct
13 Correct 555 ms 63688 KB Output is correct
14 Correct 864 ms 63920 KB Output is correct
15 Correct 600 ms 64428 KB Output is correct
16 Correct 596 ms 64448 KB Output is correct
17 Correct 6 ms 49496 KB Output is correct
18 Correct 6 ms 49616 KB Output is correct
19 Correct 6 ms 49632 KB Output is correct
20 Correct 7 ms 53592 KB Output is correct
21 Correct 7 ms 53792 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 53592 KB Output is correct
25 Correct 6 ms 53692 KB Output is correct
26 Correct 6 ms 55640 KB Output is correct
27 Correct 15 ms 55640 KB Output is correct
28 Correct 15 ms 55636 KB Output is correct
29 Correct 13 ms 55640 KB Output is correct
30 Correct 16 ms 55640 KB Output is correct
31 Correct 14 ms 55640 KB Output is correct
32 Correct 6 ms 49496 KB Output is correct
33 Correct 23 ms 62908 KB Output is correct
34 Correct 36 ms 63680 KB Output is correct
35 Correct 37 ms 64440 KB Output is correct
36 Correct 35 ms 63640 KB Output is correct
37 Correct 41 ms 64080 KB Output is correct
38 Correct 33 ms 64452 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 49496 KB Output is correct
3 Correct 7 ms 49496 KB Output is correct
4 Correct 136 ms 60620 KB Output is correct
5 Correct 612 ms 63680 KB Output is correct
6 Correct 359 ms 60116 KB Output is correct
7 Correct 593 ms 63672 KB Output is correct
8 Correct 340 ms 60428 KB Output is correct
9 Correct 581 ms 63680 KB Output is correct
10 Correct 793 ms 64692 KB Output is correct
11 Correct 748 ms 64436 KB Output is correct
12 Correct 760 ms 64452 KB Output is correct
13 Correct 555 ms 63688 KB Output is correct
14 Correct 864 ms 63920 KB Output is correct
15 Correct 600 ms 64428 KB Output is correct
16 Correct 596 ms 64448 KB Output is correct
17 Correct 6 ms 49496 KB Output is correct
18 Correct 6 ms 49616 KB Output is correct
19 Correct 6 ms 49632 KB Output is correct
20 Correct 7 ms 53592 KB Output is correct
21 Correct 7 ms 53792 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 53592 KB Output is correct
25 Correct 6 ms 53692 KB Output is correct
26 Correct 6 ms 55640 KB Output is correct
27 Correct 15 ms 55640 KB Output is correct
28 Correct 15 ms 55636 KB Output is correct
29 Correct 13 ms 55640 KB Output is correct
30 Correct 16 ms 55640 KB Output is correct
31 Correct 14 ms 55640 KB Output is correct
32 Correct 6 ms 49496 KB Output is correct
33 Correct 23 ms 62908 KB Output is correct
34 Correct 36 ms 63680 KB Output is correct
35 Correct 37 ms 64440 KB Output is correct
36 Correct 35 ms 63640 KB Output is correct
37 Correct 41 ms 64080 KB Output is correct
38 Correct 33 ms 64452 KB Output is correct
39 Correct 5 ms 49496 KB Output is correct
40 Correct 6 ms 49496 KB Output is correct
41 Correct 5 ms 49676 KB Output is correct
42 Correct 148 ms 60600 KB Output is correct
43 Correct 556 ms 63704 KB Output is correct
44 Correct 399 ms 60216 KB Output is correct
45 Correct 527 ms 63684 KB Output is correct
46 Correct 369 ms 60620 KB Output is correct
47 Correct 584 ms 63676 KB Output is correct
48 Correct 773 ms 64424 KB Output is correct
49 Correct 722 ms 64448 KB Output is correct
50 Correct 716 ms 64428 KB Output is correct
51 Correct 549 ms 63680 KB Output is correct
52 Correct 766 ms 63932 KB Output is correct
53 Correct 608 ms 64428 KB Output is correct
54 Correct 635 ms 64500 KB Output is correct
55 Correct 6 ms 49496 KB Output is correct
56 Correct 67 ms 63496 KB Output is correct
57 Correct 561 ms 63660 KB Output is correct
58 Correct 316 ms 60352 KB Output is correct
59 Correct 550 ms 63732 KB Output is correct
60 Correct 242 ms 60616 KB Output is correct
61 Correct 584 ms 63676 KB Output is correct
62 Correct 768 ms 64448 KB Output is correct
63 Correct 743 ms 64196 KB Output is correct
64 Correct 777 ms 64248 KB Output is correct
65 Correct 571 ms 63676 KB Output is correct
66 Correct 808 ms 63932 KB Output is correct
67 Correct 635 ms 64440 KB Output is correct
68 Correct 580 ms 64496 KB Output is correct
69 Correct 5 ms 49496 KB Output is correct
70 Correct 6 ms 51544 KB Output is correct
71 Correct 7 ms 53844 KB Output is correct
72 Correct 9 ms 53596 KB Output is correct
73 Correct 8 ms 53760 KB Output is correct
74 Correct 7 ms 53748 KB Output is correct
75 Correct 7 ms 53592 KB Output is correct
76 Correct 6 ms 49604 KB Output is correct
77 Correct 6 ms 49496 KB Output is correct
78 Correct 6 ms 49496 KB Output is correct
79 Correct 6 ms 53592 KB Output is correct
80 Correct 9 ms 53700 KB Output is correct
81 Correct 7 ms 53796 KB Output is correct
82 Correct 7 ms 53788 KB Output is correct
83 Correct 8 ms 53692 KB Output is correct
84 Correct 7 ms 53592 KB Output is correct
85 Correct 8 ms 53752 KB Output is correct
86 Correct 17 ms 55640 KB Output is correct
87 Correct 18 ms 55640 KB Output is correct
88 Correct 16 ms 55844 KB Output is correct
89 Correct 16 ms 55640 KB Output is correct
90 Correct 18 ms 55640 KB Output is correct
91 Correct 7 ms 53592 KB Output is correct
92 Correct 7 ms 55640 KB Output is correct
93 Correct 16 ms 55640 KB Output is correct
94 Correct 16 ms 55872 KB Output is correct
95 Correct 17 ms 55648 KB Output is correct
96 Correct 17 ms 55640 KB Output is correct
97 Correct 18 ms 55640 KB Output is correct
98 Correct 6 ms 49496 KB Output is correct
99 Correct 37 ms 63660 KB Output is correct
100 Correct 35 ms 63496 KB Output is correct
101 Correct 33 ms 64360 KB Output is correct
102 Correct 37 ms 63672 KB Output is correct
103 Correct 39 ms 64088 KB Output is correct
104 Correct 36 ms 64480 KB Output is correct
105 Correct 5 ms 49496 KB Output is correct
106 Correct 29 ms 62920 KB Output is correct
107 Correct 38 ms 63680 KB Output is correct
108 Correct 45 ms 64420 KB Output is correct
109 Correct 37 ms 63664 KB Output is correct
110 Correct 39 ms 64120 KB Output is correct
111 Correct 41 ms 64300 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 49492 KB Output is correct
2 Correct 7 ms 49496 KB Output is correct
3 Correct 106 ms 63936 KB Output is correct
4 Correct 811 ms 64432 KB Output is correct
5 Correct 622 ms 61104 KB Output is correct
6 Correct 773 ms 64444 KB Output is correct
7 Correct 626 ms 63692 KB Output is correct
8 Correct 730 ms 64520 KB Output is correct
9 Incorrect 6 ms 49496 KB Output isn't correct
10 Halted 0 ms 0 KB -