Cod sursa(job #2138820)

Utilizator gruhtenZinnenberg Gruhten gruhten Data 21 februarie 2018 21:34:51
Problema Algoritmul lui Dijkstra Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include<fstream>
#define dim 251001
#define dim2 51001
//#define dim 10
//#define dim2 9
//#define oo 123456788
using namespace std;
int a[dim],b[dim],cost[dim],dist[dim2],i,ok,m,n,minn;

int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    minn=(1<<30);
    for(i=2;i<=n;i++)
        dist[i]=minn;

    for(i=1;i<=m;i++)
    {
        f>>a[i]>>b[i]>>cost[i];
        if(a[i]==1)
            dist[b[i]]=cost[i];
    }

    ok=1;

    while(ok)
    {
        ok=0;
        for(i=1;i<=m;i++)
        {
           if(dist[b[i]]>dist[a[i]]+cost[i])
            {
                dist[b[i]]=dist[a[i]]+cost[i];
                ok=1;
            }
        }

    }

    for(i=2;i<=n;i++)
        if(dist[i]==minn)
            g<<"0 ";
        else
            g<<dist[i]<<' ';
    return 0;
}