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 <cstdio>
int n,m;
int link[1005][1005];
int main()
{
for(int i=0;i<1000;i++)
for(int j=0;j<1000;j++)
link[i][j]=-1;
scanf("%d %d",&n,&m);
for(int i=0,a,b;i<m;i++){
scanf("%d %d",&a,&b);
a--;b--;
link[a][b]=1;
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
if(link[i][k]==-1)continue;
for(int j=0;j<n;j++){
if(link[k][j]==-1)continue;
if(link[i][j]>link[i][k]+link[k][j]||link[i][j]==-1)
link[i][j]=link[i][k]+link[k][j];
}
}
}
printf("%d",link[0][n-1]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |