oj.uz

Submission #979160

# Submission time Handle Problem Language Result Execution time Memory
979160 2024-05-10T10:16:16 Z 8pete8 Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 753 ms 38072 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];
void init(int N, std::vector<int> H){
  stack<int>st;
  n=N;
  for(int i=0;i<n;i++)val[i]=H[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);
  }
  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(a!=b||c!=d)return 0;
  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;
  //assert(0);
  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 14 ms 35160 KB Output is correct
2 Correct 4 ms 35308 KB Output is correct
3 Incorrect 71 ms 37424 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 5 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 155 ms 36136 KB Output is correct
5 Correct 662 ms 37056 KB Output is correct
6 Correct 455 ms 35672 KB Output is correct
7 Correct 660 ms 37060 KB Output is correct
8 Correct 378 ms 35928 KB Output is correct
9 Correct 654 ms 37052 KB Output is correct
10 Correct 712 ms 38012 KB Output is correct
11 Correct 708 ms 37968 KB Output is correct
12 Correct 753 ms 37700 KB Output is correct
13 Correct 638 ms 37052 KB Output is correct
14 Correct 644 ms 37536 KB Output is correct
15 Correct 673 ms 37976 KB Output is correct
16 Correct 630 ms 37840 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35160 KB Output is correct
19 Correct 4 ms 35160 KB Output is correct
20 Correct 5 ms 35160 KB Output is correct
21 Correct 5 ms 35300 KB Output is correct
22 Correct 5 ms 35160 KB Output is correct
23 Correct 4 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 13 ms 35160 KB Output is correct
28 Correct 12 ms 35160 KB Output is correct
29 Correct 15 ms 35160 KB Output is correct
30 Correct 11 ms 35160 KB Output is correct
31 Correct 14 ms 35160 KB Output is correct
32 Correct 4 ms 35160 KB Output is correct
33 Correct 20 ms 36240 KB Output is correct
34 Correct 31 ms 37200 KB Output is correct
35 Correct 36 ms 38072 KB Output is correct
36 Correct 28 ms 37080 KB Output is correct
37 Correct 24 ms 37520 KB Output is correct
38 Correct 24 ms 37840 KB Output is correct

Subtask #6
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 155 ms 36136 KB Output is correct
5 Correct 662 ms 37056 KB Output is correct
6 Correct 455 ms 35672 KB Output is correct
7 Correct 660 ms 37060 KB Output is correct
8 Correct 378 ms 35928 KB Output is correct
9 Correct 654 ms 37052 KB Output is correct
10 Correct 712 ms 38012 KB Output is correct
11 Correct 708 ms 37968 KB Output is correct
12 Correct 753 ms 37700 KB Output is correct
13 Correct 638 ms 37052 KB Output is correct
14 Correct 644 ms 37536 KB Output is correct
15 Correct 673 ms 37976 KB Output is correct
16 Correct 630 ms 37840 KB Output is correct
17 Correct 4 ms 35160 KB Output is correct
18 Correct 4 ms 35160 KB Output is correct
19 Correct 4 ms 35160 KB Output is correct
20 Correct 5 ms 35160 KB Output is correct
21 Correct 5 ms 35300 KB Output is correct
22 Correct 5 ms 35160 KB Output is correct
23 Correct 4 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 13 ms 35160 KB Output is correct
28 Correct 12 ms 35160 KB Output is correct
29 Correct 15 ms 35160 KB Output is correct
30 Correct 11 ms 35160 KB Output is correct
31 Correct 14 ms 35160 KB Output is correct
32 Correct 4 ms 35160 KB Output is correct
33 Correct 20 ms 36240 KB Output is correct
34 Correct 31 ms 37200 KB Output is correct
35 Correct 36 ms 38072 KB Output is correct
36 Correct 28 ms 37080 KB Output is correct
37 Correct 24 ms 37520 KB Output is correct
38 Correct 24 ms 37840 KB Output is correct
39 Correct 4 ms 35160 KB Output is correct
40 Correct 4 ms 35300 KB Output is correct
41 Correct 4 ms 35160 KB Output is correct
42 Correct 154 ms 36160 KB Output is correct
43 Correct 621 ms 37068 KB Output is correct
44 Correct 438 ms 35656 KB Output is correct
45 Correct 662 ms 37080 KB Output is correct
46 Correct 409 ms 36044 KB Output is correct
47 Correct 642 ms 37048 KB Output is correct
48 Correct 689 ms 37844 KB Output is correct
49 Correct 656 ms 37836 KB Output is correct
50 Correct 725 ms 37848 KB Output is correct
51 Correct 639 ms 37080 KB Output is correct
52 Correct 714 ms 37556 KB Output is correct
53 Correct 591 ms 37820 KB Output is correct
54 Correct 543 ms 37824 KB Output is correct
55 Correct 4 ms 35160 KB Output is correct
56 Incorrect 58 ms 37072 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 35160 KB Output is correct
2 Correct 4 ms 35308 KB Output is correct
3 Incorrect 71 ms 37424 KB Output isn't correct
4 Halted 0 ms 0 KB -