| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 448571 | Aryan_Raina | 컴퓨터 네트워크 (BOI14_network) | C++17 | 134 ms | 7928 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 <bits/stdc++.h>
 
using namespace std;
 
void findRoute (int N, int a, int b) {
    int d[N+1];
    for (int i = 1; i <= N; i++) 
        if (b != i) d[i] = ping(b, i);
 
    d[b] = -1;
 
    int cur = a, steps = 1;
    while (cur != b) 
        for (int i = 1; i <= N; i++)
            if (d[i] == d[a] - steps && !ping(cur, i)) 
                travelTo(cur = i), steps++;
}
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... | ||||
