Submission #16035

#TimeUsernameProblemLanguageResultExecution timeMemory
16035hongjun7Computer Network (BOI14_network)C++98
0 / 100
122 ms5076 KiB
#include "network.h" int d[2005]; void findRoute(int N, int a, int b) { int dist = ping(a, b); for (int i = 1; i <= N; i++) if (i != a) d[i] = ping(a, i) + 1; for (int i = 1; i <= dist; ++i) { for (int j = 1; j <= N; j++) { if (d[j] - d[a] == 1) { if (ping(a, j) == 0) { a = j; travelTo(j); break; } } } } travelTo(b); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...