oj.uz

Submission #979168

# Submission time Handle Problem Language Result Execution time Memory
979168 2024-05-10T10:28:05 Z 8pete8 Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 819 ms 41416 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){
  //c==d -> l[c]+1,r[c]-1 is possible so get max from that range
  //c!=d can we just get max c??
  c=t.qry(c,d).s;
  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 10 ms 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Incorrect 87 ms 40232 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 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Correct 5 ms 35412 KB Output is correct
4 Correct 4 ms 35160 KB Output is correct
5 Incorrect 5 ms 35160 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 35160 KB Output is correct
2 Correct 4 ms 35160 KB Output is correct
3 Correct 5 ms 35412 KB Output is correct
4 Correct 4 ms 35160 KB Output is correct
5 Incorrect 5 ms 35160 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 35160 KB Output is correct
2 Correct 5 ms 35160 KB Output is correct
3 Correct 4 ms 35160 KB Output is correct
4 Correct 4 ms 35160 KB Output is correct
5 Correct 29 ms 39732 KB Output is correct
6 Correct 33 ms 40132 KB Output is correct
7 Correct 19 ms 38736 KB Output is correct
8 Correct 37 ms 40136 KB Output is correct
9 Correct 8 ms 37720 KB Output is correct
10 Correct 33 ms 40132 KB Output is correct
11 Incorrect 25 ms 41168 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 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 151 ms 38436 KB Output is correct
5 Correct 603 ms 40136 KB Output is correct
6 Correct 449 ms 37720 KB Output is correct
7 Correct 716 ms 40276 KB Output is correct
8 Correct 368 ms 38356 KB Output is correct
9 Correct 628 ms 40132 KB Output is correct
10 Correct 711 ms 41416 KB Output is correct
11 Correct 761 ms 40916 KB Output is correct
12 Correct 663 ms 40916 KB Output is correct
13 Correct 701 ms 40144 KB Output is correct
14 Correct 696 ms 40600 KB Output is correct
15 Correct 714 ms 41172 KB Output is correct
16 Correct 655 ms 41372 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35160 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 35160 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 14 ms 35324 KB Output is correct
28 Correct 12 ms 35160 KB Output is correct
29 Correct 14 ms 35160 KB Output is correct
30 Correct 13 ms 35412 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 39048 KB Output is correct
34 Correct 30 ms 40144 KB Output is correct
35 Correct 28 ms 41064 KB Output is correct
36 Correct 33 ms 40352 KB Output is correct
37 Correct 24 ms 40484 KB Output is correct
38 Correct 29 ms 41176 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 151 ms 38436 KB Output is correct
5 Correct 603 ms 40136 KB Output is correct
6 Correct 449 ms 37720 KB Output is correct
7 Correct 716 ms 40276 KB Output is correct
8 Correct 368 ms 38356 KB Output is correct
9 Correct 628 ms 40132 KB Output is correct
10 Correct 711 ms 41416 KB Output is correct
11 Correct 761 ms 40916 KB Output is correct
12 Correct 663 ms 40916 KB Output is correct
13 Correct 701 ms 40144 KB Output is correct
14 Correct 696 ms 40600 KB Output is correct
15 Correct 714 ms 41172 KB Output is correct
16 Correct 655 ms 41372 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35160 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 35160 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 14 ms 35324 KB Output is correct
28 Correct 12 ms 35160 KB Output is correct
29 Correct 14 ms 35160 KB Output is correct
30 Correct 13 ms 35412 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 39048 KB Output is correct
34 Correct 30 ms 40144 KB Output is correct
35 Correct 28 ms 41064 KB Output is correct
36 Correct 33 ms 40352 KB Output is correct
37 Correct 24 ms 40484 KB Output is correct
38 Correct 29 ms 41176 KB Output is correct
39 Correct 5 ms 35412 KB Output is correct
40 Correct 4 ms 35160 KB Output is correct
41 Correct 4 ms 35160 KB Output is correct
42 Correct 161 ms 38476 KB Output is correct
43 Correct 595 ms 40140 KB Output is correct
44 Correct 412 ms 37720 KB Output is correct
45 Correct 640 ms 40124 KB Output is correct
46 Correct 367 ms 38232 KB Output is correct
47 Correct 664 ms 40132 KB Output is correct
48 Correct 734 ms 40972 KB Output is correct
49 Correct 749 ms 41080 KB Output is correct
50 Correct 724 ms 41048 KB Output is correct
51 Correct 677 ms 40144 KB Output is correct
52 Correct 677 ms 40476 KB Output is correct
53 Correct 617 ms 41160 KB Output is correct
54 Correct 605 ms 41080 KB Output is correct
55 Correct 5 ms 35160 KB Output is correct
56 Correct 73 ms 40272 KB Output is correct
57 Correct 603 ms 40148 KB Output is correct
58 Correct 319 ms 37976 KB Output is correct
59 Correct 557 ms 40132 KB Output is correct
60 Correct 267 ms 38232 KB Output is correct
61 Correct 599 ms 40120 KB Output is correct
62 Correct 819 ms 41144 KB Output is correct
63 Correct 780 ms 40892 KB Output is correct
64 Correct 652 ms 40656 KB Output is correct
65 Correct 584 ms 40116 KB Output is correct
66 Correct 645 ms 40580 KB Output is correct
67 Correct 542 ms 41184 KB Output is correct
68 Correct 551 ms 41176 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 5 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 5 ms 35160 KB Output is correct
77 Correct 4 ms 35160 KB Output is correct
78 Correct 5 ms 35280 KB Output is correct
79 Correct 5 ms 35160 KB Output is correct
80 Correct 5 ms 35160 KB Output is correct
81 Correct 5 ms 35160 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 6 ms 35260 KB Output is correct
86 Correct 16 ms 35160 KB Output is correct
87 Correct 15 ms 35416 KB Output is correct
88 Correct 14 ms 35160 KB Output is correct
89 Correct 13 ms 35160 KB Output is correct
90 Correct 14 ms 35352 KB Output is correct
91 Correct 4 ms 35160 KB Output is correct
92 Correct 5 ms 35160 KB Output is correct
93 Correct 13 ms 35160 KB Output is correct
94 Correct 14 ms 35160 KB Output is correct
95 Correct 13 ms 35160 KB Output is correct
96 Correct 12 ms 35160 KB Output is correct
97 Correct 15 ms 35340 KB Output is correct
98 Correct 4 ms 35160 KB Output is correct
99 Correct 33 ms 40120 KB Output is correct
100 Correct 31 ms 40280 KB Output is correct
101 Correct 27 ms 40940 KB Output is correct
102 Correct 32 ms 40140 KB Output is correct
103 Correct 29 ms 40860 KB Output is correct
104 Correct 25 ms 41172 KB Output is correct
105 Correct 4 ms 35160 KB Output is correct
106 Correct 19 ms 39044 KB Output is correct
107 Correct 30 ms 40280 KB Output is correct
108 Correct 26 ms 40912 KB Output is correct
109 Correct 35 ms 40304 KB Output is correct
110 Correct 35 ms 40708 KB Output is correct
111 Correct 27 ms 41160 KB Output is correct

Subtask #7
0 / 19.0

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