Cod sursa(job #1310965)

Utilizator lehman97Dimulescu David lehman97 Data 7 ianuarie 2015 15:47:17
Problema Algoritmul lui Dijkstra Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.12 kb
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;

FILE *f=fopen("dijkstra.in","r");
FILE *g=fopen("dijkstra.out","w");

const int dim=200000,inf=1<<30;
vector< pair<int,int> > v[dim];
int n,m,d[dim],poz[dim],j,k;
void citire()
{
    int x,y,z;
    fscanf(f,"%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        fscanf(f,"%d%d%d",&x,&y,&z);
        v[x].push_back(make_pair(y,z));
    }
}
void dijkstra()
{
    for(int i=2;i<=n;++i)
        d[i]=inf;
    for(int i=1;i<=n;++i)
    {
        int min=inf,pmin;
        for(j=1;j<=n;++j)
            if(!poz[j] && min>d[j])
            {
                min=d[j];
                pmin=j;

            }
        poz[pmin]=1;
        for(k=0;k<v[pmin].size();++k)
        {

            if(d[v[pmin][k].first]>d[pmin]+v[pmin][k].second)
                d[v[pmin][k].first]=d[pmin]+v[pmin][k].second;
        }
    }
}

void scriere()
{
    int i;
    for(i=2;i<=n;i++)
    if(d[i]==inf)fprintf(g,"%d ",0); else fprintf(g,"%d ",d[i]);

}
int main()
{
    citire();
    dijkstra();
    scriere();
    return 0;
}