oj.uz

Submission #734177

# Submission time Handle Problem Language Result Execution time Memory
734177 2023-05-02T03:26:15 Z bin9638 Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 39592 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "jumps.h"
#endif // SKY

using namespace std;

#define N 200010
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

struct IT
{
    int ST[N*4];

    void init()
    {
        memset(ST,-0x3f3f,sizeof(ST));
    }

    void update(int id,int l,int r,int i,int val)
    {
        if(l>i||r<i)
            return;
        if(l==r)
        {
            ST[id]=val;
            return;
        }
        int mid=(l+r)/2;
        update(id*2,l,mid,i,val);
        update(id*2+1,mid+1,r,i,val);
        ST[id]=max(ST[id*2],ST[id*2+1]);
    }

    int get(int id,int l,int r,int u,int v)
    {
        if(u>v||l>v||r<u)
            return -1e9;
        if(l>=u&&r<=v)
            return ST[id];
        int mid=(l+r)/2;
        return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
    }
}IT;

int n,h[N],pos[N],truoc[N][21],sau[N][21],LOG;

void init(int NNN, vector<int> HHH)
{
    n=NNN;
    for(int i=0;i<n;i++)
        h[i+1]=HHH[i],pos[HHH[i]]=i+1;
    LOG=log2(n);
    IT.init();
    for(int i=n;i>=1;i--)
    {
        if(IT.get(1,1,n,1,pos[i]-1)>=-n)
            truoc[pos[i]][0]=abs(IT.get(1,1,n,1,pos[i]-1));
        IT.update(1,1,n,pos[i],pos[i]);
    }
    IT.init();
    for(int i=n;i>=1;i--)
    {
        if(IT.get(1,1,n,pos[i]+1,n)>=-n)
            sau[pos[i]][0]=abs(IT.get(1,1,n,pos[i]+1,n));
        IT.update(1,1,n,pos[i],-pos[i]);
    }
    for(int k=1;k<=LOG;k++)
        for(int i=1;i<=n;i++)
            {
                sau[i][k]=sau[sau[i][k-1]][k-1];
                truoc[i][k]=truoc[truoc[i][k-1]][k-1];
            }
   // for(int i=1;i<=n;i++)cout<<truoc[i][0]<<" "<<sau[i][0]<<endl;
    IT.init();
    for(int i=1;i<=n;i++)
        IT.update(1,1,n,i,h[i]);
}

bool check(int vt,int C,int D)
{
    return(vt>=C&&vt<=D);
}

int f[2010];

int minimum_jumps(int A, int B, int C, int D)
{
    A++;B++;C++;D++;
    if(IT.get(1,1,n,B,C-1)>IT.get(1,1,n,C,D))
        return -1;
    int l=A,r=B,vt;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(IT.get(1,1,n,mid,B)<IT.get(1,1,n,C,D))
        {
            vt=mid;
            r=mid-1;
        }else
        {
            l=mid+1;
        }
    }
    int val=IT.get(1,1,n,vt,B);
    l=A,r=B;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(IT.get(1,1,n,mid,B)>=val)
        {
            vt=mid;
            l=mid+1;
        }else
            r=mid-1;
    }
    int res=0;
    val=IT.get(1,1,n,C,D);
    while(h[vt]!=n)
    {
      ///  cout<<vt<<endl;
        res++;
        if(check(truoc[vt][0],C,D)||check(sau[vt][0],C,D))
            return res;
        if(truoc[vt][0]!=0&&h[truoc[vt][0]]<val&&(sau[vt][0]==0||h[truoc[vt][0]]>h[sau[vt][0]]))
        {
            vt=truoc[vt][0];
            continue;
        }
        vt=sau[vt][0];
    }
    return -1;
}


#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin>>n;
    vector<int>H(n);
    for(int i=0;i<n;i++)
        cin>>H[i];
    init(n,H);
    int q;
    cin>>q;
    while(q--)
    {
        int A,B,C,D;
        cin>>A>>B>>C>>D;
        cout<<minimum_jumps(A,B,C,D)<<endl;
    }
    return 0;
}
#endif

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:97:17: warning: 'vt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   97 |     int l=A,r=B,vt;
      |                 ^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 3 ms 3408 KB Output is correct
3 Correct 3978 ms 32104 KB Output is correct
4 Execution timed out 4003 ms 39336 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 2 ms 3408 KB Output is correct
3 Correct 2 ms 3408 KB Output is correct
4 Correct 2 ms 3408 KB Output is correct
5 Correct 221 ms 32384 KB Output is correct
6 Correct 273 ms 39432 KB Output is correct
7 Correct 136 ms 21888 KB Output is correct
8 Correct 263 ms 39440 KB Output is correct
9 Correct 26 ms 8784 KB Output is correct
10 Correct 260 ms 39440 KB Output is correct
11 Correct 190 ms 39432 KB Output is correct
12 Correct 184 ms 39428 KB Output is correct
13 Correct 179 ms 39440 KB Output is correct
14 Correct 239 ms 39396 KB Output is correct
15 Correct 185 ms 39316 KB Output is correct
16 Correct 200 ms 39332 KB Output is correct
17 Correct 183 ms 39324 KB Output is correct
18 Correct 2 ms 3408 KB Output is correct
19 Correct 3 ms 3376 KB Output is correct
20 Correct 2 ms 3408 KB Output is correct
21 Correct 3 ms 3408 KB Output is correct
22 Correct 2 ms 3408 KB Output is correct
23 Correct 2 ms 3408 KB Output is correct
24 Correct 2 ms 3408 KB Output is correct
25 Correct 2 ms 3408 KB Output is correct
26 Correct 3 ms 3536 KB Output is correct
27 Correct 5 ms 3700 KB Output is correct
28 Correct 4 ms 3792 KB Output is correct
29 Correct 4 ms 3792 KB Output is correct
30 Correct 3 ms 3792 KB Output is correct
31 Correct 3 ms 3792 KB Output is correct
32 Correct 2 ms 3372 KB Output is correct
33 Correct 256 ms 39388 KB Output is correct
34 Correct 245 ms 39592 KB Output is correct
35 Correct 182 ms 39324 KB Output is correct
36 Correct 249 ms 39324 KB Output is correct
37 Correct 191 ms 39440 KB Output is correct
38 Correct 175 ms 39412 KB Output is correct
39 Correct 3 ms 3408 KB Output is correct
40 Correct 140 ms 24236 KB Output is correct
41 Correct 329 ms 39436 KB Output is correct
42 Correct 181 ms 39432 KB Output is correct
43 Correct 267 ms 39344 KB Output is correct
44 Correct 199 ms 39436 KB Output is correct
45 Correct 215 ms 39440 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 2 ms 3408 KB Output is correct
3 Correct 2 ms 3500 KB Output is correct
4 Correct 351 ms 19920 KB Output is correct
5 Correct 1109 ms 39436 KB Output is correct
6 Correct 486 ms 9296 KB Output is correct
7 Correct 1277 ms 39368 KB Output is correct
8 Correct 695 ms 15784 KB Output is correct
9 Correct 928 ms 39472 KB Output is correct
10 Execution timed out 4024 ms 39368 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 2 ms 3408 KB Output is correct
3 Correct 2 ms 3500 KB Output is correct
4 Correct 351 ms 19920 KB Output is correct
5 Correct 1109 ms 39436 KB Output is correct
6 Correct 486 ms 9296 KB Output is correct
7 Correct 1277 ms 39368 KB Output is correct
8 Correct 695 ms 15784 KB Output is correct
9 Correct 928 ms 39472 KB Output is correct
10 Execution timed out 4024 ms 39368 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 3 ms 3408 KB Output is correct
3 Correct 3978 ms 32104 KB Output is correct
4 Execution timed out 4003 ms 39336 KB Time limit exceeded
5 Halted 0 ms 0 KB -