| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1328371 | vahagng | Computer Network (BOI14_network) | C++20 | 50 ms | 4252 KiB |
#include "network.h"
#include <bits/stdc++.h>
using namespace std;
void findRoute(int N, int a, int b)
{
set<int>st;
for (int i = 1; i <= N; i++) {
if(i != a && i != b) st.insert(i);
}
while (a != b) {
vector<int>V;
for (auto i : st) {
if (ping(a, i) == 1) {
V.push_back(i);
}
}
int mn = -1, node;
for (auto i : V) {
int d = ping(i, b);
if (mn == -1 || mn > d) {
mn = d;
node = i;
}
}
for(auto i : V){
st.erase(i);
}
st.erase(a);
travelTo(node);
a = node;
}
}
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... | ||||
