# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81044 | 2018-10-23T15:43:45 Z | xiaowuc1 | Computer Network (BOI14_network) | C++14 | 126 ms | 8648 KB |
#include <bits/stdc++.h> #include "network.h" /* unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count(); mt19937 g1.seed(seed1); ios_base::sync_with_stdio(false); cin.tie(NULL); */ using namespace std; const double PI = 2 * acos(0); typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<int, ll> pill; typedef pair<ll, ll> pll; typedef long double ld; typedef vector<vector<ll>> matrix; bool used[1005]; void solve(int n, int a, int b, int d) { if(d == 0) { travelTo(b); return; } for(int k = 1; k <= n; k++) { if(used[k]) continue; int d1 = ping(a, k); int d2 = ping(k, b); used[k] = true; if(d1 + d2 + 1 == d) { solve(n, a, k, d1); solve(n, k, b, d2); return; } } assert(false); } void findRoute(int n, int a, int b) { int dd = ping(a, b); used[a] = true; used[b] = true; solve(n, a, b, dd); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 126 ms | 8412 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 114 ms | 8512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 123 ms | 8600 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 112 ms | 8648 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |