# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569240 | BadPenalty | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 2 ms | 1236 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int N = 4e4,mod = 1e9+7;
vector<int>adj[N];
int dst[N],vstd[N];
pair<int,int>A[N];
int tile[N];
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
for(int i = 0;i<n;i++)
dst[i] = mod,tile[i]=-1;
int st = 0,en = 0;
for(int i = 0;i<m;i++)
{
cin>>A[i].F>>A[i].S;
tile[A[i].F] = i;
}
priority_queue<pair<int,int>>pq;
pq.push({0,0});
while(!pq.empty())
{
int nd = pq.top().S;
int jumps = -pq.top().F;
int x = A[nd].F;
int p = A[nd].S;
pq.pop();
if(vstd[nd])continue;
vstd[nd] = 1;
if(nd==1)
{
cout<<jumps<<endl;
return 0;
}
int k = 1;
for(int i = x+p;i<n;i+=p)
{
if(tile[i]!=-1)
{
pq.push({-(k+jumps),tile[i]});
}
k++;
}
k = 1;
for(int i = x-p;i>=0;i-=p)
{
if(tile[i]!=-1)
{
pq.push({-(k+jumps),tile[i]});
}
k++;
}
}
return 0;
}
/*
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |