# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81052 | xiaowuc1 | Computer Network (BOI14_network) | C++14 | 128 ms | 4600 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>
#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;
map<pii, int> dp;
int dist(int a, int b) {
pii key = {min(a, b), max(a, b)};
if(!dp.count(key)) {
dp[key] = ping(a, b) + 1;
}
return dp[key];
}
bool used[1005];
void findRoute(int n, int a, int b) {
dp.clear();
memset(used, 0, sizeof(used));
stack<pii> q;
q.push({a, b});
used[a] = true;
used[b] = true;
while(!q.empty()) {
pii curr = q.top();
q.pop();
if(dist(curr.first, curr.second) == 1) {
travelTo(curr.second);
continue;
}
for(int k = 1; k <= n; k++) {
if(used[k]) continue;
used[k] = true;
if(dist(a, k) + dist(k, b) == dist(a, b)) {
q.push({k, b});
q.push({a, k});
break;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |