zoukankan      html  css  js  c++  java
  • POJ 2387 Til the Cows Come Home

    http://poj.org/problem?id=2387

    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

    题解:dijkstra 重边!!!!!!!!!!

    代码:

    #include <stdio.h>
    #include <string.h>
    #include <iostream>
    using namespace std;
    
    #define inf 0x3f3f3f3f
    int N, T;
    int vis[2010], dis[2010];
    int mp[2010][2010];
    
    int dijkstra(int st) {
        memset(vis, 0, sizeof(vis));
        memset(dis, inf, sizeof(dis));
    
    
        for(int i = 1; i <= N; i ++) {
            if(i == N) dis[i] = 0;
            else dis[i] = mp[N][i];
        }
        int temp = st;
    
        for(int i = 1; i <= N; i ++) {
            int minn = inf;
            for(int j = 1; j <= N; j ++) {
                if(dis[j] < minn && vis[j] == 0) {
                    temp = j;
                    minn = dis[j];
                }
            }
            vis[temp] = 1;
            for(int k = 1; k <= N; k ++)
                dis[k] = min(dis[k], dis[temp] + mp[temp][k]);
        }
        return dis[1];
    }
    
    int main() {
        scanf("%d%d", &T, &N);
        memset(mp, inf, sizeof(mp));
        for(int i = 1; i <= T; i ++) {
            int s, t, cost;
            scanf("%d%d%d", &s, &t, &cost);
            if(cost < mp[s][t]) {
                mp[s][t] = cost;
                mp[t][s] = mp[s][t];
            }
        }
    
        int ans = dijkstra(N);
        printf("%d
    ", ans);
        return 0;
    }
    

      

  • 相关阅读:
    Python JPype 在 Win7 下安装与使用
    Visual Studio 2010 下 安装RGiesecke.DllExport
    python简单搭建HTTP Web服务器
    C 语言中 malloc、calloc、realloc 和free 函数的使用方法
    Anaconda 安装 ml_metrics package
    第28章 java反射机制
    第26章 java进制操作
    第27章 java I/O输入输出流
    第25章 网络编程
    第23章 java线程通信——生产者/消费者模型案例
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9732720.html
Copyright © 2011-2022 走看看