oj.uz

Submission #587736

# Submission time Handle Problem Language Result Execution time Memory
587736 2022-07-02T09:47:06 Z krit3379 Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 2441 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,c+1,d-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
0 / 4.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 Incorrect 996 ms 29312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 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 Incorrect 2 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 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 Incorrect 2 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 846 ms 29600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.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 640 ms 16908 KB Output is correct
5 Correct 1626 ms 36012 KB Output is correct
6 Correct 801 ms 6600 KB Output is correct
7 Correct 1797 ms 36012 KB Output is correct
8 Correct 896 ms 13124 KB Output is correct
9 Correct 2055 ms 36016 KB Output is correct
10 Correct 2078 ms 36016 KB Output is correct
11 Correct 2105 ms 36012 KB Output is correct
12 Correct 1970 ms 36012 KB Output is correct
13 Correct 1980 ms 36008 KB Output is correct
14 Correct 2189 ms 36012 KB Output is correct
15 Correct 1863 ms 36008 KB Output is correct
16 Correct 1928 ms 36016 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 3 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 3 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 28 ms 880 KB Output is correct
28 Correct 29 ms 848 KB Output is correct
29 Correct 26 ms 848 KB Output is correct
30 Correct 21 ms 848 KB Output is correct
31 Correct 21 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 577 ms 20996 KB Output is correct
34 Correct 1075 ms 36012 KB Output is correct
35 Correct 1075 ms 36008 KB Output is correct
36 Correct 1072 ms 36016 KB Output is correct
37 Correct 1165 ms 36016 KB Output is correct
38 Correct 1151 ms 36012 KB Output is correct

Subtask #6
21.0 / 21.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 640 ms 16908 KB Output is correct
5 Correct 1626 ms 36012 KB Output is correct
6 Correct 801 ms 6600 KB Output is correct
7 Correct 1797 ms 36012 KB Output is correct
8 Correct 896 ms 13124 KB Output is correct
9 Correct 2055 ms 36016 KB Output is correct
10 Correct 2078 ms 36016 KB Output is correct
11 Correct 2105 ms 36012 KB Output is correct
12 Correct 1970 ms 36012 KB Output is correct
13 Correct 1980 ms 36008 KB Output is correct
14 Correct 2189 ms 36012 KB Output is correct
15 Correct 1863 ms 36008 KB Output is correct
16 Correct 1928 ms 36016 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 3 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 3 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 28 ms 880 KB Output is correct
28 Correct 29 ms 848 KB Output is correct
29 Correct 26 ms 848 KB Output is correct
30 Correct 21 ms 848 KB Output is correct
31 Correct 21 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 577 ms 20996 KB Output is correct
34 Correct 1075 ms 36012 KB Output is correct
35 Correct 1075 ms 36008 KB Output is correct
36 Correct 1072 ms 36016 KB Output is correct
37 Correct 1165 ms 36016 KB Output is correct
38 Correct 1151 ms 36012 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 0 ms 464 KB Output is correct
42 Correct 713 ms 16916 KB Output is correct
43 Correct 2280 ms 36012 KB Output is correct
44 Correct 794 ms 6568 KB Output is correct
45 Correct 2204 ms 36012 KB Output is correct
46 Correct 858 ms 13124 KB Output is correct
47 Correct 2344 ms 36012 KB Output is correct
48 Correct 2045 ms 36008 KB Output is correct
49 Correct 2151 ms 36016 KB Output is correct
50 Correct 2125 ms 36016 KB Output is correct
51 Correct 2100 ms 36016 KB Output is correct
52 Correct 2161 ms 36012 KB Output is correct
53 Correct 1918 ms 36008 KB Output is correct
54 Correct 1889 ms 36012 KB Output is correct
55 Correct 1 ms 464 KB Output is correct
56 Correct 1184 ms 36004 KB Output is correct
57 Correct 2424 ms 36012 KB Output is correct
58 Correct 839 ms 6948 KB Output is correct
59 Correct 2162 ms 36012 KB Output is correct
60 Correct 883 ms 13460 KB Output is correct
61 Correct 2339 ms 36012 KB Output is correct
62 Correct 2434 ms 36012 KB Output is correct
63 Correct 2405 ms 36116 KB Output is correct
64 Correct 2441 ms 36132 KB Output is correct
65 Correct 2263 ms 36008 KB Output is correct
66 Correct 2435 ms 36012 KB Output is correct
67 Correct 2103 ms 36012 KB Output is correct
68 Correct 2009 ms 36016 KB Output is correct
69 Correct 0 ms 464 KB Output is correct
70 Correct 1 ms 464 KB Output is correct
71 Correct 3 ms 464 KB Output is correct
72 Correct 3 ms 464 KB Output is correct
73 Correct 2 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 1 ms 464 KB Output is correct
79 Correct 3 ms 464 KB Output is correct
80 Correct 4 ms 464 KB Output is correct
81 Correct 3 ms 464 KB Output is correct
82 Correct 2 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 5 ms 464 KB Output is correct
86 Correct 27 ms 880 KB Output is correct
87 Correct 24 ms 848 KB Output is correct
88 Correct 22 ms 848 KB Output is correct
89 Correct 22 ms 824 KB Output is correct
90 Correct 25 ms 876 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 27 ms 848 KB Output is correct
95 Correct 23 ms 820 KB Output is correct
96 Correct 23 ms 848 KB Output is correct
97 Correct 21 ms 848 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 1032 ms 36004 KB Output is correct
100 Correct 1050 ms 36008 KB Output is correct
101 Correct 1014 ms 36012 KB Output is correct
102 Correct 1025 ms 36012 KB Output is correct
103 Correct 1074 ms 36012 KB Output is correct
104 Correct 1016 ms 36008 KB Output is correct
105 Correct 1 ms 464 KB Output is correct
106 Correct 547 ms 20896 KB Output is correct
107 Correct 1028 ms 36012 KB Output is correct
108 Correct 1025 ms 36008 KB Output is correct
109 Correct 1018 ms 35968 KB Output is correct
110 Correct 1070 ms 36012 KB Output is correct
111 Correct 1012 ms 36008 KB Output is correct

Subtask #7
0 / 19.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 Incorrect 996 ms 29312 KB Output isn't correct
4 Halted 0 ms 0 KB -