# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154159 | nicolaalexandra | Computer Network (BOI14_network) | C++14 | 124 ms | 8056 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 <iostream>
#include "network.h"
#include <cstring>
using namespace std;
int f[1010],dist_b[1010];
void findRoute (int n, int a, int b){
memset (f,0,sizeof f);
memset (dist_b,0,sizeof dist_b);
for (int i=1;i<=n;i++){
if (i == b)
continue;
dist_b[i] = ping (i,b);
}
int dist = dist_b[a];
int nod = a;
f[a] = 1;
for (;;){
dist--;
if (dist == -1){
travelTo(b);
break;
}
for (int i=1;i<=n;i++){
if (f[i])
continue;
if (dist_b[i] != dist)
continue;
if (ping(nod,i) == 0){
travelTo(i);
nod = i;
f[nod] = 1;
break;
}}}}
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... |