Pagini recente » Cod sursa (job #2701590) | Cod sursa (job #397649) | Cod sursa (job #3181606) | Cod sursa (job #517211) | Cod sursa (job #1535017)
#include<fstream>
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
int n,m,i,j,v[205],k,rez,o;
bool ok;
int x,y,c,a[2005][2005];
int main()
{
f>>n>>m;
f>>o;
for(i=1;i<=o;i++)
f>>v[i];
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
a[x][y]=a[y][x]=c;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0&&a[k][j]!=0&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0)&&i!=j)
a[i][j]=a[j][i]=a[i][k]+a[k][j];
if(o==0)
g<<a[1][n];
else if(o==1)
g<<a[1][v[1]]+a[v[1]][n];
return 0;
}