Cod sursa(job #3375690)

Utilizator gabs09Tofan Gabriela-Felicia gabs09 Data 13 noiembrie 2026 08:29:22
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;

// complexitate  O(m log n)
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int NMAX = 5e4;
vector<pair<int, int>> L[NMAX + 1]; // (vecin, costul dintre nod si vecin)
int n, m;
int d[NMAX + 1];
bool vis[NMAX + 1];

void dijkstra(int s) {
    for(int i = 1; i <= n; i++) {
        d[i] = 1e9;
        vis[i] = false;
    }

    d[s] = 0;
    priority_queue<pair<int, int>> pq;
    pq.push({-d[s], s});

    while(!pq.empty()) {
        int nod = pq.top().second;
        pq.pop();

        if(vis[nod]) continue;
        vis[nod] = true;

        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});
            }
        }
    }
}

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

    for (int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        L[x].push_back({y, c}); // graf orientat
    }

    dijkstra(1);

    // afisare d si unde distanta este infinit afisez 0
    for (int i = 1; i <= n; i++) {
        if(d[i] == 1e9) {
            d[i] = 0;
        }

        fout << d[i] << " ";
    }
    
    fin.close();
    fout.close();
    return 0;
}