zoukankan      html  css  js  c++  java
  • (Dijkstra) POJ2387 Til the Cows Come Home

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

    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

    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cstdio>
    using namespace std;
    const int maxn = 1010;
    const int INF = 0x3f3f3f3f;
    int mp[maxn][maxn],dis[maxn],vis[maxn];
    int edge,node;
    void dijkstra(){
        for(int i = 1; i <= node; i++){
            dis[i] = mp[1][i];
        }
        for(int i = 1; i < node; i++){
            int minn = INF,u;
            for(int j = 1; j <= node; j++){
                if(vis[j] == 0 && dis[j] < minn){
                    minn = dis[j];
                    u = j;
                }
            }
            vis[u] = 1;
            for(int j = 1; j <= node; j++){
                if(vis[j] == 0 && dis[u] + mp[u][j] < dis[j]){
                    dis[j] = mp[u][j] + dis[u];
                }
            }
        }
        printf("%d
    ",dis[node]);
    }
    int main(){
        while(~scanf("%d%d",&edge,&node)){
            for(int i = 1; i <= node; i++){
                for(int j = 1; j <= node; j++){
                    if(i==j)
                        mp[i][j] = 0;
                    else
                        mp[i][j] = INF;
                }
            }
            memset(vis,0,sizeof(vis));
            int m,n,t;
            for(int i = 0; i < edge; i++){
                scanf("%d%d%d",&n,&m,&t);
                if(t < mp[m][n]){
                    mp[m][n] = mp[n][m] = t;
                }
            }
            dijkstra();
        }
        return 0;
    }
    View Code
  • 相关阅读:
    win7下DS、KS、ASIO、WASAPI输出比较
    什么叫时钟漂移(Wander)?时钟漂移与时钟抖动(jitter)的区别
    常见编译/链接错误及其解决办法
    理解 Visual C++ 应用程序的依赖项(msdn)
    初识windows语音采集和回放
    依赖关系、概况关系、关联关系等概念
    VS2010工程转VS2005工程的方法
    speech codec (G.711, G.723, G.726, G.729, iLBC)
    【转】深入剖析iLBC的丢包补偿技术(PLC)
    CSS优先级问题
  • 原文地址:https://www.cnblogs.com/Weixu-Liu/p/10417903.html
Copyright © 2011-2022 走看看