Submission

Score: 80

User: konthaina_TH

Problemset: Fast Delivery

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-04 09:25:18

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

const int INF = 1e9;

int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> adj[n + 1];
    vector<int> parent(n + 1, -1);
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
    }
    int start;
    cin >> start;
    vector<int> dist(n + 1, INF);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[start] = 0;
    pq.push({0, start});
    int cnt = 1;
    while (!pq.empty()) {
        int d = pq.top().first;
        int u = pq.top().second;
        pq.pop();

        if (d > dist[u]) continue;

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

            }
            else {
                cout << start << " -> " << cnt << " (" << "inf" << ") " << "\n";
                cnt = i;
            }
        }
        cout << start << " -> " << i << " (" << dist[i] << ") ";
        cnt++;
        vector<int> path;
        for (int curr = i; curr != -1; curr = parent[curr]) {
            path.push_back(curr);
        }
        reverse(path.begin(), path.end());
        for (int node : path) {
            cout << node << " ";
        }
        cout << endl;
    }

    return 0;
}