abc 271 E 最短路

题意：https://www.luogu.com.cn/problem/AT_abc271_e

思路：当出现题目要求按照子序列时，我们考虑枚举序列中的每个值的贡献，所以我们根据序列一步步更新最短路即可。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
struct node {
	int u, v, c;
} vc[200005];
int a[200005];
int dis[200005];
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 1; i <= m; i++) {
		int u, v, c;
		cin >> u >> v >> c;
		vc[i].u = u;
		vc[i].v = v;
		vc[i].c = c;
	}
	for (int i = 1; i <= n; i++) {
		dis[i] = 1e18;
	}
	for (int i = 1; i <= k; i++) {
		cin >> a[i];
	}
	dis[1] = 0;
	for (int i = 1; i <= k; i++) {
		int u = vc[a[i]].u;
		int v = vc[a[i]].v;
		int c = vc[a[i]].c;
		dis[v] = min(dis[u] + c, dis[v]);
	}
	if (dis[n] == 1e18) {
		cout << "-1" << endl;
	} else {
		cout << dis[n] << endl;
	}
	return 0;
}