Cod sursa(job #2069024)

Utilizator LusianoStan Lucian Mihai Lusiano Data 18 noiembrie 2017 11:47:03
Problema Algoritmul lui Dijkstra Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include <iostream>
#include <fstream>
#define NMAX 1050
#define NMAX1 2500050
#define inf 100000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,c[NMAX][NMAX],d[NMAX1],use[NMAX1];
void citire()
{
    int i,j,x,y,cost;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        if(j==i) c[i][j]=0;
        else c[i][j]=inf;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        c[x][y]=cost;
    }
}
void dijkstra(int s)
{
    int i,k,mn,x,j;
    for(i=1;i<=n;i++) d[i]=inf;
    d[s]=0;
    for(k=1;k<=n;k++)
    { mn=inf;
        for(i=1;i<=n;i++)
             if(!use[i]&&d[i]<mn)
            {
                mn=d[i];
                x=i;
            }
            if(mn==inf) break;
            use[x]=1;
            for(j=1;j<=n;j++)
            {
                if(d[x]+c[x][j]<d[j])
                {
                    d[j]=d[x]+c[x][j];
                }
            }
    }
}
int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf) fout<<0<<" ";
        else fout<<d[i]<<" ";

    }
    return 0;
}