杭电2066——dijkstra（迪杰斯特拉）最短路径

杭电2066——dijkstra（迪杰斯特拉）最短路径

原题传送门
弗洛伊德解题
这道题应该比较符合Floyd的思想，s和d的数据量可能特别大，不过迪杰斯特拉肯定能做啊！！！

# include <iostream>
# include <algorithm>
# include <vector>
# include <cstdio>
# include <cstring>
using namespace std;

const int inf = 1e7;
const int maxn = 1010;
int mapp[maxn][maxn];
int len[maxn], vis[maxn];
int s[maxn], d[maxn];
int ans;

void dijkstra(int a, int n) {
	memset(vis, 0, sizeof(vis));
	for (int i = 1; i <= n; i++) {
		len[i] = mapp[a][i];
	}
	len[a] = 0;
	vis[a] = 1;
	while (1) {
		int minn = inf;
		int k = -1;
		for (int i = 1; i <= n; i++) {
			if (vis[i] == 0 && minn > len[i]) {
				minn = len[i];
				k = i;
			}
		}
		if (k == -1) {
			break;
		}
		vis[k] = 1;
		for (int i = 1; i <= n; i++) {
			if (vis[i] == 0 && len[i] > len[k] + mapp[k][i]) {
				len[i] = len[k] + mapp[k][i];
			}
		}
	}
}

int main(void) {
	ios::sync_with_stdio(false);
	int t, ls, ld;
	int a, b, x;
	while (cin >> t >> ls >> ld) {
		for (int i = 0; i < maxn; i++) {//初始化mapp
			for (int j = 0; j < maxn; j++) {
				if (i == j) {
					mapp[i][j] = 0;
				}
				else {
					mapp[i][j] = inf;
				}
			}
		}
		for (int i = 0; i < t; i++) {//输入mapp
			cin >> a >> b >> x;
			if (mapp[a][b] > x) {
				mapp[a][b] = mapp[b][a] = x;
			}
		}
		for (int i = 0; i < ls; i++) {
			cin >> s[i];
		}
		for (int i = 0; i < ld; i++) {
			cin >> d[i];
		}
		ans = inf;
		for (int i = 0; i < ls; i++) {
			dijkstra(s[i], maxn);
			for (int j = 0; j < ld; j++) {
				if (ans > len[d[j]]) {
					ans = len[d[j]];
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}