oj.uz

Submission #528617

# Submission time Handle Problem Language Result Execution time Memory
528617 2022-02-20T20:50:15 Z DanerZein Rainforest Jumps (APIO21_jumps) C++14
8 / 100
 4000 ms 15852 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;
}
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);
    // cout<<i<<": "<<l<<" "<<r<<endl;
    if(l!=-1) G[i].push_back(l);
    if(r!=-1) G[i].push_back(r);
  }
}
bool iq[MAX_N];
void bfs(int u){
  for(int i=0;i<n;i++) {
    dis[i]=1e9;
    iq[i]=0;
  }
  dis[u]=0;
  iq[u]=1;
  queue<int> q;
  q.push(u);
  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;
	}
      }
    }
  }
}
int minimum_jumps(int A, int B, int C, int D) {
  int res=1e9;
  for(int i=A;i<=B;i++){
    bfs(i);
    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 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Execution timed out 4051 ms 12980 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.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 2 ms 200 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 4 ms 200 KB Output is correct
8 Correct 4 ms 328 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 7 ms 200 KB Output is correct
11 Correct 17 ms 328 KB Output is correct
12 Correct 15 ms 328 KB Output is correct
13 Correct 13 ms 328 KB Output is correct
14 Correct 6 ms 328 KB Output is correct
15 Correct 21 ms 328 KB Output is correct
16 Correct 7 ms 328 KB Output is correct
17 Correct 15 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 20 ms 200 KB Output is correct
22 Correct 8 ms 328 KB Output is correct
23 Correct 20 ms 328 KB Output is correct
24 Correct 15 ms 200 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 3 ms 200 KB Output is correct
29 Correct 3 ms 200 KB Output is correct
30 Correct 2 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 0 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 200 KB Output is correct
39 Correct 1 ms 328 KB Output is correct

Subtask #3
0 / 13.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 2 ms 200 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 4 ms 200 KB Output is correct
8 Correct 4 ms 328 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 7 ms 200 KB Output is correct
11 Correct 17 ms 328 KB Output is correct
12 Correct 15 ms 328 KB Output is correct
13 Correct 13 ms 328 KB Output is correct
14 Correct 6 ms 328 KB Output is correct
15 Correct 21 ms 328 KB Output is correct
16 Correct 7 ms 328 KB Output is correct
17 Correct 15 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 20 ms 200 KB Output is correct
22 Correct 8 ms 328 KB Output is correct
23 Correct 20 ms 328 KB Output is correct
24 Correct 15 ms 200 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 3 ms 200 KB Output is correct
29 Correct 3 ms 200 KB Output is correct
30 Correct 2 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 0 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 200 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 1 ms 200 KB Output is correct
44 Correct 3 ms 200 KB Output is correct
45 Correct 6 ms 328 KB Output is correct
46 Correct 4 ms 200 KB Output is correct
47 Correct 5 ms 328 KB Output is correct
48 Correct 1 ms 200 KB Output is correct
49 Correct 5 ms 328 KB Output is correct
50 Correct 18 ms 200 KB Output is correct
51 Correct 16 ms 348 KB Output is correct
52 Correct 12 ms 220 KB Output is correct
53 Correct 5 ms 328 KB Output is correct
54 Correct 21 ms 328 KB Output is correct
55 Correct 7 ms 200 KB Output is correct
56 Correct 16 ms 200 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 699 ms 416 KB Output is correct
59 Correct 1227 ms 456 KB Output is correct
60 Correct 70 ms 328 KB Output is correct
61 Correct 1264 ms 412 KB Output is correct
62 Correct 32 ms 328 KB Output is correct
63 Correct 1228 ms 456 KB Output is correct
64 Execution timed out 4045 ms 456 KB Time limit exceeded
65 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 Execution timed out 4032 ms 13140 KB Time limit exceeded
6 Halted 0 ms 0 KB -

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 1695 ms 7388 KB Output is correct
5 Execution timed out 4059 ms 15852 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 1695 ms 7388 KB Output is correct
5 Execution timed out 4059 ms 15852 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 Execution timed out 4051 ms 12980 KB Time limit exceeded
4 Halted 0 ms 0 KB -