oj.uz

Submission #971386

# Submission time Handle Problem Language Result Execution time Memory
971386 2024-04-28T12:40:44 Z AlperenT_ Rainforest Jumps (APIO21_jumps) C++17
31 / 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(j , 1 ,lg){
    rep(i ,1 ,n){
      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 && h[par[a][i]] <= h[b]){
      a = par[a][i] ;
      ans += (1<<i);
    }
  }
  ans += dis[a]-dis[b] ;
  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 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Execution timed out 4034 ms 46992 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 2 ms 10840 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 3 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 2 ms 10840 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 7 ms 10840 KB Output is correct
12 Correct 6 ms 10840 KB Output is correct
13 Correct 4 ms 10840 KB Output is correct
14 Correct 4 ms 10840 KB Output is correct
15 Correct 5 ms 10840 KB Output is correct
16 Correct 4 ms 10840 KB Output is correct
17 Correct 3 ms 10840 KB Output is correct
18 Correct 2 ms 10840 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 4 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 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 10872 KB Output is correct
29 Correct 3 ms 10840 KB Output is correct
30 Correct 2 ms 10840 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 2 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 10848 KB Output is correct
38 Correct 2 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 2 ms 10840 KB Output is correct
4 Correct 2 ms 10840 KB Output is correct
5 Correct 3 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 2 ms 10840 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 7 ms 10840 KB Output is correct
12 Correct 6 ms 10840 KB Output is correct
13 Correct 4 ms 10840 KB Output is correct
14 Correct 4 ms 10840 KB Output is correct
15 Correct 5 ms 10840 KB Output is correct
16 Correct 4 ms 10840 KB Output is correct
17 Correct 3 ms 10840 KB Output is correct
18 Correct 2 ms 10840 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 4 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 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 10872 KB Output is correct
29 Correct 3 ms 10840 KB Output is correct
30 Correct 2 ms 10840 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 2 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 10848 KB Output is correct
38 Correct 2 ms 10840 KB Output is correct
39 Correct 2 ms 10840 KB Output is correct
40 Correct 2 ms 10840 KB Output is correct
41 Correct 2 ms 10840 KB Output is correct
42 Correct 2 ms 10840 KB Output is correct
43 Correct 3 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 7 ms 10840 KB Output is correct
51 Correct 6 ms 10840 KB Output is correct
52 Correct 4 ms 10840 KB Output is correct
53 Correct 3 ms 10840 KB Output is correct
54 Correct 6 ms 10840 KB Output is correct
55 Correct 4 ms 10840 KB Output is correct
56 Correct 3 ms 10840 KB Output is correct
57 Correct 2 ms 10840 KB Output is correct
58 Correct 99 ms 10840 KB Output is correct
59 Correct 179 ms 10840 KB Output is correct
60 Correct 12 ms 10840 KB Output is correct
61 Correct 176 ms 10840 KB Output is correct
62 Correct 9 ms 10840 KB Output is correct
63 Correct 190 ms 10840 KB Output is correct
64 Execution timed out 4025 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 304 ms 39920 KB Output is correct
6 Execution timed out 4035 ms 45984 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
23.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 10868 KB Output is correct
4 Correct 128 ms 29924 KB Output is correct
5 Correct 582 ms 45960 KB Output is correct
6 Correct 410 ms 15872 KB Output is correct
7 Correct 611 ms 46196 KB Output is correct
8 Correct 393 ms 24972 KB Output is correct
9 Correct 638 ms 45948 KB Output is correct
10 Correct 644 ms 54512 KB Output is correct
11 Correct 585 ms 54016 KB Output is correct
12 Correct 715 ms 53500 KB Output is correct
13 Correct 617 ms 46160 KB Output is correct
14 Correct 628 ms 54024 KB Output is correct
15 Correct 571 ms 54520 KB Output is correct
16 Correct 576 ms 54532 KB Output is correct
17 Correct 2 ms 10836 KB Output is correct
18 Correct 2 ms 10840 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 KB Output is correct
25 Correct 3 ms 10840 KB Output is correct
26 Correct 2 ms 10840 KB Output is correct
27 Correct 10 ms 10840 KB Output is correct
28 Correct 13 ms 10840 KB Output is correct
29 Correct 9 ms 10840 KB Output is correct
30 Correct 10 ms 10840 KB Output is correct
31 Correct 10 ms 10840 KB Output is correct
32 Correct 2 ms 10840 KB Output is correct
33 Correct 27 ms 34620 KB Output is correct
34 Correct 53 ms 45956 KB Output is correct
35 Correct 47 ms 53360 KB Output is correct
36 Correct 55 ms 46284 KB Output is correct
37 Correct 51 ms 53988 KB Output is correct
38 Correct 53 ms 54520 KB Output is correct

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 10868 KB Output is correct
4 Correct 128 ms 29924 KB Output is correct
5 Correct 582 ms 45960 KB Output is correct
6 Correct 410 ms 15872 KB Output is correct
7 Correct 611 ms 46196 KB Output is correct
8 Correct 393 ms 24972 KB Output is correct
9 Correct 638 ms 45948 KB Output is correct
10 Correct 644 ms 54512 KB Output is correct
11 Correct 585 ms 54016 KB Output is correct
12 Correct 715 ms 53500 KB Output is correct
13 Correct 617 ms 46160 KB Output is correct
14 Correct 628 ms 54024 KB Output is correct
15 Correct 571 ms 54520 KB Output is correct
16 Correct 576 ms 54532 KB Output is correct
17 Correct 2 ms 10836 KB Output is correct
18 Correct 2 ms 10840 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 KB Output is correct
25 Correct 3 ms 10840 KB Output is correct
26 Correct 2 ms 10840 KB Output is correct
27 Correct 10 ms 10840 KB Output is correct
28 Correct 13 ms 10840 KB Output is correct
29 Correct 9 ms 10840 KB Output is correct
30 Correct 10 ms 10840 KB Output is correct
31 Correct 10 ms 10840 KB Output is correct
32 Correct 2 ms 10840 KB Output is correct
33 Correct 27 ms 34620 KB Output is correct
34 Correct 53 ms 45956 KB Output is correct
35 Correct 47 ms 53360 KB Output is correct
36 Correct 55 ms 46284 KB Output is correct
37 Correct 51 ms 53988 KB Output is correct
38 Correct 53 ms 54520 KB Output is correct
39 Correct 2 ms 10840 KB Output is correct
40 Correct 2 ms 10840 KB Output is correct
41 Correct 2 ms 10840 KB Output is correct
42 Correct 112 ms 29924 KB Output is correct
43 Correct 630 ms 45996 KB Output is correct
44 Correct 374 ms 15704 KB Output is correct
45 Correct 604 ms 45940 KB Output is correct
46 Correct 318 ms 25176 KB Output is correct
47 Correct 619 ms 45972 KB Output is correct
48 Correct 649 ms 54520 KB Output is correct
49 Correct 643 ms 54016 KB Output is correct
50 Correct 698 ms 53512 KB Output is correct
51 Correct 563 ms 46212 KB Output is correct
52 Correct 664 ms 54020 KB Output is correct
53 Correct 630 ms 54468 KB Output is correct
54 Correct 617 ms 54492 KB Output is correct
55 Correct 2 ms 10840 KB Output is correct
56 Correct 512 ms 45952 KB Output is correct
57 Execution timed out 4083 ms 45964 KB Time limit exceeded
58 Halted 0 ms 0 KB -

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