# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47317 | 2018-04-30T13:42:38 Z | rajarshi_basu | Computer Network (BOI14_network) | C++14 | 119 ms | 4556 KB |
#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 = 0;i<N; i++){ if(i == b)dist[i] = 0; else{ dist[i] = ping(i,b) + 1; } } int node = a; while(true){ for(int i=1;i<=N;i++){ if((dist[i] == dist[node] - 1) and (ping(node,i) == 0)){ travelTo(node); } if(node == b)break; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 119 ms | 4220 KB | ping called with invalid arguments |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 107 ms | 4452 KB | ping called with invalid arguments |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 110 ms | 4532 KB | ping called with invalid arguments |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 110 ms | 4556 KB | ping called with invalid arguments |
2 | Halted | 0 ms | 0 KB | - |