oj.uz

Submission #587738

# Submission time Handle Problem Language Result Execution time Memory
587738 2022-07-02T09:51:14 Z krit3379 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 2554 ms 36132 KB 
#include<bits/stdc++.h>
#include"jumps.h"
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 200005

int t[4*N],arr[N],up[20][N],dow[20][N],n;

void cre(int x,int l,int r){
    if(l==r){t[x]=arr[l];return ;}
    int mid=(l+r)/2;
    cre(x*2,l,mid);
    cre(x*2+1,mid+1,r);
    t[x]=max(t[x*2],t[x*2+1]);
}

int sol(int x,int l,int r,int ll,int rr){
    if(l>rr||ll>r||ll>rr)return 0;
    if(ll<=l&&r<=rr)return t[x];
    int mid=(l+r)/2;
    return max(sol(x*2,l,mid,ll,rr),sol(x*2+1,mid+1,r,ll,rr));
}

void init(int nn,vector<int> h){
    int i,j,l,r,mid,val;
    n=nn;
    for(i=0;i<n;i++)arr[i+1]=h[i];
    cre(1,1,n);
    arr[n+1]=n+1;
    for(i=0;i<20;i++)for(j=0;j<=n+1;j++)up[i][j]=dow[i][j]=n+1;
    for(i=1;i<=n;i++){
        l=1,r=i-1;
        while(l<=r){
            mid=(l+r)/2;
            if(sol(1,1,n,mid,i-1)>arr[i])dow[0][arr[i]]=arr[mid],l=mid+1;
            else r=mid-1;
        }
        l=i+1,r=n;
        while(l<=r){
            mid=(l+r)/2;
            if(sol(1,1,n,i+1,mid)>arr[i])up[0][arr[i]]=arr[mid],r=mid-1;
            else l=mid+1;
        }
        if(up[0][arr[i]]<dow[0][arr[i]])swap(up[0][arr[i]],dow[0][arr[i]]);
    }
    for(i=1;i<20;i++)for(j=1;j<=n;j++){
        up[i][j]=up[i-1][up[i-1][j]];
        dow[i][j]=dow[i-1][dow[i-1][j]];
    }
    return ;
}

int minimum_jumps(int a,int b,int c,int d){
    a++,b++,c++,d++;
    int i,l,r,mid,ml,mm,mr,now,val,ans=0;
    mm=sol(1,1,n,b+1,c-1);
    mr=sol(1,1,n,c,d);
    if(mm>mr)return -1;
    l=c,r=d;
    while(l<=r){
        mid=(l+r)/2;
        if(sol(1,1,n,c,mid)>mm)ml=arr[mid],r=mid-1;
        else l=mid+1;
    }
    l=a,r=b;
    now=n+1;
    while(l<=r){
        mid=(l+r)/2;
        val=sol(1,1,n,mid,b);
        if(val<mr)now=val,r=mid-1;
        else l=mid+1;
    }
    if(now>mr)return -1;
    for(i=19;i>=0;i--)if(up[i][now]<ml)ans+=1<<i,now=up[i][now];
    if(up[0][now]>=ml&&up[0][now]<=mr)return ans+1;
    for(i=19;i>=0;i--)if(dow[i][now]<ml)ans+=1<<i,now=dow[i][now];
    if(dow[0][now]>=ml&&dow[0][now]<=mr)return ans+1;
    return -1;
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:26:21: warning: unused variable 'val' [-Wunused-variable]
   26 |     int i,j,l,r,mid,val;
      |                     ^~~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:78:5: warning: 'ml' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |     if(dow[0][now]>=ml&&dow[0][now]<=mr)return ans+1;
      |     ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1054 ms 29308 KB Output is correct
4 Correct 2331 ms 36008 KB Output is correct
5 Correct 2087 ms 18460 KB Output is correct
6 Correct 2425 ms 36040 KB Output is correct
7 Correct 1970 ms 25520 KB Output is correct
8 Correct 2554 ms 36008 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Incorrect 3 ms 464 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 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 841 ms 29600 KB Output is correct
6 Correct 1122 ms 36012 KB Output is correct
7 Correct 493 ms 18760 KB Output is correct
8 Correct 1079 ms 36132 KB Output is correct
9 Correct 116 ms 5712 KB Output is correct
10 Correct 1068 ms 36012 KB Output is correct
11 Correct 1056 ms 36016 KB Output is correct
12 Correct 1110 ms 36000 KB Output is correct
13 Incorrect 1062 ms 36008 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 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 700 ms 16908 KB Output is correct
5 Correct 2147 ms 36008 KB Output is correct
6 Correct 729 ms 6572 KB Output is correct
7 Correct 1657 ms 36008 KB Output is correct
8 Correct 911 ms 13120 KB Output is correct
9 Correct 2004 ms 36008 KB Output is correct
10 Correct 2055 ms 36008 KB Output is correct
11 Correct 1994 ms 36016 KB Output is correct
12 Correct 2197 ms 36036 KB Output is correct
13 Correct 2044 ms 36008 KB Output is correct
14 Correct 2298 ms 36020 KB Output is correct
15 Correct 1947 ms 36012 KB Output is correct
16 Correct 2058 ms 36012 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 13 ms 848 KB Output is correct
28 Correct 27 ms 848 KB Output is correct
29 Correct 21 ms 848 KB Output is correct
30 Correct 26 ms 880 KB Output is correct
31 Correct 20 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 607 ms 20936 KB Output is correct
34 Correct 1055 ms 36012 KB Output is correct
35 Correct 1033 ms 36008 KB Output is correct
36 Correct 1043 ms 36016 KB Output is correct
37 Correct 1122 ms 36008 KB Output is correct
38 Correct 1088 ms 36012 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 700 ms 16908 KB Output is correct
5 Correct 2147 ms 36008 KB Output is correct
6 Correct 729 ms 6572 KB Output is correct
7 Correct 1657 ms 36008 KB Output is correct
8 Correct 911 ms 13120 KB Output is correct
9 Correct 2004 ms 36008 KB Output is correct
10 Correct 2055 ms 36008 KB Output is correct
11 Correct 1994 ms 36016 KB Output is correct
12 Correct 2197 ms 36036 KB Output is correct
13 Correct 2044 ms 36008 KB Output is correct
14 Correct 2298 ms 36020 KB Output is correct
15 Correct 1947 ms 36012 KB Output is correct
16 Correct 2058 ms 36012 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 13 ms 848 KB Output is correct
28 Correct 27 ms 848 KB Output is correct
29 Correct 21 ms 848 KB Output is correct
30 Correct 26 ms 880 KB Output is correct
31 Correct 20 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 607 ms 20936 KB Output is correct
34 Correct 1055 ms 36012 KB Output is correct
35 Correct 1033 ms 36008 KB Output is correct
36 Correct 1043 ms 36016 KB Output is correct
37 Correct 1122 ms 36008 KB Output is correct
38 Correct 1088 ms 36012 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 0 ms 464 KB Output is correct
42 Correct 627 ms 16812 KB Output is correct
43 Correct 1979 ms 36012 KB Output is correct
44 Correct 632 ms 6480 KB Output is correct
45 Correct 2110 ms 36012 KB Output is correct
46 Correct 814 ms 13116 KB Output is correct
47 Correct 1961 ms 36008 KB Output is correct
48 Correct 2041 ms 36008 KB Output is correct
49 Correct 2128 ms 36016 KB Output is correct
50 Correct 2088 ms 36008 KB Output is correct
51 Correct 1992 ms 36016 KB Output is correct
52 Correct 2232 ms 36008 KB Output is correct
53 Correct 1754 ms 36008 KB Output is correct
54 Correct 1943 ms 36020 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 1153 ms 36008 KB Output is correct
57 Correct 2110 ms 36000 KB Output is correct
58 Correct 684 ms 6864 KB Output is correct
59 Correct 1942 ms 36012 KB Output is correct
60 Correct 763 ms 13520 KB Output is correct
61 Correct 1948 ms 36016 KB Output is correct
62 Correct 2376 ms 36004 KB Output is correct
63 Correct 2480 ms 36012 KB Output is correct
64 Correct 2354 ms 36016 KB Output is correct
65 Correct 1825 ms 36012 KB Output is correct
66 Correct 2384 ms 36012 KB Output is correct
67 Correct 2154 ms 36016 KB Output is correct
68 Correct 1976 ms 36012 KB Output is correct
69 Correct 1 ms 464 KB Output is correct
70 Correct 1 ms 464 KB Output is correct
71 Correct 2 ms 464 KB Output is correct
72 Correct 3 ms 464 KB Output is correct
73 Correct 3 ms 464 KB Output is correct
74 Correct 3 ms 464 KB Output is correct
75 Correct 3 ms 464 KB Output is correct
76 Correct 0 ms 464 KB Output is correct
77 Correct 0 ms 464 KB Output is correct
78 Correct 2 ms 464 KB Output is correct
79 Correct 3 ms 464 KB Output is correct
80 Correct 2 ms 464 KB Output is correct
81 Correct 2 ms 464 KB Output is correct
82 Correct 3 ms 464 KB Output is correct
83 Correct 3 ms 464 KB Output is correct
84 Correct 1 ms 464 KB Output is correct
85 Correct 3 ms 464 KB Output is correct
86 Correct 27 ms 848 KB Output is correct
87 Correct 21 ms 848 KB Output is correct
88 Correct 20 ms 848 KB Output is correct
89 Correct 23 ms 848 KB Output is correct
90 Correct 26 ms 848 KB Output is correct
91 Correct 1 ms 464 KB Output is correct
92 Correct 2 ms 592 KB Output is correct
93 Correct 26 ms 848 KB Output is correct
94 Correct 23 ms 928 KB Output is correct
95 Correct 22 ms 848 KB Output is correct
96 Correct 22 ms 848 KB Output is correct
97 Correct 20 ms 848 KB Output is correct
98 Correct 1 ms 464 KB Output is correct
99 Correct 1127 ms 36000 KB Output is correct
100 Correct 1079 ms 36008 KB Output is correct
101 Correct 1027 ms 36008 KB Output is correct
102 Correct 1053 ms 36008 KB Output is correct
103 Correct 1121 ms 36004 KB Output is correct
104 Correct 1042 ms 36016 KB Output is correct
105 Correct 0 ms 464 KB Output is correct
106 Correct 564 ms 20992 KB Output is correct
107 Correct 1078 ms 36004 KB Output is correct
108 Correct 1018 ms 36008 KB Output is correct
109 Correct 1050 ms 36012 KB Output is correct
110 Correct 1094 ms 36016 KB Output is correct
111 Correct 1067 ms 36016 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1054 ms 29308 KB Output is correct
4 Correct 2331 ms 36008 KB Output is correct
5 Correct 2087 ms 18460 KB Output is correct
6 Correct 2425 ms 36040 KB Output is correct
7 Correct 1970 ms 25520 KB Output is correct
8 Correct 2554 ms 36008 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 464 KB Output is correct
11 Correct 0 ms 464 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Incorrect 3 ms 464 KB Output isn't correct
15 Halted 0 ms 0 KB -