Cod sursa(job #3374822)

Utilizator eduard.almasanAlmasan Eduard-Stefan eduard.almasan Data 9 noiembrie 2026 14:30:17
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include <fstream>
#include <queue>
using namespace std;

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

int start[50001], urm[250001], vecin[250001], cost[250001];
int d[50001];
bool viz[50001];
priority_queue<pair<int, int>> q;

int main() {
    int n, m, a, i, j, u, v;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> a >> vecin[i] >> cost[i];
        urm[i] = start[a];
        start[a] = i;
    }

    for (i = 2; i <= n; i++)
        d[i] = 2000000000;

    q.push(make_pair(0, 1));
    while (!q.empty()) {
        u = q.top().second;
        q.pop();
        if (viz[u])
            continue;
        viz[u] = true;
        for (j = start[u]; j != 0; j = urm[j]) {
            v = vecin[j];
            if (d[u] + cost[j] < d[v]) {
                d[v] = d[u] + cost[j];
                q.push(make_pair(-d[v], v));
            }
        }
    }

    for (i = 2; i <= n; i++) {
        if (d[i] == 2000000000)
            fout << 0 << ' ';
        else
            fout << d[i] << ' ';
    }
    return 0;
}