Cod sursa(job #3375689)

Utilizator morarescuemanueleMorarescu Emanuele morarescuemanuele Data 13 noiembrie 2026 08:29:07
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.19 kb
#include <queue>
#include <vector>
#include <fstream>
#include <iostream>
using namespace std;

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

const int NMAX=5e4;
vector<pair<int,int>> L[NMAX+1];
int d[NMAX+1], vis[NMAX+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[vec] > d[nod] +cost)
            {
                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] << " ";
        }
    }
}