Cod sursa(job #378489)

Utilizator bent_larsenSturzu Antonio-Gabriel bent_larsen Data 28 decembrie 2009 19:09:38
Problema Algoritmul lui Dijkstra Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<stdio.h>
#include<vector>
#define pb push_back
#define mp make_pair 
#define inf 50000001

using namespace std;

int main()
{
	int n,m,i,a,b,c,d[50001],min,viz[50001],nod,j;
	vector< pair<int,int> > v[50001];
	FILE *f=fopen("dijkstra.in","r");

	fscanf(f,"%i%i",&n,&m);
	for(i=0;i<m;i++)
	{
		fscanf(f,"%i%i%i",&a,&b,&c);
		v[a].pb(mp(b,c));
	}
	fclose(f);

	d[1]=0;
	for(i=2;i<=n;i++)
		d[i]=inf;

	for(;;)
	{
		min=inf;
		for(i=1;i<=n;i++)
		{
			if(viz[i]==0 && d[i]<min)
			{
				min=d[i];
				nod=i;
			}
		}
		if(min==inf)
			break;
		viz[nod]=1;
		for(j=0;j<(int) v[nod].size();j++)
		{
			if(v[nod][j].second+d[nod]<d[v[nod][j].first])
				d[v[nod][j].first]=v[nod][j].second+d[nod];
		}
	}
	f=fopen("dijkstra.out","w");
	for(i=2;i<=n;i++)
	{
		if(d[i]==inf)
			d[i]=0;
		fprintf(f,"%i ",d[i]);
	}
	fprintf(f,"%s","\n");
	fclose(f);
	return 0;
}