| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314837 | Zone_zonee | Computer Network (BOI14_network) | C++20 | 50 ms | 4268 KiB |
#include <bits/stdc++.h>
#include "network.h"
void findRoute (int N, int a, int b)
{
using namespace std;
int dist = ping(a, b);
priority_queue<pair<int, int>> ans;
for(int i = 1; i <= N; ++i){
if(i == a || i == b) continue;
int da = ping(a, i), db = ping(i, b);
if(da + db + 1 == dist){
ans.push({-da, i});
}
}
while(!ans.empty()){
auto [d, u] = ans.top(); ans.pop();
// cerr << u << '\n';
travelTo(u);
}
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... | ||||
