# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300977 | 2020-09-17T15:36:41 Z | zecookiez | Computer Network (BOI14_network) | C++14 | 134 ms | 8184 KB |
#include <bits/stdc++.h> #include <network.h> using namespace std; template<class C>constexpr int len(const C&c){return int(c.size());} const int MAXN = 1001; vector<int> dist[MAXN]; void findRoute(int N, int a, int b){ int c = ping(a, b); dist[c].push_back(b); for(int v, i = 1; i <= N; ++i){ if(i == a) continue; v = i == b ? c : ping(a, i); if(v < c) dist[v].push_back(i); } int prev = a; for(int x = 0; x < c; ++x){ for(int nxt : dist[x]){ if(x + 1 + ping(nxt, b) == c && ping(prev, nxt) == 0){ travelTo(nxt); prev = nxt; break; } } } travelTo(b); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 125 ms | 4400 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 115 ms | 4344 KB | Output is correct |
2 | Correct | 29 ms | 2936 KB | Output is correct |
3 | Correct | 124 ms | 7928 KB | Output is correct |
4 | Correct | 111 ms | 6264 KB | Output is correct |
5 | Correct | 125 ms | 8056 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 118 ms | 4344 KB | Output is correct |
2 | Correct | 30 ms | 2936 KB | Output is correct |
3 | Correct | 134 ms | 7932 KB | Output is correct |
4 | Correct | 107 ms | 6264 KB | Output is correct |
5 | Correct | 130 ms | 8184 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 118 ms | 4344 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |