# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866851 | 1075508020060209tc | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1 ms | 1368 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;
#define int long long
int n;int m;
long long dis[30100];
vector<int>e[30100];
int vis[30100];
int ar[30100];
int br[30100];
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>ar[i]>>br[i];
e[ar[i]].push_back(br[i]);
}
for(int i=1;i<n;i++){
dis[i]=2000000000;
}
for(int ttt=1;ttt<=n;ttt++){
int nw=n;
for(int i=0;i<n;i++){
if(vis[i]){continue;}
if(nw==n||dis[i]<dis[nw]){
nw=i;
}
}
if(nw==n){break;}
if(dis[nw]>1000000000){break;}
vis[nw]=1;
for(int i=0;i<e[nw].size();i++){
int d=e[nw][i];
for(int t=1;nw+t*d<n;t++){
int v=nw+t*d;
dis[v]=min(dis[v],dis[nw]+t);
}
for(int t=1;nw-t*d>=0;t++){
int v=nw-t*d;
dis[v]=min(dis[v],dis[nw]+t);
}
}
}
if(dis[ar[1]]>1000000000){
cout<<-1<<endl;
return 0;
}
cout<<dis[ar[1]]<<endl;
}
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... |