Cod sursa(job #165090)

Utilizator hadesgamesTache Alexandru hadesgames Data 25 martie 2008 13:28:05
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <stdio.h>
struct ceva
{
	int v,p;
};
ceva *a[50001];
int e[50001],k,n,i,A,B,C,m;
int main()
{
	FILE *in,*out;
	in=fopen("dijkstra.in","r");
	out=fopen("dijkstra.out","w");
	fscanf(in,"%d%d",&n,&m);
	for (i=1;i<=m;i++)
	{
		fscanf(in,"%d%d%d",&A,&B,&C);
		e[A]++;
	}
	fclose(in);
	in=fopen("dijkstra.in","r");
	fscanf(in,"%d",&n);
	*a[0]=new ceva[3];
	for (i=1;i<=n;i++)
		*a[i]=new ceva[e[i]+1];
	for (i=1;i<=m;i++)
	{
		fscanf(in,"%d%d%d",&A,&B,&C);
		a[A][0].v++;
		a[A][a[A][0].v].v=C;
		a[A][a[A][0].v].p=B;
	}
	k=n;
		
	fclose(in);
	fclose(out);
		

	
}