Submission

PPPPPPPPPP

Score: 100

User: Nagornz

Problemset: Fast Delivery

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-13 23:55:13

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n, m; cin >> n >> m;
    wgraph (adj, n + 1);
    while (m--) {
        int u, v, w; cin >> u >> v >> w;
        adj[u].emb(w, v);
    }
    int st; cin >> st;
    greater_priority_queue <pii> q;
    q.emplace(0, st);
    vector <int> dis(n + 1, inf);
    dis[st] = 0;
    vector <int> prev(n + 1, -1);
    while (!q.empty()) {
        auto [w, u] = q.top(); q.pop();
        if (w > dis[u]) continue;
        for (auto [ww, v] : adj[u]) {
            int www = ww + w;
            if (www < dis[v]) {
                dis[v] = www;
                q.em(dis[v], v);
                prev[v] = u;
            }
        }
    }
    vector <int> path[n + 1];
    for (int i = 0; i < n; i++) {
        if (i == st) continue;
        int curr = i;
        while (curr != -1) {
            path[i].emb(curr);
            curr = prev[curr];
        }
        reverse(all(path[i]));
    }
    for (int i = 0; i < n; i++) {
        if (i == st) continue;
        cout << st << " -> " << i << " (";
        if (dis[i] == inf) {cout << "inf)\n"; continue;}
        else cout << dis[i];
        cout << ") ";
        for (auto e : path[i]) cout << e << " ";
        cout << "\n";
    }
}