#713049 (C++17) No.1814 Uribo Road (Easy)

• 問題: No.1814 Uribo Road (Easy)
• ユーザー: MasKoaTS
• 提出日時: 2021-11-05 15:38:21
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 98 ms / 2,000 ms
• コード長: 1,887 bytes
• コンパイル時間: 1,511 ms
• コンパイル使用メモリ: 96,608 KB
• 実行使用メモリ: 5,756 KB
• 最終ジャッジ日時: 2024-11-21 22:59:20
• 合計ジャッジ時間: 3,523 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	3 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	5 ms; 5,248 KB
testcase_10	AC	3 ms; 5,248 KB
testcase_11	AC	5 ms; 5,248 KB
testcase_12	AC	10 ms; 5,248 KB
testcase_13	AC	9 ms; 5,248 KB
testcase_14	AC	18 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	3 ms; 5,248 KB
testcase_17	AC	3 ms; 5,248 KB
testcase_18	AC	3 ms; 5,248 KB
testcase_19	AC	3 ms; 5,248 KB
testcase_20	AC	29 ms; 5,248 KB
testcase_21	AC	8 ms; 5,248 KB
testcase_22	AC	52 ms; 5,280 KB
testcase_23	AC	32 ms; 5,248 KB
testcase_24	AC	61 ms; 5,248 KB
testcase_25	AC	60 ms; 5,248 KB
testcase_26	AC	81 ms; 5,616 KB
testcase_27	AC	97 ms; 5,752 KB
testcase_28	AC	98 ms; 5,740 KB
testcase_29	AC	98 ms; 5,752 KB
testcase_30	AC	88 ms; 5,756 KB
testcase_31	AC	82 ms; 5,756 KB
testcase_32	AC	13 ms; 5,248 KB
testcase_33	AC	4 ms; 5,248 KB
testcase_34	AC	3 ms; 5,248 KB
testcase_35	AC	11 ms; 5,248 KB
testcase_36	AC	6 ms; 5,248 KB
testcase_37	AC	7 ms; 5,248 KB
testcase_38	AC	25 ms; 5,248 KB
testcase_39	AC	8 ms; 5,248 KB
testcase_40	AC	11 ms; 5,248 KB
testcase_41	AC	38 ms; 5,588 KB
testcase_42	AC	21 ms; 5,248 KB
testcase_43	AC	10 ms; 5,248 KB
testcase_44	AC	27 ms; 5,248 KB
testcase_45	AC	6 ms; 5,248 KB
testcase_46	AC	53 ms; 5,248 KB

ソースコード

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
using Pair = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T> >;
const int inf = 2000000000;


VV<int> dijkstra(int n, VV<int>&edge, V<int>&R, VV<Pair>&route) {
	VV<int> dist(n, V<int>(n, -1));
	V<int> st = { 0,n - 1 };
	rep(i, 0, R.size()) {
		st.push_back(edge[R[i]][0]);
		st.push_back(edge[R[i]][1]);
	}
	rep(i, 0, st.size()) {
		int k = st[i];
		priority_queue<Pair, V<Pair>, greater<Pair> > pq;
		pq.push({ 0,k });
		while (pq.size()) {
			Pair p = pq.top();	pq.pop();
			int d = p.first;	int v = p.second;
			if (dist[k][v] == -1) {
				dist[k][v] = d;
				rep(j, 0, route[v].size()) {
					Pair p = { d + route[v][j].second,route[v][j].first };
					pq.push(p);
				}
			}
		}
	}
	return dist;
}


int main(void) {
	int N, M, K;	cin >> N >> M >> K;

	V<int> R(K);
	rep(i, 0, K) {
		cin >> R[i];	R[i] -= 1;
	}
	sort(all(R));

	VV<int> edge(M, V<int>(3));
	VV<Pair> route(N, V<Pair>(0));
	rep(i, 0, M) {
		rep(j, 0, 3) {
			cin >> edge[i][j];
		}
		edge[i][0] -= 1;	edge[i][1] -= 1;
		route[edge[i][0]].push_back({ edge[i][1],edge[i][2] });
		route[edge[i][1]].push_back({ edge[i][0],edge[i][2] });
	}

	int ans = inf;
	int rsum = 0;
	rep(i, 0, R.size()) {
		rsum += edge[R[i]][2];
	}
	VV<int> dist = dijkstra(N, edge, R, route);

	do {
		rep(bit, 0, 1 << K) {
			int s = rsum;
			V<int> path(1);
			rep(i, 0, K) {
				int b = (bit >> i) & 1;
				path.push_back(edge[R[i]][b]);
				path.push_back(edge[R[i]][b ^ 1]);
			}
			path.push_back(N - 1);
			for (int i = 0; i < path.size() - 1; i += 2) {
				s += dist[path[i]][path[i + 1]];
			}
			if (ans > s) {
				ans = s;
			}
		}
	} while (next_permutation(all(R)));

	cout << ans << endl;
	return 0;
}