| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 467471 | maeola | Computer Network (BOI14_network) | C++17 | 102 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)
{
    vector<int> Q(69 + N);
    vector<int> W[69 + N];
    for (int i = 1; i <= N; i++) {
        if(i == b) continue;
        Q[i] = ping(b, i);
        W[Q[i]].push_back(i);
    }
    int dist = Q[a] - 1;
    int cur = a;
    while(dist >= 0) {
        int chosen = -1;
        for (int x : W[dist]) {
            if(ping(cur, x) == 0)
                chosen = x;
        }
        travelTo(chosen);
        cur = chosen;
        dist--;
    }
    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... | ||||
