Pagini recente » Cod sursa (job #820473) | Cod sursa (job #818257) | Cod sursa (job #225729) | Cod sursa (job #1067407) | Cod sursa (job #731711)
Cod sursa(job #731711)
#include<fstream>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
ofstream out("ubuntzei.out");
int n,k,m,d[2000][2000],ubu[2000],x[2000],uz[2000],timp,ans=INF;
void floyd();
void read();
void back(int);
void afis();
int main()
{
read();
floyd();
if(k>0)
{
back(1);
out<<ans;
}
else
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];
memset(d, INF, sizeof d);
for (int i = 1; i <= n; ++ i)
d[i][i] = 0;
int i,j,c;
for(;m;--m)
{
in>>i>>j>>c;
d[i][j]=d[j][i]=c;
}
}
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]);
}
void back(int K)
{
for(int i=1;i<=k;i++)
if(!uz[i])
{
x[K]=i;
uz[i]=1;
if(K==k)
afis();
else
back(K+1);
uz[i]=0;
}
}
void afis()
{
timp=d[1][ubu[x[1]]]+d[ubu[x[k]]][n];
for(int i=1;i<k;++i)
timp+=d[ubu[x[i]]][ubu[x[i+1]]];
ans=min(ans,timp);
}