Cod sursa(job #3375695)

Utilizator Teooo28Aghirasimoae Andra Teodora Teooo28 Data 13 noiembrie 2026 08:31:33
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <bits/stdc++.h>

using namespace std;

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

const int MAXN = 5e4;
vector<pair<int, int>> L[MAXN + 1];
int d[MAXN + 1], vis[MAXN + 1];
int n, m;

void dijkstra(int s) {
    for (int i = 1; i <= n ; i++) {
        d[i] = 1e9;
    }
    d[s] = 0;
    priority_queue<pair<int, int>> pq;
    pq.push({-d[s], s});
    while(pq.empty() == false) {
        int nod = pq.top().second;
        pq.pop();
        if(vis[nod]) continue;
        vis[nod] = 1;
        for(auto it : L[nod]) {
            int vec = it.first;
            int cost = it.second;
            if(d[nod] + cost < d[vec]) {
                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});
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++) {
        if(d[i] == 1e9) {
            fout << "0 ";
        } else {
            fout << d[i] << " ";
        }
    }
    return 0;
}