# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574116 | 2022-06-07T21:54:30 Z | imsifile | Computer Network (BOI14_network) | C | 0 ms | 0 KB |
#include "network.h" int dd[1010]; int ping(int, int); void travelTo(int); void findRoute(int N, int a, int b) { for (int i = 1; i <= N; i++) dd[i] = i != b ? ping(i, b) : 0; int pv = a; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (dd[pv] != dd[j] + 1) continue; if (ping(pv, j) == 1) { travelTo(j); pv = j; break; } } if (pv == b) break; } }