Cod sursa(job #2884130)

Utilizator mjmilan11Mujdar Milan mjmilan11 Data 2 aprilie 2022 14:08:28
Problema Algoritmul lui Dijkstra Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.29 kb
#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50005;
const int INF = (1<<29);

vector < pair<int,int> > v[NMAX];
priority_queue < pair<int,int> > pq;
int n,m,dist[NMAX];
bool fixat[NMAX];

void citire(){
    fin >> n >> m;
    int x,y,cost;
    for(int i=1;i<=m;i++){
        fin >> x >> y >> cost;
        v[x].push_back({y,cost});
        v[y].push_back({x,cost});
    }
    for(int i=1;i<=n;i++) dist[i]=INF;
    return;
}

void dijkstra(){
    pq.push({0,1});
    dist[1]=0;
    while(!pq.empty()){
        while(!pq.empty() and fixat[pq.top().second]==true)
            pq.pop();
        if(pq.empty()) return;
        int node = pq.top().second;
        int cost = pq.top().first;
        fixat[node]=true;
        pq.pop();
        for(int i=0;i<v[node].size();i++){
            int vecin=v[node][i].first;
            int cst=v[node][i].second;
            if(dist[vecin]>dist[node]+cst){
                dist[vecin]=dist[node]+cst;
            }
            pq.push({-dist[vecin],vecin});
        }
    }
}

void afis(){
    for(int i=2;i<=n;i++)
        fout << dist[i] << ' ';
    return;
}

int main()
{
    citire();
    dijkstra();
    afis();
    return 0;
}