OJ 1215

代码如下

#include<bits/stdc++.h>
using namespace std;
const int maxn = 900;
const int maxxn = 3000;
priority_queue< pair<int,int > > q;

int cow,n,tot = 0,maxx = 999999999,sum = 0;
int v[maxn];
int m;
struct node {
	int fr,ver,Next,value;
};
int head[maxn];
node edge[maxxn];
int d[maxxn];
bool vv[maxn];

void dijsktra(int s) {
	memset(vv,0,sizeof(vv));
	memset(d,0x3f3f3f,sizeof(d));
	d[s] = 0;
	q.push(make_pair(0,s));
	while (!q.empty()) {
		int x = q.top().second;
		q.pop();
		if (vv[x] != 0) continue;
		vv[x] = 1;
		for (int i = head[x];i;i = edge[i].Next) {
			int y = edge[i].ver; int z = edge[i].value;
			if(d[x] + z < d[y]) {
				d[y] = d[x] + z;
				q.push(make_pair(-d[y],y));
			}
		}
	}
}
inline void add(int x,int y,int z) {
	edge[++tot].fr = x; edge[tot].ver = y; edge[tot].value = z; edge[tot].Next = head[x]; head[x] = tot;
}
inline int Read() {
	int xx = 0;
	int ff = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') ff = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		xx = (xx<<1) + (xx<<3) + ch - '0';
		ch = getchar();
	}
//	cout << "??????" <<endl;
//	cout << xx <<endl;
	return xx * ff;
}

int main () {
	cow = Read(); n = Read(); m = Read();
//	cout << m <<endl;
	memset(head,0,sizeof(head));
	memset(vv,0,sizeof(vv));
	memset(v,0,sizeof(v));
	for (int i = 1;i <= cow; i++) {
		int a = Read();
		v[a]++;
	}
	for (int i = 1;i <= m;i++) {
		int a = Read(); int b = Read();	int c = Read();
		add(a,b,c); add(b,a,c);
	}
	for (int i = 1;i <= n;i++) {
		sum = 0;
		dijsktra(i);
		for (int j = 1;j <= n;j++) {
			if(v[j] != 0) {
				sum += v[j] * d[j];
			}
		}
		if (sum < maxx&&sum != 0) maxx = sum;
	}
	cout << maxx <<endl;
	return 0;
}