# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73661 | Vardanyan | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 3 ms | 868 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 = 10007;
vector<pair<pair<int,int>,int> > g[N];
int B[N],P[N];
int dist[N][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);
B[i] = b;
P[i] = p;
int bb = b;
int c = 1;
while(bb+p<n){
bb+=p;
g[b].push_back({{bb,p},c});
c++;
}
bb = b;
c = 1;
while(bb-p>=0){
bb-=p;
g[b].push_back({{bb,p},c});
c++;
}
}
priority_queue<pair<int,pair<int,int> > > pq;
for(int i = 1;i<=n;i++)
for(int j = 1;j<=n;j++)
dist[i][j] = 1000*1000*1000+7;
for(int i = 0;i<m;i++){
if(B[i] == 0){
dist[0][P[i]] = 0;
pq.push({0,{B[i],P[i]}});
}
}
int ans = -1;
while(!pq.empty()){
pair<int,pair<int,int> > v = pq.top();
pq.pop();
int gag = v.second.first;
for(int i = 0;i<g[gag].size();i++){
int to = g[gag][i].first.first;
int d = g[gag][i].second;
if(d+(-v.first)<dist[to][g[gag][i].first.second]){
dist[to][g[gag][i].first.second] = d+(-v.first);
pq.push({-dist[to][g[gag][i].first.second],{to,g[gag][i].first.second}});
if(to == 1 && (ans == -1 || ans>dist[to][g[gag][i].first.second])) ans = dist[to][g[gag][i].first.second];
}
}
}
cout<<ans<<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... |