杭电2066——Floyd（弗洛伊德）最短路径

杭电2066——Floyd（弗洛伊德）最短路径

原题传送门
水题水题！！！

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

const int maxn = 1e7;
const int lens = 1010;
int mapp[lens][lens];

int main(void) {
	ios::sync_with_stdio(false);
	int t, sl, dl;
	int a, b, x;
	int minn;
	while (cin >> t >> sl >> dl) {
		vector<int>s;
		vector<int>d;
		for (int i = 0; i < lens; i++) {
			for (int j = 0; j < lens; j++) {
				if (i == j) {
					mapp[i][j] = 0;
				}
				else {
					mapp[i][j] = maxn;
				}
			}
		}
		for (int i = 0; i < t; i++) {
			cin >> a >> b >> x;
			if (mapp[a][b] > x) {
				mapp[a][b] = mapp[b][a] = x;
			}
		}
		int sa;
		for (int i = 0; i < sl; i++) {
			cin >> sa;
			s.push_back(sa);
		}
		int da;
		for (int i = 0; i < dl; i++) {
			cin >> da;
			d.push_back(da);
		}
		for (int k = 1; k < lens; k++) {
			for (int i = 1; i < lens; i++) {
				if (mapp[i][k] != maxn) {//这里加个判断，如果i点本来就不能到达k点，就没必要判断，少了一层循环。
					for (int j = 1; j < lens; j++) {
						if (mapp[i][j] > (mapp[i][k] + mapp[k][j])) {
							mapp[i][j] = (mapp[i][k] + mapp[k][j]);
						}
					}
				}
			}
		}
		minn = maxn;
		for (int i = 0; i < sl; i++) {
			for (int j = 0; j < dl; j++) {
				minn = min(minn, mapp[s[i]][d[j]]);
			}
		}
		cout << minn << endl;
	}
	return 0;
}