| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 104705 | TAMREF | Computer Network (BOI14_network) | C++11 | 153 ms | 8080 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 dist[1005];
void findRoute (int N, int a, int b)
{
    for(int i = 1; i <= N; i++) if(i != b) dist[i] = ping(i, b);
    dist[b] = -1;
    for(int now = a; now != b;){
        for(int k = 1; k <= N; k++){
            if(dist[k] + 1 == dist[now] && ping(k, now) == 0){
                now = k;
                travelTo(k);
                break;
            }
        }
    }
    return;
}
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... | ||||
