Cod sursa(job #3374818)

Utilizator OuatuCosminOuatu Ion Cosmin OuatuCosmin Data 9 noiembrie 2026 14:28:00
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.21 kb
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int NMAX = 50000;
vector<pair<int, int>> L[NMAX + 1];
int d[NMAX + 1], vis[NMAX + 1];

int main() {
    int n, m;
    fin >> n >> m;
    
    for(int i = 1; i <= m; ++i) {
        int x, y, c;
        fin >> x >> y >> c;
        L[x].push_back({y, c}); 
    }
    
    for(int i = 1; i <= n; ++i) {
        d[i] = 2e9;
        vis[i] = 0;
    }
    
    d[1] = 0;
    priority_queue<pair<int, int>> pq;
    pq.push({-d[1], 1});
    
    while(pq.empty() == false) {
        int nod = pq.top().second;
        pq.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;
                pq.push({-d[vec], vec});
            }
        }
    }
    
    for(int i = 2; i <= n; ++i) {
        if(d[i] == 2e9) {
            fout << 0 << " ";
        } else {
            fout << d[i] << " ";
        }
    }
    
    return 0;
}