| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339348 | nathlol2 | Computer Network (BOI14_network) | C++20 | 53 ms | 4352 KiB |
#include "network.h"
const int NN = 1e3 + 5;
int dist[NN];
void findRoute (int n, int a, int b){
for(int i = 1;i<=n;i++){
if(i != b) dist[i] = ping(b, i) + 1;
}
int d = dist[a], cur = a;
for(int i = 0;i<d;i++){
for(int j = 1;j<=n;j++){
if(j != cur && i + 1 + dist[j] == d){
//j is adjacent to cur
if(ping(cur, j)) continue;
travelTo(j);
cur = j;
break;
}
}
}
}
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... | ||||
