| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365738 | Warinchai | Computer Network (BOI14_network) | C++20 | 36 ms | 4380 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)
{
//cerr<<"work\n";
for(int i=1;i<N;i++){
dis[i]=ping(i,N)+1;
tot[dis[i]].push_back(i);
}
//cerr<<"wtf\n";
int prv=a;
vector<int>ans;
/*cerr<<"dis[a]:"<<dis[a]<<"\n";
for(int i=1;i<dis[a];i++){
cerr<<"i:"<<i<<"\n";
for(auto x:tot[i])cerr<<x<<" ";
cerr<<"\n";
}*/
for(int i=dis[a]-1;i>0;i--){
int nxt=0;
for(auto x:tot[i]){
//cerr<<"try:"<<x<<"\n";
if(ping(prv,x)==0){
prv=x;
break;
}
}
travelTo(prv);
}
travelTo(b);
}
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... | ||||
