# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73641 | Vardanyan | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 5 ms | 1328 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.
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 30007;
vector<pair<int,int> > g[N];
int B[N],P[N];
int dist[N];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0;i<m;i++){
int b,p;
scanf("%d%d",&b,&p);
int bb = b;
int c = 1;
while(bb+p<n){
bb+=p;
g[b].push_back({bb,c});
c++;
}
bb = b;
c = 1;
while(bb-p>=0){
bb-=p;
g[b].push_back({bb,c});
c++;
}
}
priority_queue<pair<int,int> > pq;
dist[0] = 0;
for(int i = 1;i<=n;i++) dist[i] = 1000*1000*1000+7;
pq.push({0,0});
while(!pq.empty()){
pair<int,int> v = pq.top();
pq.pop();
int gag = v.second;
for(int i = 0;i<g[gag].size();i++){
int to = g[gag][i].first;
int d = g[gag][i].second;
if(d+(-v.first)<dist[to]){
dist[to] = d+(-v.first);
pq.push({-dist[to],to});
}
}
}
cout<<dist[1]<<endl;
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... |