| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1327658 | aren_dance | Computer Network (BOI14_network) | C++20 | 50 ms | 4232 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,a});
}
}
sort(u.begin(),u.end());
if(u.empty()){
travelTo(b);
}
travelTo(u[0].second);
vector<int> g(1e9);
int cnt=1;
int cur=u[0].second;
for(int i=1;i<int(u.size());++i){
if(u[i].first<cnt){
continue;
}
if(u[i].first==cnt){
if(ping(cur,u[i].second)==0){
cur=u[i].second;
travelTo(cur);
cnt++;
}
}
}
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... | ||||
