| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1328890 | vache_kocharyan | Computer Network (BOI14_network) | C++20 | 56 ms | 4372 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>dst[1005];
void findRoute (int N, int a, int b)
{
for (int i = 1; i <= N; i++)
{
if (i == b)continue;
int d = ping(i, b);
dst[d].push_back(i);
}
int cur = ping(a, b);
while (cur > 0)
{
for (auto i : dst[cur - 1])
{
if (ping(a, i) == 0)
{
travelTo(i);
cur--;
a = i;
break;
}
}
}
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... | ||||
