Cod sursa(job #3374828)

Utilizator FeraryFeraru Razvan-Mihai Ferary Data 9 noiembrie 2026 14:45:37
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.34 kb
#include <fstream>
#include <vector>
#include <queue>
#include <functional>
using namespace std;

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

const int NMAX = 50005;
const int INF = 1e9;

// g[a] = lista de perechi (b, c) = exista arc de la a la b de lungime c
vector<pair<int, int>> g[NMAX];

// dist[i] = cea mai mica distanta cunoscuta de la nodul 1 la nodul i
int dist[NMAX];

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

    for (int i = 0; i < m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        g[a].push_back({b, c});
    }

    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[1] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, 1});

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

        if (d > dist[nod])
            continue;

        for (auto &arc : g[nod]) {
            int vecin = arc.first;
            int cost = arc.second;

            if (dist[nod] + cost < dist[vecin]) {
                dist[vecin] = dist[nod] + cost;
                pq.push({dist[vecin], vecin});
            }
        }
    }

    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    }
    fout << "\n";

    return 0;
}