# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47309 | 2018-04-30T13:32:54 Z | ista2000 | Computer Network (BOI14_network) | C++17 | 1000 ms | 15560 KB |
#include <bits/stdc++.h> using namespace std; // #define int long long int #include "network.h" void findRoute (int n, int a, int b) { /* * Obviously, this is not a good solution. * Replace it with your own code. */ vector<int> v(n); for(int i = 0;i<n;i++) if(i!=b-1) v[i] = ping(i+1, b); int cur = a-1; while(cur!=b-1) { for(int i = 0;i<n;i++) { if(v[i]==v[cur]-1) { int x = ping(cur+1, i+1); if(!x) { travelTo(i+1); cur = i; break; } } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1089 ms | 8056 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1074 ms | 10432 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1092 ms | 13016 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1070 ms | 15560 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |