# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448567 | Aryan_Raina | Computer Network (BOI14_network) | C++17 | 109 ms | 7888 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 da[N+1], db[N+1];
for (int i = 1; i <= N; i++)
if (a != i) da[i] = ping(a, i);
for (int i = 1; i <= N; i++)
if (b != i) db[i] = ping(b, i);
da[a] = db[b] = -1;
int cur = a;
while (cur != b)
for (int i = 1; i <= N; i++)
if (da[i] == da[cur]+1 && db[i]+1 == db[cur])
travelTo(cur = i);
}
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... |