# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1186393 | 12345678 | Computer Network (BOI14_network) | C++20 | 55 ms | 4224 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e3+5;
int mn[nx];
void findRoute (int N, int a, int b)
{
for (int i=1; i<=N; i++) if (i!=a) mn[i]=ping(a, i)+1;
stack<int> s;
int cur=b;
while (cur!=a)
{
s.push(cur);
for (int i=1; i<=N; i++)
{
if (mn[i]+1==mn[cur]&&ping(cur, i)==0)
{
cur=i;
break;
}
}
}
while (!s.empty()) travelTo(s.top()), s.pop();
}
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... |