# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47319 | rajarshi_basu | Computer Network (BOI14_network) | C++14 | 171 ms | 4588 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"
#define FOR(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define mp make_pair
#define pb push_back
#define iii pair<int, pair<int,int> >
#define vi vector<int>
using namespace std;
void findRoute(int N,int a,int b){
int dist[N];
for(int i = 1;i<=N; i++){
if(i == b)dist[i] = 0;
else{
dist[i] = ping(i,b) + 1;
}
}
int node = a;
while(true){
if(node == b)break;
for(int i=1;i<=N;i++){
if((dist[i] == dist[node] - 1) and (ping(node,i) == 0)){
travelTo(i);
node = i;
}
}
}
}
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... |