Pagini recente » Cod sursa (job #409638) | Cod sursa (job #2192632) | Cod sursa (job #3186552) | Cod sursa (job #1601484) | Cod sursa (job #1867111)
#include <fstream>
#include <iostream>
#define infinit 100005
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
int viz[2005],d[2005],t[2005],c[2005][2005],n,m,k,x0=1,v[2005];
void citire()
{
int i,j,x,y,dist;
f>>n>>m>>k;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
c[i][j]=infinit;
for(i=1;i<=k;i++)
f>>v[i];
for(i=1;i<=m;i++)
{
f>>x>>y>>dist;
c[x][y]=dist;
}
}
void dijkstra(int x0)
{
int minn,k,ok,i,j;
for(i=1;i<=n;i++)
{
d[i]=c[x0][i];
t[i]=x0;
viz[i]=0;
}
t[x0]=0;
viz[x0]=1;
ok=1;
while(ok)
{
minn=infinit;
for(i=1;i<=n;i++)
if(!viz[i] && minn>d[i])
{
minn=d[i];
k=i;
}
if(minn!=infinit)
{
viz[k]=1;
for(i=1;i<=n;i++)
if(!viz[i] && d[i]>d[k]+c[k][i])
{
d[i]=d[k]+c[k][i];
t[i]=k;
}
}
else
ok=0;
}
}
void drum(int x)
{
if(t[x])
{
drum(t[x]);
g<<", "<<x;
}
else
g<<x;
}
int main()
{
citire();
dijkstra(x0);
g<<d[n];
return 0;
}