Cod sursa(job #870832)

Utilizator adnionutCojocaru Ionut adnionut Data 3 februarie 2013 23:32:34
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include<fstream>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int m,i,D[50005],g,n;
struct f
{
    int s,d,c;
}v[250005];
int cm(f x,f y)
{
    if(x.s!=y.s)
    return x.s<y.s;
    else
        return x.d<y.d;
}
int main ()
{
    fin>>n>>m;
    for(i=2;i<=n;++i)
        D[i]=60000000;
    for(i=1;i<=m;++i)
    {
        fin>>v[i].s>>v[i].d>>v[i].c;
        if(v[i].s==1)
            D[v[i].d]=v[i].c;
    }
    g=1;
    while(g)
    {
        g=0;
        for(i=1;i<=m;++i)
        {
            if(D[v[i].s]+v[i].c<D[v[i].d]&&D[v[i].s]!=60000000)
            {
                D[v[i].d]=D[v[i].s]+v[i].c;
                g=1;
            }
        }
    }
    for(i=2;i<=n;++i)
        if(D[i]>=60000000)
        {
            D[i]=0;
        }
    for(i=2;i<=n;++i)
        fout<<D[i]<<" ";
    return 0;
}