# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218280 | dolphingarlic | Computer Network (BOI14_network) | C++14 | 118 ms | 4508 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(;N;N--){if(N==b)continue;d[N]=ping(N,b);f[d[N]].push_back(N);}for(N=d[a];N;N--)for(int j:f[N-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... |