| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1324416 | hxluk.ka | Computer Network (BOI14_network) | C++20 | 56 ms | 4364 KiB |
#include "network.h"
#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
const int nx=1003;
int d[nx];
void findRoute(int N, int a, int b)
{
for (int i=1; i<=N; i++) if (i!=a) d[i]=ping(i, a)+1;
stack<int> s;
int cur=b;
while (cur!=a) {
s.push(cur);
for (int i=1; i<=N; i++) {
if (d[i]+1==d[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... | ||||
