oj.uz

Submission #979164

# Submission time Handle Problem Language Result Execution time Memory
979164 2024-05-10T10:24:26 Z 8pete8 Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 787 ms 41256 KB 
#include "jumps.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
#include <cstdlib> 
#include <cstdint>
using namespace std;
#define ll long long
#define f first
//#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
//#define int long long
#define double long double
/*
*****
check if function has a return value?
*****
*/
const int mxn=2e5,inf=1e9,minf=-1e9,Mxn=1e7,lg=20;;
#include <vector>
int l[mxn+10],r[mxn+10],n,val[mxn+10],up[lg+1][mxn+10],up2[lg+1][mxn+10];

struct seg{
  pii v[2*mxn+10];
  void build(){for(int i=n-1;i>=0;i--)v[i]=max(v[i*2],v[i*2+1]);}
  pii qry(int l,int r){
    pii ans={minf,0};
    for(l+=n,r+=n;l<=r;l>>=1,r>>=1){
      if(l&1)ans=max(ans,v[l++]);
      if(!(r&1))ans=max(ans,v[r--]);
    }
    return ans;
  }
}t;

void init(int N, std::vector<int> H){
  stack<int>st;
  n=N;
  for(int i=0;i<n;i++)val[i]=H[i],t.v[i+n]={val[i],i};
  for(int i=0;i<n;i++){
    while(!st.empty()&&val[st.top()]<val[i])st.pop();
    if(!st.empty())l[i]=st.top();
    else l[i]=n;
    st.push(i);
  }
  while(!st.empty())st.pop();
  for(int i=n-1;i>=0;i--){
    while(!st.empty()&&val[st.top()]<val[i])st.pop();
    if(!st.empty())r[i]=st.top();
    else r[i]=n;
    st.push(i);
  }
  t.build();
  val[n]=inf;
  for(int i=0;i<n;i++){
    int a=l[i],b=r[i];
    if(val[a]>val[b])swap(a,b);
    up2[0][i]=a;
    up[0][i]=b;
  }
  for(int j=0;j<=lg;j++)up[j][n]=n,up2[j][n]=n;
  for(int j=1;j<=lg;j++)for(int i=0;i<n;i++){
    up[j][i]=up[j-1][up[j-1][i]];
    up2[j][i]=up2[j-1][up2[j-1][i]];
  }
  n=N;
}
int ans=inf;
int minimum_jumps(int a,int b,int c,int d){
  if(c!=d)return 0;
  //c==d -> l[c]+1,r[c]-1 is possible so get max from that range
  if(a!=b){
    int bl=l[c]+1,br=r[c]-1;
    if(l[c]==n)bl=0;
    if(r[c]==n)br=n-1;
    if(b<bl||a>br)return -1;
    bl=max(bl,a),br=min(br,b);
    a=t.qry(bl,br).s;
  }
  int ans=0;
  for(int i=lg;i>=0;i--)if(val[up[i][a]]<val[c])a=up[i][a],ans+=(1LL<<i);
  if(up[0][a]==c)return ans+1;
  for(int i=lg;i>=0;i--)if(val[up2[i][a]]<val[c])a=up2[i][a],ans+=(1LL<<i);
  if(up2[0][a]==c)return ans+1;
  return -1;
}/*
int32_t main(){
  int n,q;cin>>n>>q;
  vector<int>v(n);
  for(int i=0;i<n;i++)cin>>v[i];
  init(n,v);
  while(q--){
    int a,b,c,d;cin>>a>>b>>c>>d;
    cout<<minimum_jumps(a,b,c,d)<<'\n';
  }
}*/
/*
sub (nq)=dijkstra
other{
  is it always better to go the direction with more value???? so bin lift??
  keep 2 binlift?
  first for max 2nd for jumping mn
}
*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Incorrect 72 ms 40360 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 35160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 35160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 35160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Correct 4 ms 35160 KB Output is correct
4 Correct 156 ms 38416 KB Output is correct
5 Correct 632 ms 40132 KB Output is correct
6 Correct 434 ms 37720 KB Output is correct
7 Correct 653 ms 40136 KB Output is correct
8 Correct 382 ms 38232 KB Output is correct
9 Correct 629 ms 40116 KB Output is correct
10 Correct 721 ms 41164 KB Output is correct
11 Correct 690 ms 40908 KB Output is correct
12 Correct 707 ms 40916 KB Output is correct
13 Correct 669 ms 40144 KB Output is correct
14 Correct 700 ms 40748 KB Output is correct
15 Correct 675 ms 41184 KB Output is correct
16 Correct 611 ms 41168 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35300 KB Output is correct
19 Correct 5 ms 35160 KB Output is correct
20 Correct 5 ms 35160 KB Output is correct
21 Correct 5 ms 35160 KB Output is correct
22 Correct 5 ms 35160 KB Output is correct
23 Correct 5 ms 35356 KB Output is correct
24 Correct 5 ms 35160 KB Output is correct
25 Correct 4 ms 35160 KB Output is correct
26 Correct 4 ms 35160 KB Output is correct
27 Correct 15 ms 35332 KB Output is correct
28 Correct 13 ms 35160 KB Output is correct
29 Correct 13 ms 35160 KB Output is correct
30 Correct 14 ms 35160 KB Output is correct
31 Correct 13 ms 35160 KB Output is correct
32 Correct 4 ms 35160 KB Output is correct
33 Correct 20 ms 38824 KB Output is correct
34 Correct 30 ms 40596 KB Output is correct
35 Correct 25 ms 41040 KB Output is correct
36 Correct 30 ms 40272 KB Output is correct
37 Correct 25 ms 40600 KB Output is correct
38 Correct 37 ms 41144 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Correct 4 ms 35160 KB Output is correct
4 Correct 156 ms 38416 KB Output is correct
5 Correct 632 ms 40132 KB Output is correct
6 Correct 434 ms 37720 KB Output is correct
7 Correct 653 ms 40136 KB Output is correct
8 Correct 382 ms 38232 KB Output is correct
9 Correct 629 ms 40116 KB Output is correct
10 Correct 721 ms 41164 KB Output is correct
11 Correct 690 ms 40908 KB Output is correct
12 Correct 707 ms 40916 KB Output is correct
13 Correct 669 ms 40144 KB Output is correct
14 Correct 700 ms 40748 KB Output is correct
15 Correct 675 ms 41184 KB Output is correct
16 Correct 611 ms 41168 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35300 KB Output is correct
19 Correct 5 ms 35160 KB Output is correct
20 Correct 5 ms 35160 KB Output is correct
21 Correct 5 ms 35160 KB Output is correct
22 Correct 5 ms 35160 KB Output is correct
23 Correct 5 ms 35356 KB Output is correct
24 Correct 5 ms 35160 KB Output is correct
25 Correct 4 ms 35160 KB Output is correct
26 Correct 4 ms 35160 KB Output is correct
27 Correct 15 ms 35332 KB Output is correct
28 Correct 13 ms 35160 KB Output is correct
29 Correct 13 ms 35160 KB Output is correct
30 Correct 14 ms 35160 KB Output is correct
31 Correct 13 ms 35160 KB Output is correct
32 Correct 4 ms 35160 KB Output is correct
33 Correct 20 ms 38824 KB Output is correct
34 Correct 30 ms 40596 KB Output is correct
35 Correct 25 ms 41040 KB Output is correct
36 Correct 30 ms 40272 KB Output is correct
37 Correct 25 ms 40600 KB Output is correct
38 Correct 37 ms 41144 KB Output is correct
39 Correct 4 ms 35160 KB Output is correct
40 Correct 4 ms 35324 KB Output is correct
41 Correct 4 ms 35160 KB Output is correct
42 Correct 162 ms 38724 KB Output is correct
43 Correct 611 ms 40116 KB Output is correct
44 Correct 404 ms 37720 KB Output is correct
45 Correct 584 ms 40304 KB Output is correct
46 Correct 371 ms 38356 KB Output is correct
47 Correct 655 ms 40132 KB Output is correct
48 Correct 769 ms 41156 KB Output is correct
49 Correct 682 ms 41256 KB Output is correct
50 Correct 723 ms 40904 KB Output is correct
51 Correct 646 ms 40140 KB Output is correct
52 Correct 711 ms 40604 KB Output is correct
53 Correct 611 ms 41188 KB Output is correct
54 Correct 647 ms 41144 KB Output is correct
55 Correct 4 ms 35160 KB Output is correct
56 Correct 70 ms 40120 KB Output is correct
57 Correct 639 ms 40132 KB Output is correct
58 Correct 264 ms 37940 KB Output is correct
59 Correct 631 ms 40272 KB Output is correct
60 Correct 236 ms 38356 KB Output is correct
61 Correct 616 ms 40368 KB Output is correct
62 Correct 787 ms 41164 KB Output is correct
63 Correct 712 ms 40908 KB Output is correct
64 Correct 687 ms 40656 KB Output is correct
65 Correct 609 ms 40124 KB Output is correct
66 Correct 696 ms 40608 KB Output is correct
67 Correct 578 ms 41040 KB Output is correct
68 Correct 565 ms 41052 KB Output is correct
69 Correct 4 ms 35160 KB Output is correct
70 Correct 4 ms 35160 KB Output is correct
71 Correct 5 ms 35160 KB Output is correct
72 Correct 6 ms 35160 KB Output is correct
73 Correct 6 ms 35160 KB Output is correct
74 Correct 5 ms 35160 KB Output is correct
75 Correct 5 ms 35160 KB Output is correct
76 Correct 4 ms 35160 KB Output is correct
77 Correct 4 ms 35160 KB Output is correct
78 Correct 5 ms 35160 KB Output is correct
79 Correct 5 ms 35160 KB Output is correct
80 Correct 5 ms 35276 KB Output is correct
81 Correct 5 ms 35300 KB Output is correct
82 Correct 5 ms 35160 KB Output is correct
83 Correct 5 ms 35160 KB Output is correct
84 Correct 4 ms 35160 KB Output is correct
85 Correct 5 ms 35336 KB Output is correct
86 Correct 15 ms 35160 KB Output is correct
87 Correct 13 ms 35160 KB Output is correct
88 Correct 13 ms 35160 KB Output is correct
89 Correct 12 ms 35160 KB Output is correct
90 Correct 12 ms 35160 KB Output is correct
91 Correct 4 ms 35252 KB Output is correct
92 Correct 5 ms 35412 KB Output is correct
93 Correct 12 ms 35160 KB Output is correct
94 Correct 12 ms 35160 KB Output is correct
95 Correct 14 ms 35160 KB Output is correct
96 Correct 18 ms 35160 KB Output is correct
97 Correct 14 ms 35160 KB Output is correct
98 Correct 4 ms 35160 KB Output is correct
99 Correct 36 ms 40340 KB Output is correct
100 Correct 31 ms 40144 KB Output is correct
101 Correct 25 ms 40904 KB Output is correct
102 Correct 32 ms 40132 KB Output is correct
103 Correct 35 ms 40608 KB Output is correct
104 Correct 26 ms 41172 KB Output is correct
105 Correct 4 ms 35160 KB Output is correct
106 Correct 19 ms 39208 KB Output is correct
107 Correct 30 ms 40144 KB Output is correct
108 Correct 29 ms 40888 KB Output is correct
109 Correct 34 ms 40128 KB Output is correct
110 Correct 27 ms 40504 KB Output is correct
111 Correct 25 ms 41164 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Incorrect 72 ms 40360 KB Output isn't correct
4 Halted 0 ms 0 KB -