Submission #35176797

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    using ll = long long;
    constexpr ll inf = numeric_limits<ll>::max() / 2;
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(m), b(m), c(m);
    vector<ll> dist(n, inf);
    dist[0] = 0;
    for (int i = 0; i < m; ++i) {
        cin >> a[i] >> b[i] >> c[i];
        a[i] -= 1;
        b[i] -= 1;
    }
    while (k--) {
        int e;
        cin >> e;
        e -= 1;
        if (dist[b[e]] > dist[a[e]] + c[e]) {
            dist[b[e]] = dist[a[e]] + c[e];
        }
    }
    if (dist[n - 1] == inf) {
        cout << -1 << '\n';
    } else {
        cout << dist[n - 1] << '\n';
    }
    return 0;
}

Submission Info

Judge Result