다익스트라 최단거리 (더블릿)

#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
 
using namespace std;
 
typedef pair<int, int> Pair;
 
priority_queue<Pair, vector<Pair>, greater<Pair> > pq;
 
int main() {
    int n, m, s;
    scanf("%d %d %d", &n, &m, &s);
 
    vector<int> dist(n+1, 30000000);
    vector<int> visit(n+1, 0);
    vector<vector<pair<int, int> > > adj(n+1);
    vector<vector<int> > path(n + 1);
 
    for (int i = 0; i < m; i++) {
        int v1, v2, len;
        scanf("%d %d %d", &v1, &v2, &len);
 
        adj[v1].push_back(make_pair( len,v2 ));
    }
 
    pair<int, int> start = make_pair(0, s);
    pq.push(start);
 
    visit[s] = 1;
    dist[s] = 0;
    path[s].push_back(s);
 
    while (!pq.empty()) {
        pair<int,int> cur = pq.top();
        int curV = cur.second;
        int curL = cur.first;
        pq.pop();
 
        visit[curV] = 1;
        
        for (int i = 0; i < adj[curV].size(); i++) {
            int nextV = adj[curV][i].second;
            int nextL = adj[curV][i].first;
        
            if (visit[nextV] == 0) {
                if (dist[nextV] > dist[curV] + nextL) {
                    dist[nextV] = dist[curV] + nextL;
                    pq.push({ dist[nextV],nextV });
 
                    path[nextV].assign(path[curV].begin(), path[curV].end());
                    path[nextV].push_back(nextV);
                }            
            }
        }        
    }
        
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < path[i].size(); j++) {
            printf("%d ", path[i][j]);
        }
        printf("\n");
    }
}