Submission #1227741

#TimeUsernameProblemLanguageResultExecution timeMemory
1227741abdelhakimRainforest Jumps (APIO21_jumps)C++20
4 / 100
279 ms9748 KiB
#include "jumps.h" #include <bits/stdc++.h> #define ll long long #define inf (ll)(1e15) #define dbg(x) cerr <<#x << ' ' << x <<endl; using namespace std; ll n; vector<ll> h; vector<pair<ll,ll>> mn; vector<ll> ind; void init(int N, std::vector<int> H) { n=N; for (int i=0;i<n;i++) h.push_back(H[i]); mn.resize(n+1); stack<ll> s; for (int i=0;i<n;i++) { while(s.size() && (s.top() < h[i])) { s.pop(); } if(s.size()) { mn[h[i]].first=s.top(); } s.push(h[i]); } while(s.size())s.pop(); for (int i=n-1;i>=0;i--) { while(s.size() && (s.top() < h[i])) { s.pop(); } if(s.size()) { mn[h[i]].second=s.top(); } s.push(h[i]); } // for (int i=1;i<=n;i++){ // cout <<"here "<< i << ' ' << mn[i].first << ' ' << mn[i].second << endl; // } ind.resize(n+1); for (int i=0;i<n;i++) { ind[h[i]]=i; } } int minimum_jumps(int A, int B, int C, int D) { return C-B; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...