Submission #5974

#TimeUsernameProblemLanguageResultExecution timeMemory
5974baneling100Computer Network (BOI14_network)C++98
25 / 100
116 ms5076 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...