Pagini recente » Cod sursa (job #2110951) | Cod sursa (job #1501426) | Monitorul de evaluare | Cod sursa (job #2039939) | Cod sursa (job #731693)
Cod sursa(job #731693)
#include<fstream>
using namespace std;
#define INF 0x3f3f3f3f
ofstream out("ubuntzei.out");
int n,k,m,d[2000][2000],ubu[2000],x[2000],uz[2000],timp;
void floyd();
void read();
void back(int);
void afis();
int main()
{
read();
floyd();
out<<d[1][n];
return 0;
}
void read()
{
ifstream in("ubuntzei.in");
in>>n>>m;
in>>k;
for(int i=1;i<=k;i++)
in>>ubu[i];
int i,j,c;
for(;m;--m)
{
in>>i>>j>>c;
d[i][j]=d[j][i]=c;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(d[i][j]==0&&i!=j)
d[i][j]=INF;
}
void floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}