zoukankan      html  css  js  c++  java
  • 超水的一道最短路poj2387

    Til the Cows Come Home
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 68667   Accepted: 23016

    Description

    Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible. 

    Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it. 

    Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.

    Input

    * Line 1: Two integers: T and N 

    * Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.

    Output

    * Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.

    Sample Input

    5 5
    1 2 20
    2 3 30
    3 4 20
    4 5 20
    1 5 100

    Sample Output

    90

    Hint

    INPUT DETAILS: 

    There are five landmarks. 

    OUTPUT DETAILS: 

    Bessie can get home by following trails 4, 3, 2, and 1.

    Source

    直接上spfa侍候。
    才发现自己的博客里面没有关于spfa的学习笔记qwq
     1 #include<iostream>
     2 #include<cstring>
     3 #include<queue>
     4 #include<vector>
     5 #include<algorithm>
     6 using namespace std;
     7 const int inf=0x3f3f3f;
     8 int mp[1006][1006];
     9 int dist[1006];
    10 bool book[1006];
    11 int T,n;
    12 
    13 void spfa()
    14 {
    15     memset( book, 0, sizeof book);
    16     book[1]=1;
    17     queue<int> iop;
    18     iop.push(1);
    19     dist[1]=0;
    20     while( !iop.empty()){
    21         int kop=iop.front();
    22         iop.pop();
    23         for(int i=1;i<=n;i++){
    24             if(dist[kop]+mp[kop][i]<dist[i]){
    25                 dist[i]=dist[kop]+mp[kop][i];
    26                 if(!book[i]){
    27                     book[i]=true;
    28                     iop.push(i);
    29                 }
    30             }
    31         }
    32         book[kop]=false;
    33     }
    34     cout << dist[n] <<endl;
    35 }
    36 
    37 int main()
    38 {
    39     while( cin >> T >> n){
    40         memset( mp, inf, sizeof mp);
    41         memset( dist, inf, sizeof dist);
    42         for(int i=1;i<=T;i++){
    43             int x,y,z;
    44             cin >> x >> y >> z;
    45             mp[x][y]=min( mp[x][y],z);
    46             mp[y][x]=min( mp[y][x],z);
    47         }
    48         spfa();
    49     }
    50     return 0;
    51 }
  • 相关阅读:
    <dependency>
    json、javaBean、xml互转的几种工具介绍
    日志系统logBack的配置以及sdoutAppender控制台输出
    Java中Main函数探讨
    java的Daemon守护线程
    FastJson序列化对象
    多线程情况下获取数据出现的不一致
    苏州地区--校招IT公司
    Spark聚合操作:combineByKey()
    Hadoop初步简介
  • 原文地址:https://www.cnblogs.com/ZQUACM-875180305/p/9074023.html
Copyright © 2011-2022 走看看