# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104704 | 2019-04-09T01:12:32 Z | TAMREF | Computer Network (BOI14_network) | C++11 | 189 ms | 8056 KB |
#include "network.h" int dist[1005]; void findRoute (int n, int a, int b){ for(int i = 1; i <= n; i++){ if(i == b) continue; dist[i] = ping(i, b); } for(int now = a; now != b;){ for(int k = 1; k <= n; k++){ if(dist[k] + 1 == dist[now] && ping(k, now) == 1){ travelTo(k); now = k; break; } } } return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 124 ms | 8056 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 189 ms | 6672 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 105 ms | 6648 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 105 ms | 6712 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |