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 "network.h"
int Ans[1001];
void findRoute (int N, int a, int b)
{
int i, Dist=ping(a,b), x, y;
for(i=1 ; i<=N ; i++)
if(i!=a && i!=b)
{
x=ping(a,i);
y=ping(i,b);
if(Dist==x+y+1)
Ans[x]=i;
}
Ans[Dist]=b;
for(i=0 ; i<=Dist ; i++)
travelTo(Ans[i]);
}
# | 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... |