Cod sursa(job #3374825)

Utilizator AniaprPricop Ania Aniapr Data 9 noiembrie 2026 14:32:55
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.11 kb
#include <bits/stdc++.h>
using namespace std;

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

vector<pair<int, int>> L[50005];
int D[50005], vis[50005];
priority_queue<pair<int, int>> pq;

void dijkstra(int s, int n) {
    for (int i = 1; i <= n; i++) {
        D[i] = INT_MAX;
        vis[i] = 0;
    }

    D[s] = 0;
    pq.push({0, s});

    while (!pq.empty()) {
        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});
            }
        }
    }
}

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

    for (int i = 1; i <= m; 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] == INT_MAX) {
            fout << 0 << " ";
        } else {
            fout << D[i] << " ";
        }
    }

    return 0;
}