| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1327687 | aren_dance | 컴퓨터 네트워크 (BOI14_network) | C++20 | 49 ms | 4340 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>> u;
for(int i=1;i<=n;++i){
if(i==a)
continue;
if(i==b)
continue;
int x=ping(a,i);
int y=ping(b,i);
if(x+y==d-1){
u.push_back({x,i});
}
}
sort(u.begin(),u.end());
for(int i=0;i<int(u.size());++i){
int cur;
cur=u[i].second;
travelTo(cur);
}
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... | ||||
