Cod sursa(job #1087364)

Utilizator acomAndrei Comaneci acom Data 19 ianuarie 2014 12:27:53
Problema Algoritmul lui Dijkstra Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<cstdio>
#include<vector>
#include<climits>
using namespace std;
vector < pair <int,int> > v[50005];
int n,m,s,x,y,c,D[50005],viz[50005];
int main()
{
    int i;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    D[0]=INT_MAX;
    for (i=2;i<=n;++i)
        D[i]=INT_MAX;
    for (i=0;i<m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    s=1, viz[1]=1;
    while (s)
    {
        for (i=0;i<v[s].size();++i)
            if (!viz[v[s][i].first])
                D[v[s][i].first]=min(D[s]+v[s][i].second,D[v[s][i].first]);
        for (s=0,i=2;i<=n;++i)
            if (!viz[i] && D[s]>D[i]) s=i;
        viz[s]=1;
    }
    for (i=2;i<=n;++i)
        if (D[i]!=INT_MAX) printf("%d ",D[i]);
        else printf("0 ");
    printf("\n");
    return 0;
}