Cod sursa(job #3374816)

Utilizator AniaprPricop Ania Aniapr Data 9 noiembrie 2026 14:26:34
Problema Algoritmul lui Dijkstra Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int infinit = 2e9;
vector<pair<int, int>> L[50005];
int D[50005], vis[50005];
priority_queue<pair<int, int>> q;

void dijkstra(int s, int n) {
    for (int i = 1; i <= n; i++) {
        D[i] = infinit;
        vis[i] = 0;
    }
    
    D[s] = 0;
    q.push({0, s});
    
    while (!q.empty()) {
        int nod = q.top().second;
        q.pop();
        
        if (vis[nod] == 1)
            continue;
            
        vis[nod] = 1;
        
        for (auto it : L[nod]) {
            int vec = it.first;
            int cost = it.second;
            if (D[vec] > D[nod] + cost) {
                D[vec] = D[nod] + cost;
                q.push({-D[vec], vec});
            }
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;


    for(int i = 1; i <= n; i++){
        int u, v, c;
        fin>>u>>v>>c;
        L[u].push_back({v,c});
    }
    
    dijkstra(1, n);
    
    for (int i = 2; i <= n; i++) {
        if (D[i] == infinit) {
            fout<<0<<" ";
        } else {
            fout<<D[i]<<" ";
        }
    }
    
    return 0;
}