Cod sursa(job #3374820)

Utilizator tomCipriTomescuCiprian tomCipri Data 9 noiembrie 2026 14:29:43
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include<iostream>
#include <queue>
#include<vector>
#include<fstream>
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;
}