Cod sursa(job #1813108)

Utilizator AlexEnacheEnache Alexandru-Paul AlexEnache Data 22 noiembrie 2016 18:26:55
Problema Algoritmul lui Dijkstra Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include<fstream>
#define inf 2000009
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,start[50005],t[3][250005],d[50002],viz[50002],k,x,y,c,vmin;
int main()
{
    int i,j;
    fin>>n>>m;
    int k=0;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        k++;
        t[0][k]=y;
        t[1][k]=c;
        t[2][k]=start[x];
        start[x]=k;
    }
    for(i=1;i<=n;i++)
    {
        viz[i]=0;
        d[i]=inf;
    }
    d[1]=0;
    for(i=1;i<=n;i++)
    {
        vmin=inf;
        for(j=1;j<=n;j++)
        {
            if(viz[j]==0&&d[j]<vmin)
            {
                vmin=d[j];
                k=j;
            }
        }
        if(vmin==inf)
        {
            break;
        }
        viz[k]=1;
        for(j=start[k];j;j=t[2][j])
        {
            y=t[0][j];
            c=t[1][j];
            if(d[k]+c<d[y])
                d[y]=d[k]+c;
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf) fout<<0<<' ';
        else fout<<d[i]<<' ';
    }
    fin.close();
    fout.close();
    return 0;
}