| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1328380 | vahagng | Computer Network (BOI14_network) | C++20 | 50 ms | 4356 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
void findRoute(int N, int a, int b)
{
int d = ping(a, b);
vector<pair<int, int>>v;
for(int i = 1; i <= N; i++){
if (i == a || i == b) continue;
int d1 = ping(a, i);
int d2 = ping(i, b);
if (d1 + d2 == d - 1) {
v.push_back({ d1, i });
}
}
if (v.empty()) {
travelTo(b);
return;
}
sort(v.begin(), v.end());
int c = 0;
for (auto [dd, node] : v) {
if (dd == c) {
if (ping(a, node) == 0) {
c++;
a = node;
travelTo(a);
}
}
}
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... | ||||
