zoukankan      html  css  js  c++  java
  • BZOJ_1624_ [Usaco2008_Open]_Clear_And_Present_Danger_寻宝之路_(最短路_Floyd)

    描述


    http://www.lydsy.com/JudgeOnline/problem.php?id=1025

    给出(n)个点以及之间的边的长度,给出必须访问的点的顺序,求最短路线长度.

    分析


    用Floyd求多源最短路,然后加起来就好了.

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 
     4 const int maxn=100+5,maxm=10000+5;
     5 int n,m,ans;
     6 int a[maxm];
     7 int d[maxn][maxn];
     8 inline int read(int &x){x=0;int k=1;char c;for(c=getchar();c<'0'||c>'9';c=getchar())if(c=='-')k=-1;for(;c>='0'&&c<='9';c=getchar())x=x*10+c-'0';return x*=k;}
     9 int main(){
    10     read(n); read(m);
    11     for(int i=1;i<=m;i++) read(a[i]);
    12     for(int i=1;i<=n;i++)for(int j=1;j<=n;j++) read(d[i][j]);
    13     for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
    14         d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    15     for(int i=1;i<m;i++) ans+=d[a[i]][a[i+1]];
    16     printf("%d
    ",ans);
    17     return 0;
    18 }
    View Code

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

    Time Limit: 5 Sec  Memory Limit: 64 MB
    Submit: 570  Solved: 379
    [Submit][Status][Discuss]

    Description

        农夫约翰正驾驶一条小艇在牛勒比海上航行.
        海上有N(1≤N≤100)个岛屿,用1到N编号.约翰从1号小岛出发,最后到达N号小岛.一
    张藏宝图上说,如果他的路程上经过的小岛依次出现了 Ai,A2,…,AM(2≤M≤10000)这样的序列(不一定相邻),那他最终就能找到古老的宝藏.  但是,由于牛勒比海有海盗出没.约翰知道任意两 个岛屿之间的航线上海盗出没的概率,他用一个危险指数Dij(0≤Dij≤100000)来描述.他希望他的寻宝活动经过的航线危险指数之和最小.那么, 在找到宝藏的前提下,这个最小的危险指数是多少呢?

    Input

        第1行输入N和M,之后M行一行一个整数表示A序列,之后输入一个NxN的方阵,表示两两岛屿之间航线的危险指数.数据保证Dij=Dji,Dii=0.

    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.

    HINT

    Source

  • 相关阅读:
    python之路_socketserver模块
    java 字符串String操作工具类
    maven常用插件
    查杀oracle锁表
    正则表达式汇总
    javascript 数组操作
    javascript中sleep等待实现
    js获取服务端IP及端口及协议
    log4j中的MDC和NDC
    如何设置(修改)jetty(maven插件maven-jetty-plugi)的端口
  • 原文地址:https://www.cnblogs.com/Sunnie69/p/5649014.html
Copyright © 2011-2022 走看看