| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1111230 | f0rizen | Cities (BOI16_cities) | C++17 | 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.
#ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll infll = 1e18;
template<typename T>
istream &operator>>(istream &is, vector<T> &a) {
for (auto &i : a) {
is >> i;
}
return is;
}
int32_t main() {
#ifdef LOCAL
freopen("/tmp/input.txt", "r", stdin);
#else
ios::sync_with_stdio(false);
cin.tie(nullptr);
#endif
int n, k, m;
cin >> n >> k >> m;
vector<int> a(k);
cin >> a;
for (auto &i : a) {
--i;
}
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < m; ++i) {
int u, v, w;
cin >> u >> v >> w;
--u, --v;
g[u].push_back({v, w});
g[v].push_back({u, w});
}
vector<vector<ll>> dp(1 << k, vector<ll>(n, infll));
using pii = pair<ll, pair<int, int>>;
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int i = 0; i < k; ++i) {
dp[1 << i][a[i]] = 0;
pq.push({dp[1 << i][a[i]], {1 << i, a[i]}});
}
while (!pq.empty()) {
auto [_, a] = pq.top();
pq.pop();
auto [mask, v] = a;
if (_ > dp[mask][v]) {
continue;
}
for (auto [u, w] : g[v]) {
if (dp[mask][u] > dp[mask][v] + w) {
dp[mask][u] = dp[mask][v] + w;
pq.push({dp[mask][u], {mask, u}});
}
for (int upmask = mask;; upmask = (upmask + 1) | mask) {
if (dp[upmask][u] > dp[mask][v] + dp[upmask ^ mask][u] + w) {
dp[upmask][u] = dp[mask][v] + dp[upmask ^ mask][u] + w;
pq.push({dp[upmask][u], {upmask, u}});
}
if (upmask == (1 << k) - 1) {
break;
}
}
}
}
ll ans = infll;
for (int i = 0; i < n; ++i) {
ans = min(ans, dp[(1 << k) - 1][i]);
}
cout << ans << "\n";
return 0;
}