# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151884 | Kamisama | Computer Network (BOI14_network) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include "network.h"
using namespace std;
const int maxn=1e3+7;
vector<int> disList[maxn],path;
void findRoute(int n, int a, int b){
int pathLength=ping(a,b)+1;
for(int i=1;i<=n;i++) if(i!=a && i!=b) disList[ping(a,i)].push_back(i);
path.push_back(b);
for(;lengthPath>0;pathLength--){
for(int c: disList[lengthPath]) if(!ping(c,b)){
b=c;
path.push_back(b);
break;
}
}
for(int i=(int)path.size()-1;i>=0;i--) travelTo(path[i]);
}