提出 #74604014

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> pii; 
int n,m,a,b,c;
int dij(int n, vector<vector<pii>> adj) {
    vector<int> dist(n + 1, 2e18);
    dist[1] = 0;
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    pq.push({0, 1});
    while (!pq.empty()) {
        int d = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        if (d > dist[u]) continue;
        if (u == n) return dist[n];
        for (auto& edge : adj[u]) {
            int v = edge.first;
            int weight = edge.second;

            if (dist[u] + weight < dist[v]) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v});
            }
        }
    }
    return (dist[n] == 2e18) ? -1 : dist[n];
}
signed main() {
    cin >> n >> m;
    vector<vector<pii>> tp(n + 1);
    while (m--){
    	cin >> a >> b >> c;
    	tp[a].push_back({b,c});
    }
    int ans = dij(n, tp);
    cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果