# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866839 | 1075508020060209tc | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1 ms | 1116 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=1;i<=m;i++){
cin>>ar[i]>>br[i];
ar[i]++;
e[ar[i]].push_back(br[i]);
}
for(int i=2;i<=n;i++){
dis[i]=1e9;
}
for(int ttt=1;ttt<=n*10;ttt++){
int nw=0;
for(int i=1;i<=n;i++){
if(vis[i]){continue;}
if(nw==0||dis[i]<dis[nw]){
nw=i;
}
}
if(nw==0){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;
if(dis[v]>dis[nw]+t){
dis[v]=dis[nw]+t;
}
}
for(int t=1;nw-t*d>=1;t++){
int v=nw-t*d;
if(dis[v]>dis[nw]+t){
dis[v]=dis[nw]+t;
}
}
}
}
if(dis[ar[2]]>=n+1){
cout<<-1;return 0;
}
cout<<dis[ar[2]];
}
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... |