oj.uz

Submission #971378

# Submission time Handle Problem Language Result Execution time Memory
971378 2024-04-28T12:30:05 Z AlperenT_ Rainforest Jumps (APIO21_jumps) C++17
8 / 100
 4000 ms 54532 KB 
#include "jumps.h"

#include <vector>
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
const int maxn = 2e5 + 10 , maxq = 32, inf = 1e9+10 , lg = 19  ,sq = 707 ,mod = 998244353 ;
int mx[maxn][lg+1] , c = 1 , L[maxn] , R[maxn], h[maxn] , dis[maxn] , par[maxn][lg+1] , par2[maxn ];
vector< int> G[maxn] ;

void dfs(int v){
  for(int u : G[v]){
    dis[u] = dis[v] + 1; 
    dfs(u) ;
  }
}

void init(int n, vector<int> H) {
  rep(i ,1 ,n){
    h[i] = H[i-1] ;
    mx[i][0] = i ;
  }
  vector <int> vec;;
  rep(i , 1, n){
    while(sz(vec) && h[vec.back()] < h[i])vec.pop_back() ;
    L[i] = -1 ;
    if(sz(vec)!=0)L[i] = vec.back() ;
    vec.pb(i) ;
  }
  vec.clear() ;
  per(i ,n,1){
    while(sz(vec) && h[vec.back()] < h[i])vec.pop_back() ;
    R[i] = -1 ;
    if(sz(vec)!=0)R[i] = vec.back() ;
    vec.pb(i) ;
  }
  int id =0 ;
  rep(i ,1 ,n){
    if(L[i]+R[i] == -2){
      id = i ;
      continue ;
    }
    if(L[i]!=-1 && (R[i] == -1 || h[L[i]] < h[R[i]])){
      G[L[i]].pb(i) ;par2[i] = L[i] ;
      if(R[i] == -1)par[i][0] = L[i] ;
      else par[i][0] = R[i] ;
    }else{
      G[R[i]].pb(i) ;par2[i] = R[i] ;
      if(L[i] == -1)par[i][0] = R[i] ;
      else par[i][0] = L[i] ;
    }
  }
  dfs(id) ;
  rep(i ,1 ,n){
    rep(j , 1 ,lg){
      par[i][j] = par[par[i][j-1]][j-1];
    }
  }
}

int answer(int a, int b){
  if(L[b] >= a)return inf ;
  int ans =0 ;
  /*
  per(i , lg , 0){
    if(par[a][i] != 0 && dis[par[a][i]] >= dis[b]){
      a = par[a][i] ;
      ans += (1<<i);
    }
  }
  */
  while(a!=b && h[par[a][0]] <= h[b]){
    ans ++ ;
    a= par[a][0] ;
  }
  while(a != b){
    ans ++ ;
    a = par2[a] ;
  }
  return ans;
}

int minimum_jumps(int A, int B, int C, int D) {
  A++;B++;C++;D++;
  int ans = inf ;
  rep(i , A ,B){
    rep(j, C , D){
      ans = min(ans , answer(i , j)) ;
    }
  }
  return (ans == inf ? -1 : ans)  ;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10840 KB Output is correct
2 Correct 2 ms 11000 KB Output is correct
3 Execution timed out 4024 ms 46612 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 2 ms 10852 KB Output is correct
8 Correct 3 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 3 ms 10840 KB Output is correct
11 Correct 45 ms 10840 KB Output is correct
12 Correct 24 ms 10840 KB Output is correct
13 Correct 10 ms 10840 KB Output is correct
14 Correct 3 ms 10840 KB Output is correct
15 Correct 11 ms 10840 KB Output is correct
16 Correct 6 ms 10840 KB Output is correct
17 Correct 3 ms 10852 KB Output is correct
18 Correct 2 ms 10840 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 3 ms 10840 KB Output is correct
21 Correct 4 ms 10848 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 4 ms 10840 KB Output is correct
24 Correct 3 ms 10848 KB Output is correct
25 Correct 2 ms 10840 KB Output is correct
26 Correct 2 ms 10840 KB Output is correct
27 Correct 2 ms 10840 KB Output is correct
28 Correct 3 ms 10840 KB Output is correct
29 Correct 3 ms 11092 KB Output is correct
30 Correct 3 ms 10840 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 3 ms 10840 KB Output is correct
33 Correct 2 ms 10840 KB Output is correct
34 Correct 2 ms 10840 KB Output is correct
35 Correct 2 ms 10840 KB Output is correct
36 Correct 2 ms 10840 KB Output is correct
37 Correct 2 ms 10840 KB Output is correct
38 Correct 3 ms 10840 KB Output is correct
39 Correct 2 ms 10840 KB Output is correct
40 Correct 2 ms 10836 KB Output is correct
41 Correct 2 ms 10840 KB Output is correct
42 Correct 2 ms 10840 KB Output is correct
43 Correct 2 ms 10840 KB Output is correct
44 Correct 3 ms 10840 KB Output is correct
45 Correct 3 ms 10840 KB Output is correct
46 Correct 3 ms 10840 KB Output is correct
47 Correct 3 ms 10840 KB Output is correct
48 Correct 2 ms 10840 KB Output is correct
49 Correct 4 ms 10840 KB Output is correct
50 Correct 46 ms 10840 KB Output is correct
51 Correct 24 ms 10840 KB Output is correct
52 Correct 9 ms 10840 KB Output is correct
53 Correct 3 ms 11092 KB Output is correct
54 Correct 11 ms 10840 KB Output is correct
55 Correct 6 ms 10840 KB Output is correct
56 Correct 4 ms 10840 KB Output is correct
57 Correct 2 ms 10840 KB Output is correct
58 Correct 102 ms 10840 KB Output is correct
59 Correct 165 ms 10840 KB Output is correct
60 Correct 11 ms 10840 KB Output is correct
61 Correct 178 ms 10840 KB Output is correct
62 Correct 8 ms 10840 KB Output is correct
63 Correct 173 ms 10840 KB Output is correct
64 Execution timed out 4086 ms 11092 KB Time limit exceeded
65 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 303 ms 39900 KB Output is correct
6 Execution timed out 4026 ms 45868 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 146 ms 29792 KB Output is correct
5 Correct 608 ms 46092 KB Output is correct
6 Correct 364 ms 15872 KB Output is correct
7 Correct 573 ms 45944 KB Output is correct
8 Correct 310 ms 24920 KB Output is correct
9 Correct 619 ms 45936 KB Output is correct
10 Execution timed out 4051 ms 54532 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 146 ms 29792 KB Output is correct
5 Correct 608 ms 46092 KB Output is correct
6 Correct 364 ms 15872 KB Output is correct
7 Correct 573 ms 45944 KB Output is correct
8 Correct 310 ms 24920 KB Output is correct
9 Correct 619 ms 45936 KB Output is correct
10 Execution timed out 4051 ms 54532 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10840 KB Output is correct
2 Correct 2 ms 11000 KB Output is correct
3 Execution timed out 4024 ms 46612 KB Time limit exceeded
4 Halted 0 ms 0 KB -