# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520872 | knon0501 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1085 ms | 2052 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;
const int INF=1e9;
int dist[30005];
int vis[30005];
vector<int> a[30005];
int n,m;
int main(){
//freopen("input.txt","r",stdin);
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>m;
int t;
int k;
for(int i=0 ; i<m ;i++){
int x,y;
cin>>x>>y;
if(i==0)k=x;
if(i==1)t=x;
a[x].emplace_back(y);
}
for(int i=0 ; i<n ; i++)dist[i]=INF;
dist[k]=0;
for(int i=0 ; i<n ; i++){
int v=-1;
for(int j=0 ; j<n ; j++){
if(vis[j]==0)
if(v==-1 || dist[j]<dist[v])
{
v=j;
}
}
if(dist[v]==INF){
cout<<-1;
return 0;
}
if(v==t){
cout<<dist[v]<<"\n";
return 0;
}
vis[v]=1;
for(auto &x: a[v]){
int cnt=0;
for(int j=v+x; j<n ; j+=x)
dist[j]=min(dist[j],dist[v]+(++cnt));
cnt=0;
for(int j=v-x ; j>=0 ; j-=x)
dist[j]=min(dist[j],dist[v]+(++cnt));
}
}
if(dist[t]==INF)
cout<<-1;
else
cout<<dist[t];
}
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... |