oj.uz

Submission #557220

# Submission time Handle Problem Language Result Execution time Memory
557220 2022-05-04T21:30:35 Z new_acc Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 995 ms 48984 KB 
#include<bits/stdc++.h>
#include "jumps.h"
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=2e5+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=18;
int t[N],l[N][L+1],r[N][L+1],w[N][L+1],n;
void init(int nn,vi v){
    n=nn;
    for(int i=1;i<=n;i++) t[i]=v[i-1];
    deque<pair<int,int> >deq;
    for(int i=n;i>=1;i--){
        while(deq.size() and deq.back().fi<t[i]) deq.pop_back();
        if(!deq.size()) r[i][0]=n+1;
        else r[i][0]=deq.back().se;
        deq.push_back({t[i],i});
    }
    deq.clear();
    for(int i=1;i<=n;i++){
        while(deq.size() and deq.back().fi<t[i]) deq.pop_back();
        if(!deq.size()) l[i][0]=0;
        else l[i][0]=deq.back().se;
        deq.push_back({t[i],i});
    }
    for(int i=0;i<=L;i++) r[n+1][i]=n+1;
    for(int i=1;i<=n;i++){
        for(int k=1;k<=L;k++) l[i][k]=l[l[i][k-1]][k-1];
    }
    for(int i=n;i>=1;i--){
        for(int k=1;k<=L;k++) r[i][k]=r[r[i][k-1]][k-1];
    }
    t[n+1]=INFi;
    for(int i=1;i<=n;i++){
        if((r[i][0]==n+1 and l[i][0]!=0) or t[l[i][0]]>t[r[i][0]]) w[i][0]=l[i][0];
        else w[i][0]=r[i][0];
    }
    for(int i=0;i<=L;i++) w[n+1][i]=n+1;
    for(int i=1;i<=L;i++){
        for(int k=1;k<=n;k++) w[k][i]=w[w[k][i-1]][i-1];
    }
}
int minimum_jumps(int a,int b,int c,int d){
    a++,b++,c++,d++;
    int cc=c;
    for(int i=L;i>=0;i--) if(r[cc][i]<=d) cc=r[cc][i];
    if(t[b]>t[cc]) return -1;
    int bb=b;
    for(int i=L;i>=0;i--) if(l[bb][i]>=a and t[l[bb][i]]<t[cc]) bb=l[bb][i];
    int curr=0;
    for(int i=L;i>=0;i--) if(t[w[bb][i]]<t[cc] and w[bb][i]<c) bb=w[bb][i],curr+=(1<<i);
    int res=-1;
    for(int i=L;i>=0;i--){
        if(r[bb][i]<c) curr+=(1<<i),bb=r[bb][i];
        else res=curr+(1<<i);
    }
    if(r[bb][0]>d) return -1;
    return res;
}
/*int main(){
    int n;
    cin>>n;
    vi xd;
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        xd.push_back(a);
    }
    init(n,xd);
    int q;
    cin>>q;
    while(q--){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        cout<<minimum_jumps(a,b,c,d)<<"\n";
    }
}*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 176 ms 38756 KB Output is correct
4 Correct 982 ms 48264 KB Output is correct
5 Correct 796 ms 24520 KB Output is correct
6 Correct 995 ms 48276 KB Output is correct
7 Correct 809 ms 33408 KB Output is correct
8 Correct 994 ms 48256 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Incorrect 2 ms 336 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Incorrect 2 ms 336 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 77 ms 38048 KB Output is correct
6 Correct 93 ms 47264 KB Output is correct
7 Correct 42 ms 24356 KB Output is correct
8 Correct 107 ms 47240 KB Output is correct
9 Correct 11 ms 7400 KB Output is correct
10 Correct 108 ms 47284 KB Output is correct
11 Correct 93 ms 48204 KB Output is correct
12 Correct 92 ms 48260 KB Output is correct
13 Correct 87 ms 48312 KB Output is correct
14 Correct 94 ms 47148 KB Output is correct
15 Incorrect 108 ms 47800 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 220 ms 21704 KB Output is correct
5 Correct 747 ms 47268 KB Output is correct
6 Correct 513 ms 8016 KB Output is correct
7 Correct 902 ms 47264 KB Output is correct
8 Correct 494 ms 16464 KB Output is correct
9 Correct 910 ms 47264 KB Output is correct
10 Correct 819 ms 48296 KB Output is correct
11 Correct 844 ms 48308 KB Output is correct
12 Correct 964 ms 48308 KB Output is correct
13 Correct 856 ms 47176 KB Output is correct
14 Correct 752 ms 47928 KB Output is correct
15 Correct 815 ms 48916 KB Output is correct
16 Correct 840 ms 48804 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 17 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 17 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 48 ms 27428 KB Output is correct
34 Correct 100 ms 47244 KB Output is correct
35 Correct 91 ms 48204 KB Output is correct
36 Correct 90 ms 47256 KB Output is correct
37 Correct 99 ms 47824 KB Output is correct
38 Correct 97 ms 48916 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 220 ms 21704 KB Output is correct
5 Correct 747 ms 47268 KB Output is correct
6 Correct 513 ms 8016 KB Output is correct
7 Correct 902 ms 47264 KB Output is correct
8 Correct 494 ms 16464 KB Output is correct
9 Correct 910 ms 47264 KB Output is correct
10 Correct 819 ms 48296 KB Output is correct
11 Correct 844 ms 48308 KB Output is correct
12 Correct 964 ms 48308 KB Output is correct
13 Correct 856 ms 47176 KB Output is correct
14 Correct 752 ms 47928 KB Output is correct
15 Correct 815 ms 48916 KB Output is correct
16 Correct 840 ms 48804 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 17 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 17 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 48 ms 27428 KB Output is correct
34 Correct 100 ms 47244 KB Output is correct
35 Correct 91 ms 48204 KB Output is correct
36 Correct 90 ms 47256 KB Output is correct
37 Correct 99 ms 47824 KB Output is correct
38 Correct 97 ms 48916 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 231 ms 21724 KB Output is correct
43 Correct 682 ms 47248 KB Output is correct
44 Correct 520 ms 8044 KB Output is correct
45 Correct 722 ms 47236 KB Output is correct
46 Correct 510 ms 16484 KB Output is correct
47 Correct 800 ms 47248 KB Output is correct
48 Correct 908 ms 48300 KB Output is correct
49 Correct 964 ms 48256 KB Output is correct
50 Correct 761 ms 48308 KB Output is correct
51 Correct 688 ms 47172 KB Output is correct
52 Correct 823 ms 47856 KB Output is correct
53 Correct 885 ms 48840 KB Output is correct
54 Correct 889 ms 48984 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 143 ms 47128 KB Output is correct
57 Correct 867 ms 47260 KB Output is correct
58 Correct 377 ms 8528 KB Output is correct
59 Correct 754 ms 47264 KB Output is correct
60 Correct 396 ms 16968 KB Output is correct
61 Correct 884 ms 47268 KB Output is correct
62 Correct 932 ms 48240 KB Output is correct
63 Correct 798 ms 48304 KB Output is correct
64 Correct 795 ms 48288 KB Output is correct
65 Correct 685 ms 47168 KB Output is correct
66 Correct 890 ms 47784 KB Output is correct
67 Correct 727 ms 48808 KB Output is correct
68 Correct 758 ms 48804 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 0 ms 336 KB Output is correct
85 Correct 4 ms 336 KB Output is correct
86 Correct 20 ms 720 KB Output is correct
87 Correct 17 ms 720 KB Output is correct
88 Correct 20 ms 720 KB Output is correct
89 Correct 18 ms 720 KB Output is correct
90 Correct 22 ms 720 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 16 ms 720 KB Output is correct
94 Correct 17 ms 720 KB Output is correct
95 Correct 19 ms 720 KB Output is correct
96 Correct 18 ms 720 KB Output is correct
97 Correct 9 ms 716 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 93 ms 47136 KB Output is correct
100 Correct 94 ms 47176 KB Output is correct
101 Correct 93 ms 48316 KB Output is correct
102 Correct 92 ms 47152 KB Output is correct
103 Correct 98 ms 47832 KB Output is correct
104 Correct 94 ms 48820 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 48 ms 27424 KB Output is correct
107 Correct 91 ms 47176 KB Output is correct
108 Correct 93 ms 48232 KB Output is correct
109 Correct 90 ms 47264 KB Output is correct
110 Correct 119 ms 47764 KB Output is correct
111 Correct 91 ms 48892 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 176 ms 38756 KB Output is correct
4 Correct 982 ms 48264 KB Output is correct
5 Correct 796 ms 24520 KB Output is correct
6 Correct 995 ms 48276 KB Output is correct
7 Correct 809 ms 33408 KB Output is correct
8 Correct 994 ms 48256 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Incorrect 2 ms 336 KB Output isn't correct
15 Halted 0 ms 0 KB -