# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445366 | 2021-07-17T16:59:13 Z | wind_reaper | Computer Network (BOI14_network) | C++17 | 99 ms | 4196 KB |
#include <bits/stdc++.h> #include "network.h" using namespace std; int _ping(int u, int v){ return (u == v ? -1 : ping(u, v)); } void findRoute(int N, int u, int v){ int dist[N + 1]; for(int i = 1; i <= N; i++) dist[i] = _ping(v, i); int cur = u; for(int i = dist[u] - 1; i >= 0; --i) for(int j = 1; j <= N; j++){ if(dist[j] == i && ping(cur, j) == 0){ travelTo(j); cur = j; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 99 ms | 4160 KB | Message has not reached its target |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 93 ms | 4192 KB | Route is too long |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 97 ms | 4196 KB | Route is too long |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 94 ms | 4164 KB | Route is too long |
2 | Halted | 0 ms | 0 KB | - |