oj.uz

Submission #971423

# Submission time Handle Problem Language Result Execution time Memory
971423 2024-04-28T13:27:37 Z AlperenT_ Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 784 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] ;
int ch(int l , int r){
  int x = 31 - __builtin_clz(r-l+1) ; 
  return (h[mx[l][x]] > h[mx[r-(1<<x)+1][x]] ? mx[l][x] : mx[r-(1<<x)+1][x]) ;
}
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];
      if(i+(1<<(j-1))>n){
        mx[i][j] = mx[i][j-1] ;
      }else{
        mx[i][j] = (h[mx[i][j-1]] > h[mx[i+(1<<(j-1))][j-1]] ? mx[i][j-1] : mx[i+(1<<(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 id = ch(C , D) ;
  A = max(A,  max(0,L[id])+1) ;
  if(B < A)return -1 ;
  int id2 = ch(A, B);
  int ans = answer(id2 , id) ;
  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 Incorrect 124 ms 46680 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 Incorrect 2 ms 10840 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 Incorrect 2 ms 10840 KB Output isn't correct
6 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 10848 KB Output is correct
5 Correct 59 ms 39916 KB Output is correct
6 Correct 78 ms 45884 KB Output is correct
7 Correct 35 ms 30120 KB Output is correct
8 Correct 75 ms 46200 KB Output is correct
9 Correct 9 ms 15848 KB Output is correct
10 Correct 71 ms 45936 KB Output is correct
11 Incorrect 79 ms 54356 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10836 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 154 ms 29920 KB Output is correct
5 Correct 691 ms 46160 KB Output is correct
6 Correct 402 ms 15872 KB Output is correct
7 Correct 651 ms 45952 KB Output is correct
8 Correct 340 ms 25228 KB Output is correct
9 Correct 621 ms 46080 KB Output is correct
10 Correct 738 ms 54392 KB Output is correct
11 Correct 698 ms 53960 KB Output is correct
12 Correct 784 ms 53496 KB Output is correct
13 Correct 622 ms 46208 KB Output is correct
14 Correct 760 ms 53968 KB Output is correct
15 Correct 598 ms 54364 KB Output is correct
16 Correct 625 ms 54532 KB Output is correct
17 Correct 2 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 3 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 3 ms 10840 KB Output is correct
27 Correct 12 ms 10840 KB Output is correct
28 Correct 15 ms 10840 KB Output is correct
29 Correct 11 ms 10840 KB Output is correct
30 Correct 9 ms 10840 KB Output is correct
31 Correct 11 ms 10840 KB Output is correct
32 Correct 2 ms 10840 KB Output is correct
33 Correct 39 ms 34724 KB Output is correct
34 Correct 74 ms 46004 KB Output is correct
35 Correct 78 ms 53496 KB Output is correct
36 Correct 73 ms 46292 KB Output is correct
37 Correct 75 ms 53992 KB Output is correct
38 Correct 69 ms 54524 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10836 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 154 ms 29920 KB Output is correct
5 Correct 691 ms 46160 KB Output is correct
6 Correct 402 ms 15872 KB Output is correct
7 Correct 651 ms 45952 KB Output is correct
8 Correct 340 ms 25228 KB Output is correct
9 Correct 621 ms 46080 KB Output is correct
10 Correct 738 ms 54392 KB Output is correct
11 Correct 698 ms 53960 KB Output is correct
12 Correct 784 ms 53496 KB Output is correct
13 Correct 622 ms 46208 KB Output is correct
14 Correct 760 ms 53968 KB Output is correct
15 Correct 598 ms 54364 KB Output is correct
16 Correct 625 ms 54532 KB Output is correct
17 Correct 2 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 3 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 3 ms 10840 KB Output is correct
27 Correct 12 ms 10840 KB Output is correct
28 Correct 15 ms 10840 KB Output is correct
29 Correct 11 ms 10840 KB Output is correct
30 Correct 9 ms 10840 KB Output is correct
31 Correct 11 ms 10840 KB Output is correct
32 Correct 2 ms 10840 KB Output is correct
33 Correct 39 ms 34724 KB Output is correct
34 Correct 74 ms 46004 KB Output is correct
35 Correct 78 ms 53496 KB Output is correct
36 Correct 73 ms 46292 KB Output is correct
37 Correct 75 ms 53992 KB Output is correct
38 Correct 69 ms 54524 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 151 ms 29880 KB Output is correct
43 Correct 647 ms 46212 KB Output is correct
44 Correct 422 ms 15704 KB Output is correct
45 Correct 682 ms 46112 KB Output is correct
46 Correct 366 ms 24972 KB Output is correct
47 Correct 657 ms 46192 KB Output is correct
48 Correct 759 ms 54528 KB Output is correct
49 Correct 691 ms 54024 KB Output is correct
50 Correct 707 ms 53596 KB Output is correct
51 Correct 601 ms 46224 KB Output is correct
52 Correct 739 ms 53984 KB Output is correct
53 Correct 598 ms 54532 KB Output is correct
54 Correct 612 ms 54524 KB Output is correct
55 Correct 2 ms 10840 KB Output is correct
56 Correct 113 ms 45892 KB Output is correct
57 Correct 672 ms 45948 KB Output is correct
58 Correct 306 ms 18200 KB Output is correct
59 Correct 649 ms 45892 KB Output is correct
60 Correct 247 ms 25032 KB Output is correct
61 Correct 593 ms 45984 KB Output is correct
62 Correct 731 ms 54504 KB Output is correct
63 Correct 689 ms 52728 KB Output is correct
64 Correct 676 ms 52196 KB Output is correct
65 Correct 587 ms 46272 KB Output is correct
66 Correct 727 ms 54124 KB Output is correct
67 Correct 636 ms 54384 KB Output is correct
68 Correct 642 ms 54308 KB Output is correct
69 Correct 2 ms 10860 KB Output is correct
70 Correct 2 ms 10840 KB Output is correct
71 Correct 3 ms 10840 KB Output is correct
72 Correct 3 ms 10840 KB Output is correct
73 Correct 3 ms 10840 KB Output is correct
74 Correct 3 ms 10840 KB Output is correct
75 Correct 3 ms 10840 KB Output is correct
76 Correct 2 ms 10840 KB Output is correct
77 Correct 2 ms 10840 KB Output is correct
78 Correct 2 ms 10840 KB Output is correct
79 Correct 4 ms 10840 KB Output is correct
80 Correct 3 ms 10840 KB Output is correct
81 Correct 3 ms 10840 KB Output is correct
82 Correct 3 ms 10840 KB Output is correct
83 Correct 3 ms 10836 KB Output is correct
84 Correct 2 ms 10840 KB Output is correct
85 Correct 3 ms 10840 KB Output is correct
86 Correct 11 ms 10840 KB Output is correct
87 Correct 10 ms 10840 KB Output is correct
88 Correct 14 ms 10840 KB Output is correct
89 Correct 13 ms 10848 KB Output is correct
90 Correct 10 ms 10840 KB Output is correct
91 Correct 2 ms 10840 KB Output is correct
92 Correct 2 ms 10840 KB Output is correct
93 Correct 11 ms 10848 KB Output is correct
94 Correct 11 ms 10840 KB Output is correct
95 Correct 9 ms 10840 KB Output is correct
96 Correct 11 ms 10840 KB Output is correct
97 Correct 11 ms 10840 KB Output is correct
98 Correct 2 ms 10840 KB Output is correct
99 Correct 77 ms 45956 KB Output is correct
100 Correct 84 ms 45956 KB Output is correct
101 Correct 69 ms 52992 KB Output is correct
102 Correct 72 ms 46208 KB Output is correct
103 Correct 77 ms 54092 KB Output is correct
104 Correct 73 ms 54376 KB Output is correct
105 Correct 2 ms 10840 KB Output is correct
106 Correct 40 ms 34624 KB Output is correct
107 Correct 73 ms 45960 KB Output is correct
108 Correct 73 ms 53488 KB Output is correct
109 Correct 73 ms 46452 KB Output is correct
110 Correct 85 ms 54032 KB Output is correct
111 Correct 67 ms 54528 KB Output is correct

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 Incorrect 124 ms 46680 KB Output isn't correct
4 Halted 0 ms 0 KB -