oj.uz

Submission #528621

# Submission time Handle Problem Language Result Execution time Memory
528621 2022-02-20T21:21:26 Z DanerZein Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 16780 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MAX_N=2e5+10;
const int MAX_P=MAX_N*4;
int st[MAX_P];
int val[MAX_N];
int dis[MAX_N];
int n;
vector<vi> G;
void init(int node,int a,int b){
  if(a==b){
    st[node]=val[a];
    return;
  }
  int mid=(a+b)/2,le=2*node+1,ri=2*node+2;
  init(le,a,mid);
  init(ri,mid+1,b);
  st[node]=max(st[le],st[ri]);
}
int query(int node,int a,int b,int l,int r){
  if(b<l || a>r) return 0;
  if(l<=a && r>=b) return st[node];
  int mid=(a+b)/2,le=2*node+1,ri=2*node+2;
  return max(query(le,a,mid,l,r),query(ri,mid+1,b,l,r));
}
int izquier(int x){
  int q=query(0,0,n-1,0,x);
  if(q==val[x]) return -1;
  int l=0,r=x;
  while(r-l>1){
    int mid=(l+r)/2;
    q=query(0,0,n-1,mid,r);
    if(q>val[x])
      l=mid;
    else r=mid;
  }
  return l;
}
int derecha(int x){
  int q=query(0,0,n-1,x,n-1);
  if(q==val[x]) return -1;
  int l=x,r=n-1;
  while(r-l>1){
    int mid=(l+r)/2;
    q=query(0,0,n-1,l,mid);
    if(q>val[x]) r=mid;
    else l=mid;
  }
  return r;
}
int ans[2010][2010];
bool iq[MAX_N];
void bfs(int A,int B){
  for(int i=0;i<n;i++) {
    dis[i]=1e9;
    iq[i]=0;
  }
  queue<int> q;
  for(int i=A;i<=B;i++){
    dis[i]=0;
    iq[i]=1;
    q.push(i);
  }
  while(!q.empty()){
    int x=q.front();
    iq[x]=0;
    q.pop();
    for(auto &v:G[x]){
      if(dis[v]>dis[x]+1){
	dis[v]=dis[x]+1;
	if(!iq[v]){
	  q.push(v);
	  iq[v]=1;
	}
      }
    }
  }
}
void init(int N, std::vector<int> H) {
  for(int i=0;i<N;i++) val[i]=H[i];
  G.resize(N+1);
  n=N;
  init(0,0,n-1);
  for(int i=0;i<n;i++){
    int l=izquier(i);
    int r=derecha(i);
    if(l!=-1) G[i].push_back(l);
    if(r!=-1) G[i].push_back(r);
  }
}
int minimum_jumps(int A, int B, int C, int D) {
  bfs(A,B);
  int res=1e9;
  for(int j=C;j<=D;j++){
    res=min(res,dis[j]);
  }
  if(res>=1e9) res=-1;
  return res;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Execution timed out 4040 ms 13792 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 954 ms 13548 KB Output is correct
6 Correct 1216 ms 16120 KB Output is correct
7 Correct 557 ms 8208 KB Output is correct
8 Correct 1219 ms 16652 KB Output is correct
9 Correct 134 ms 2692 KB Output is correct
10 Correct 1243 ms 16080 KB Output is correct
11 Correct 636 ms 16364 KB Output is correct
12 Correct 998 ms 16320 KB Output is correct
13 Correct 837 ms 16356 KB Output is correct
14 Correct 1220 ms 16048 KB Output is correct
15 Correct 1211 ms 16256 KB Output is correct
16 Correct 1170 ms 16636 KB Output is correct
17 Correct 1176 ms 16632 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 328 KB Output is correct
27 Correct 6 ms 468 KB Output is correct
28 Correct 5 ms 472 KB Output is correct
29 Correct 6 ms 456 KB Output is correct
30 Correct 6 ms 424 KB Output is correct
31 Correct 5 ms 456 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 1236 ms 15924 KB Output is correct
34 Correct 1216 ms 16276 KB Output is correct
35 Correct 787 ms 16444 KB Output is correct
36 Correct 1216 ms 15884 KB Output is correct
37 Correct 1222 ms 16200 KB Output is correct
38 Correct 757 ms 16780 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 644 ms 9224 KB Output is correct
41 Correct 1218 ms 15796 KB Output is correct
42 Correct 734 ms 15988 KB Output is correct
43 Correct 1218 ms 15968 KB Output is correct
44 Correct 1209 ms 15800 KB Output is correct
45 Correct 762 ms 15768 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1461 ms 7400 KB Output is correct
5 Execution timed out 4046 ms 15992 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1461 ms 7400 KB Output is correct
5 Execution timed out 4046 ms 15992 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Execution timed out 4040 ms 13792 KB Time limit exceeded
4 Halted 0 ms 0 KB -