Cod sursa(job #1886472)

Utilizator leraValeria lera Data 20 februarie 2017 21:49:39
Problema Algoritmul lui Dijkstra Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#define inf 999999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int mat[5000][5000],a,b,c,cost[5000],nod,rez,viz[5000],n,m;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)mat[i][j]=-1;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        mat[a][b]=c;
    }
    for(int i=2;i<=n;i++)cost[i]=inf;
    cost[1]=0;
    nod=1;
    for(int j=1;j<=n;j++)
    {
        viz[nod]=1;
        for(int i=2;i<=n;i++)if(mat[nod][i]!=-1)cost[i]=min(cost[nod]+mat[nod][i],cost[i]);
        rez=inf;
        for(int i=2;i<=n;i++)
        {
            if(!viz[i] && cost[i]<rez)
            {
                nod=i;
                rez=cost[i];
            }
        }
    }
    for(int i=2;i<=n;i++)if(cost[i]==inf)fout<<0<<" ";
    else fout<<cost[i]<<" ";
    return 0;
}