Submission

Score: 100

User: konthaina_TH

Problemset: Fast Delivery

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-06 09:36:07

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = 1e18;

int main() {
    ll n, m;
    cin >> n >> m;
    vector<pair<ll, ll>> adj[n + 1];
    vector<ll> parent(n + 1, -1);
    for (ll i = 0; i < m; i++) {
        ll u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
    }
    ll start;
    cin >> start;
    vector<ll> dist(n + 1, INF);
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
    dist[start] = 0;
    pq.push({0, start});

    while (!pq.empty()) {
        ll d = pq.top().first;
        ll u = pq.top().second;
        pq.pop();

        if (d > dist[u]) continue;

        for (auto edge : adj[u]) {
            ll v = edge.first;
            ll w = edge.second;
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                parent[v] = u;
                pq.push({dist[v], v});
            }
        }
    }
    for (ll i = 0; i < n; i++) { 
        if (i == start) continue;

        cout << start << " -> " << i << " ";
        
        if (dist[i] == INF) {
            cout << "(inf)" << endl;
        } else {
            cout << "(" << dist[i] << ") ";
            vector<ll> path;
            for (ll curr = i; curr != -1; curr = parent[curr]) {
                path.push_back(curr);
            }
            reverse(path.begin(), path.end());
            for (int j = 0; j < path.size(); j++) {
                cout << path[j] << (j == path.size() - 1 ? "" : " ");
            }
            cout << endl;
        }
    }

    return 0;
}