| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 16036 | hongjun7 | Computer Network (BOI14_network) | C++98 | 142 ms | 5076 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"
int d[2005];
void findRoute(int N, int a, int b) {
int dist = ping(a, b);
for (int i = 1; i <= N; i++) d[i] = 0;
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) {
int v = ping(a, j);
if (v == 0) {
a = j;
travelTo(j);
break;
}
}
}
}
travelTo(b);
}| # | 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... | ||||
