# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81050 | xiaowuc1 | Computer Network (BOI14_network) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.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) {
memset(used, 0, sizeof(used));
int dd = ping(a, b);
used[a] = true;
used[b] = true;
solve(n, a, b, dd);
}