# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218277 | dolphingarlic | Computer Network (BOI14_network) | C++14 | 110 ms | 4344 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"network.h"
#include<vector>
int d[1001];
std::vector<int> f[1001];
void findRoute(int N, int a, int b) {
for(int i=1;i<=N;i++){
d[i]=ping(i,b);
f[d[i]].push_back(i);
}
for(int i=d[a];i;i--)for(int j:f[i-1])if(!ping(a,j)){
travelTo(j);
a=j;
break;
}
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... |