#include <bits/stdc++.h>
#include <bits/debug.hpp>
#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "Cities"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 2e5 + 7
using namespace std;
const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r)
{
return uniform_int_distribution<ll> (l, r)(rng);
}
int n, k, m;
int imp[maxn];
ll dp[35][maxn];
vector<pair<int, ll>> edges[maxn];
void DJK(ll dp[maxn])
{
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>> > q;
fi(i, 1, n) q.push({dp[i], i});
while(!q.empty())
{
ll u = q.top().second, g = q.top().first; q.pop();
if(g > dp[u]) continue;
for(auto [v, w] : edges[u]) {
if(dp[u] + w < dp[v]) {
dp[v] = dp[u] + w, q.push({dp[v], v});
}
}
}
}
void solve()
{
cin >> n >> k >> m;
fi(i, 1, k) cin >> imp[i];
fi(i, 1, m) {
int x, y, w; cin >> x >> y >> w;
edges[x].push_back({y, w}), edges[y].push_back({x, w});
}
memset(dp, 60, sizeof dp);
fi(i, 1, k) dp[(1 << (i - 1))][imp[i]] = 0;
fi(x, 1, (1 << k) - 1) {
fi(i, 1, n) for(int y = x; y > 0; y = (y - 1) & x) dp[x][i] = min(dp[x][i], dp[x ^ y][i] + dp[y][i]);
DJK(dp[x]);
}
cout << *min_element(dp[(1 << k) - 1] + 1, dp[(1 << k) - 1] + 1 + n);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(Neco".inp", "r")) {
freopen(Neco".inp", "r", stdin);
freopen(Neco".out", "w", stdout);
}
int nTest = 1;
// cin >> nTest;
while(nTest--)
{
solve();
}
return 0;
}
Compilation message
cities.cpp:2:10: fatal error: bits/debug.hpp: No such file or directory
2 | #include <bits/debug.hpp>
| ^~~~~~~~~~~~~~~~
compilation terminated.
