# BZOJ 1624: [Usaco2008 Open] Clear And Present Danger 寻宝之路【Floyd】

## 1624: [Usaco2008 Open] Clear And Present Danger 寻宝之路

Time Limit: 5 Sec Memory Limit: 64 MB

Description

Input

Output

Sample Input

3 4
1
2
1
3
0 5 1
5 0 2
1 2 0
INPUT DETAILS:
There are 3 islands and the treasure map requires Farmer John to
visit a sequence of 4 islands in order: island 1, island 2, island
1 again, and finally island 3. The danger ratings of the paths are
given: the paths (1, 2); (2, 3); (3, 1) and the reverse paths have
danger ratings of 5, 2, and 1, respectively.

Sample Output

7
OUTPUT DETAILS:
He can get the treasure with a total danger of 7 by traveling in
the sequence of islands 1, 3, 2, 3, 1, and 3. The cow map’s requirement
(1, 2, 1, and 3) is satisfied by this route. We avoid the path
between islands 1 and 2 because it has a large danger rating.

#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,a[10005],f[105][105],Ans;
int main(){
#ifndef ONLINE_JUDGE
freopen("prob.in","r",stdin);
freopen("prob.out","w",stdout);
#endif
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) scanf("%d",&f[i][j]);
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) f[i][j]=min(f[i][k]+f[k][j],f[i][j]);
for(int i=1;i<m;i++) Ans+=f[a[i]][a[i+1]];
printf("%d\n",Ans);
return 0;
}
posted @ 2018-05-15 20:44  XSamsara  阅读(92)  评论(0编辑  收藏  举报