| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365706 | Warinchai | Computer Network (BOI14_network) | C++20 | 37 ms | 4352 KiB |
#include "network.h"
#include<bits/stdc++.h>
using namespace std;
int dis[1005];
vector<int>tot[1005];
void findRoute (int N, int a, int b)
{
for(int i=1;i<=N;i++){
dis[i]=ping(i,N);
tot[dis[i]].push_back(i);
}
int prv=a;
vector<int>ans;
ans.push_back(prv);
for(int i=dis[a]-1;i>=0;i--){
int nxt=0;
for(auto x:tot[i]){
if(ping(prv,x)==1){
prv=x;
break;
}
}
travelTo(prv);
}
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
