| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 981309 | Faisal_Saqib | 밀림 점프 (APIO21_jumps) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "jumps.h"
#include <vector>
#include <bits/stdc++.h>
//#include "stub.cpp"
using namespace std;
const int N=2e5+2;
int n;
int dist[N];
vector<int> adj[N];
bool subtask1=0;
void init(int NP, std::vector<int> a) {
subtask1=is_sorted(begin(a),end(a));
n=NP;
set<int> spl;
vector<pair<int,int>> pp;
for(int j=0;j<n;j++)
pp.push_back({h[j],j});
sort(begin(pp),end(pp));
for(int j=n-1;j>=0;j--)
{
auto it = spl.upper_bound(pp[j].second);
// cout<<"For "<<pp[j].second<<" edge with: ";
if(it!=end(spl))
{
// cout<<*it<<' ';
adj[pp[j].second].push_back(*it);
}
if(it!=begin(spl))
{
it--;
// cout<<*it<<' ';
adj[pp[j].second].push_back(*it);
}
// cout<<endl;
spl.insert(pp[j].second);
}
}
int minimum_jumps(int a, int b, int c, int d) {
if(subtask1)
{
return max(0,c-b);
}
for(int j=0;j<=n;j++)
dist[j]=2e9;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
for(int st=a;st<=b;st++)
pq.push({dist[st]=0,st});
while(pq.size())
{
auto it=pq.top();
if(c<=it.second and it.second<=d)
return it.first;
pq.pop();
if(dist[it.second]==it.first)
for(auto dj:adj[it.second])
if(dist[dj]>(dist[it.second]+1))
{
dist[dj]=dist[it.second]+1;
pq.push({dist[dj],dj});
}
}
return -1;
}