Cod sursa(job #3184595)

Utilizator denizza07Birau Denisa denizza07 Data 16 decembrie 2023 12:24:19
Problema Algoritmul lui Dijkstra Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.57 kb
/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <fstream>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,k,x,y,c;
int start[50002];
struct nod{
    int vecin,cost;
    int leg;
};
nod L[50002];
int main()
{
    fin>>n>>m;
    k=0;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>c;
        k++;
        L[k]={y,c,start[x]};
        start[x]=k;
    }
    int d[50002],inf,viz[5002]={0},p;
    inf=1000000000;
    for(int i=1;i<=n;i++){
        d[i]=inf;
    }
    d[1]=0;
    for(k=1;k<=n;k++){
        int vmin=inf;
        for(int i=1;i<=n;i++){
            if(viz[i]==0 && d[i]<vmin){
                vmin=d[i];
                p=i;
            }
        }
        if(vmin==inf){
            break;
        }
        viz[p]=1;
        for(int i=start[p];i!=0;i=L[i].leg){
            int x=L[i].vecin;
            int c=L[i].cost;
            if(viz[x]==0 && d[x]>d[p]+c){
                d[x]=d[p]+c;
            }
        }
    }
    for(int i=2;i<=n;i++){
        if(d[i]==inf){
            fout<<0<<" ";
        }
        else{
            fout<<d[i]<<" ";
        }
    }

    return 0;
}