| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314850 | kantaponz | 컴퓨터 네트워크 (BOI14_network) | C++20 | 52 ms | 4368 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> dist[1005];
void findRoute (int N, int a, int b)
{
int d = ping(a, b);
for (int i = 1; i <= N; i++) {
if (i == a || i == b) continue;
dist[ping(i, a)].emplace_back(i);
}
stack<int> s;
int cur = b;
for (int i = d - 1; i >= 0; i--) {
for (auto x : dist[i]) {
if (ping(x, cur) == 0) {
s.push(x);
cur = x;
break;
}
}
}
while (!s.empty()) {
travelTo(s.top());
s.pop();
}
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... | ||||
