oj.uz

Submission #587740

# Submission time Handle Problem Language Result Execution time Memory
587740 2022-07-02T09:55:12 Z krit3379 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 2719 ms 36136 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;
        val=sol(1,1,n,c,mid);
        if(val>mm)ml=val,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:79:5: warning: 'ml' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |     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 1 ms 464 KB Output is correct
3 Correct 950 ms 29312 KB Output is correct
4 Correct 2282 ms 36008 KB Output is correct
5 Correct 1951 ms 18464 KB Output is correct
6 Correct 2719 ms 36008 KB Output is correct
7 Correct 1836 ms 25540 KB Output is correct
8 Correct 2377 ms 36020 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 1 ms 464 KB Output is correct
4 Correct 0 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 1 ms 464 KB Output is correct
4 Correct 0 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 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 1 ms 464 KB Output is correct
5 Correct 852 ms 29600 KB Output is correct
6 Correct 1049 ms 36016 KB Output is correct
7 Correct 479 ms 18748 KB Output is correct
8 Correct 1025 ms 36012 KB Output is correct
9 Correct 113 ms 5840 KB Output is correct
10 Correct 1056 ms 36008 KB Output is correct
11 Correct 993 ms 36016 KB Output is correct
12 Correct 1028 ms 36040 KB Output is correct
13 Incorrect 1010 ms 36132 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 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 614 ms 16908 KB Output is correct
5 Correct 1780 ms 36008 KB Output is correct
6 Correct 828 ms 6600 KB Output is correct
7 Correct 1930 ms 36008 KB Output is correct
8 Correct 827 ms 13196 KB Output is correct
9 Correct 1713 ms 36008 KB Output is correct
10 Correct 2114 ms 36012 KB Output is correct
11 Correct 2203 ms 36020 KB Output is correct
12 Correct 2055 ms 36020 KB Output is correct
13 Correct 1814 ms 36040 KB Output is correct
14 Correct 2093 ms 36040 KB Output is correct
15 Correct 1689 ms 36008 KB Output is correct
16 Correct 1647 ms 36012 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 2 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 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 2 ms 592 KB Output is correct
27 Correct 25 ms 848 KB Output is correct
28 Correct 25 ms 848 KB Output is correct
29 Correct 26 ms 848 KB Output is correct
30 Correct 19 ms 848 KB Output is correct
31 Correct 22 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 556 ms 21000 KB Output is correct
34 Correct 1035 ms 36008 KB Output is correct
35 Correct 1008 ms 36008 KB Output is correct
36 Correct 1028 ms 36008 KB Output is correct
37 Correct 1072 ms 36016 KB Output is correct
38 Correct 1022 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 0 ms 464 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 614 ms 16908 KB Output is correct
5 Correct 1780 ms 36008 KB Output is correct
6 Correct 828 ms 6600 KB Output is correct
7 Correct 1930 ms 36008 KB Output is correct
8 Correct 827 ms 13196 KB Output is correct
9 Correct 1713 ms 36008 KB Output is correct
10 Correct 2114 ms 36012 KB Output is correct
11 Correct 2203 ms 36020 KB Output is correct
12 Correct 2055 ms 36020 KB Output is correct
13 Correct 1814 ms 36040 KB Output is correct
14 Correct 2093 ms 36040 KB Output is correct
15 Correct 1689 ms 36008 KB Output is correct
16 Correct 1647 ms 36012 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 2 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 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 2 ms 592 KB Output is correct
27 Correct 25 ms 848 KB Output is correct
28 Correct 25 ms 848 KB Output is correct
29 Correct 26 ms 848 KB Output is correct
30 Correct 19 ms 848 KB Output is correct
31 Correct 22 ms 848 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 556 ms 21000 KB Output is correct
34 Correct 1035 ms 36008 KB Output is correct
35 Correct 1008 ms 36008 KB Output is correct
36 Correct 1028 ms 36008 KB Output is correct
37 Correct 1072 ms 36016 KB Output is correct
38 Correct 1022 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 1 ms 464 KB Output is correct
42 Correct 624 ms 16900 KB Output is correct
43 Correct 1865 ms 36008 KB Output is correct
44 Correct 782 ms 6576 KB Output is correct
45 Correct 1729 ms 36024 KB Output is correct
46 Correct 815 ms 13008 KB Output is correct
47 Correct 1914 ms 36008 KB Output is correct
48 Correct 2136 ms 36040 KB Output is correct
49 Correct 2059 ms 36012 KB Output is correct
50 Correct 2127 ms 36012 KB Output is correct
51 Correct 2037 ms 36016 KB Output is correct
52 Correct 2021 ms 36040 KB Output is correct
53 Correct 1959 ms 36128 KB Output is correct
54 Correct 1916 ms 36008 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 1123 ms 36004 KB Output is correct
57 Correct 1508 ms 36132 KB Output is correct
58 Correct 601 ms 6940 KB Output is correct
59 Correct 1971 ms 35908 KB Output is correct
60 Correct 725 ms 13392 KB Output is correct
61 Correct 1593 ms 36008 KB Output is correct
62 Correct 2279 ms 36016 KB Output is correct
63 Correct 2314 ms 36012 KB Output is correct
64 Correct 2041 ms 36012 KB Output is correct
65 Correct 1952 ms 36132 KB Output is correct
66 Correct 2415 ms 36012 KB Output is correct
67 Correct 2166 ms 36128 KB Output is correct
68 Correct 1900 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 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 3 ms 464 KB Output is correct
81 Correct 2 ms 508 KB Output is correct
82 Correct 4 ms 464 KB Output is correct
83 Correct 2 ms 464 KB Output is correct
84 Correct 1 ms 464 KB Output is correct
85 Correct 4 ms 464 KB Output is correct
86 Correct 22 ms 848 KB Output is correct
87 Correct 23 ms 848 KB Output is correct
88 Correct 24 ms 848 KB Output is correct
89 Correct 24 ms 848 KB Output is correct
90 Correct 17 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 22 ms 848 KB Output is correct
94 Correct 26 ms 848 KB Output is correct
95 Correct 21 ms 848 KB Output is correct
96 Correct 23 ms 848 KB Output is correct
97 Correct 16 ms 848 KB Output is correct
98 Correct 0 ms 464 KB Output is correct
99 Correct 1034 ms 36004 KB Output is correct
100 Correct 1027 ms 36008 KB Output is correct
101 Correct 1008 ms 36132 KB Output is correct
102 Correct 1028 ms 36040 KB Output is correct
103 Correct 1093 ms 36136 KB Output is correct
104 Correct 1039 ms 35912 KB Output is correct
105 Correct 1 ms 464 KB Output is correct
106 Correct 557 ms 20944 KB Output is correct
107 Correct 1033 ms 36016 KB Output is correct
108 Correct 1014 ms 36004 KB Output is correct
109 Correct 1022 ms 36120 KB Output is correct
110 Correct 1099 ms 36008 KB Output is correct
111 Correct 1016 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 1 ms 464 KB Output is correct
3 Correct 950 ms 29312 KB Output is correct
4 Correct 2282 ms 36008 KB Output is correct
5 Correct 1951 ms 18464 KB Output is correct
6 Correct 2719 ms 36008 KB Output is correct
7 Correct 1836 ms 25540 KB Output is correct
8 Correct 2377 ms 36020 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 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 -