Pagini recente » Cod sursa (job #2321552) | Cod sursa (job #2591653) | Cod sursa (job #2321997) | Cod sursa (job #1581812) | Cod sursa (job #873438)
Cod sursa(job #873438)
#include <iostream>
#include<fstream>
using namespace std;
long a[2001][2001],v[2000],kk,k,i,j,m,n,x,y,z;
int main()
{
int s=0,c;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
f>>n>>m;
f>>kk;
for(i=1;i<=kk;i++)
f>>v[i];
for(i=1;i<=m;i++)
{
f>>x>>y>>z;
a[x][y]=z;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]&&a[k][j]&&i!=j&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0))
a[i][j]=a[i][k]+a[k][j];
s=s+a[1][v[1]];c=1;
for(i=2;i<=kk;i++)
{
// cout<<a[c][v[i]]<<" ";
s=s+a[c][v[i]];
c=i;
}
s=s+a[c][n];
/*for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
cout<<endl;
/*for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}*/
g<<s;
return 0;
}