https://www.acwing.com/problem/content/1129/
思路:Floyd会超时,稍微估算一下,单源最短路暴力跑一遍差不多1e7。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 810, M = 1510 * 2;
int n, m;
int h[N], e[M], ne[M], idx, dist[N], w[M], cnt, mumu[N];
bool st[N];
void add(int x, int y, int z)
{
w[idx] = z;
e[idx] = y;
ne[idx] = h[x];
h[x] = idx++;
}
int spfa(int s)
{
memset(dist, 0x3f, sizeof(dist));
memset(st, 0, sizeof(st));
queue<int> q;
q.push(s);
dist[s] = 0;
st[s] = true;
while(q.size())
{
int t = q.front();
q.pop();
st[t] = false;
for(int i = h[t];i != -1;i = ne[i])
{
int j = e[i];
if(dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
if(!st[j])
{
q.push(j);
st[j] = true;
}
}
}
}
int sum = 0;
for(int i = 1;i <= cnt; i++)
{
if(dist[mumu[i]] == 0x3f3f3f3f) return 0x3f3f3f3f;
sum += dist[mumu[i]];
}
return sum;
}
int main()
{
scanf("%d%d%d", &cnt, &n, &m);
memset(h, -1, sizeof(h));
for(int i = 1;i <= cnt; i++) scanf("%d", &mumu[i]);
for(int i = 1;i <= m; i++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
add(a, b, c);
add(b, a, c);
}
int res = 0x3f3f3f3f;
for(int i = 1;i <= n; i++)
{
res = min(res, spfa(i));
}
printf("%d\n", res);
return 0;
}