提出 #74604843

---

ソースコード 拡げる

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

const long long INF = 1LL<<60;
vector<vector<pair<int, int>>> adj;

void shortestPath(vector<vector<pair<int, int>>> &adj, int V, int src){

    priority_queue<pair<long long,int>, vector<pair<long long,int>>, greater<pair<long long,int>>> pq;
    vector<long long> dist(V, INF);
    pq.push(make_pair(0, src));
    dist[src] = 0;

    while (!pq.empty()) {
        auto [d, u] = pq.top(); pq.pop();
        if (d > dist[u]) continue;
        for (auto x : adj[u]) {
            int v = x.first;
            int weight = x.second;
            if (dist[v] > d + weight) {
                dist[v] = d + weight;
                pq.push(make_pair(dist[v], v));
            }
        }
        
    }
    cout << dist[V-1] << endl;
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    long long n,m; cin >> n >> m;
    vector<long long> d(n);
    adj.resize(n);
    for(int i = 0; i < m; i++){
        int x,y,c; cin >> x >> y >> c; x--; y--;
        adj[x].push_back({y,c});
    }
    shortestPath(adj,n,0);
}

提出情報

ジャッジ結果