# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218276 | dolphingarlic | Computer Network (BOI14_network) | C++14 | 136 ms | 8068 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "network.h"
#include <vector>
int dist[1001];
std::vector<int> from_b[1001];
void findRoute(int N, int a, int b) {
for (int i = 1; i <= N; i++) {
if (i == b) continue;
dist[i] = ping(i, b);
from_b[dist[i]].push_back(i);
}
for (int i = dist[a]; i; i--) {
for (int j : from_b[i - 1]) if (!ping(a, j)) {
travelTo(j);
a = j;
break;
}
}
travelTo(b);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |