Pagini recente » Cod sursa (job #20605) | Cod sursa (job #1210803) | Cod sursa (job #1188824) | Cod sursa (job #1258742) | Cod sursa (job #1209161)
#include<fstream>
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
int n,m,l,d[2000],a[2001][2001],min1;
void read()
{
f>>n>>m;
f>>l;
for(int i=1;i<=l;i++) f>>d[i];
for(int i=1;i<=m;i++)
{
int x,y,s;
f>>x>>y>>s;
a[x][y]=s;
a[y][x]=s;
}
}
void solve()
{
int k,i,j;
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
if(i!=k)
for(j=1;j<=n;j++)
{
if(i!=j&&j!=k)
{
if(a[i][k]!=0&&a[k][j]!=0&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0))
{
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
}
int prev=1; int next=0;
min1=0;
for(i=1;i<=l;i++)
{
next=d[i];
min1+=a[prev][next];
prev=next;
}
min1+=a[next][n];
}
void write()
{
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}*/
g<<min1;
}
int main()
{
read();
solve();
write();
return 0;
}