# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752889 | 2023-06-04T07:55:54 Z | 125259 | Computer Network (BOI14_network) | C++17 | 83 ms | 7848 KB |
#include "network.h" #include <bits/stdc++.h> using namespace std; void findRoute (int n, int a, int b){ int arr[n+1],arr1[n+1]; for(int i=1; i<=n; i++){ if(i==a or i==b) continue; arr[i]=ping(a,i); arr1[i]=ping(b,i); } int dist=ping(a,b); for(int i=0; i<dist; i++){ for(int j=1; j<=n; j++){ if(j==a or j==b)continue; if(arr[j]==i and arr1[j]==dist-1-i) travelTo(j); } } travelTo(b); /*int dist = ping(a, b); for (int i = 1; i <= dist; ++i) travelTo (i);*/ }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 7848 KB | Output is correct |
2 | Correct | 72 ms | 7388 KB | Output is correct |
3 | Correct | 77 ms | 6984 KB | Output is correct |
4 | Correct | 70 ms | 6944 KB | Output is correct |
5 | Correct | 77 ms | 6600 KB | Output is correct |
6 | Correct | 71 ms | 6632 KB | Output is correct |
7 | Correct | 1 ms | 312 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 6652 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 6592 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 82 ms | 6608 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |