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

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 45515   Accepted: 15434

    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
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 using namespace std;
     5 int w[1010][1010],dis[1010],team[1010*8];
     6 bool exist[1010];
     7 void SPFA(int s)
     8 {
     9     int head=0,tail=1,k=0;
    10     team[head]=s;
    11     dis[s]=0;
    12     while(head<tail)
    13     {
    14         k=team[head];
    15         exist[k]=false;
    16         for(int i=s;i>=1;i--)
    17         {
    18             if((w[k][i]>0)&&(dis[i]>dis[k]+w[k][i]))
    19             {
    20                 dis[i]=dis[k]+w[k][i];
    21                 if(!exist[i])
    22                 {
    23                     team[tail++]=i;
    24                     exist[i]=true;
    25                     
    26                  } 
    27             }
    28         }
    29         head++;
    30     }
    31 //    return dis[n];
    32 }
    33 int main()
    34 {
    35     int T,N,x,y,z;
    36     cin>>T>>N;
    37     for(int i=1;i<=T;i++)
    38     {
    39         cin>>x>>y>>z;
    40         if(w[x][y]==0) w[x][y]=w[y][x]=z;
    41         else if(w[x][y]>z) w[y][x]=w[x][y]=z;
    42         
    43     }
    44     for(int i=1;i<=1100;i++) dis[i]=999999;
    45     SPFA(N);
    46     cout<<dis[1];
    47     return 0;
    48 }
    View Code
  • 相关阅读:
    开启power management功能有坑,ESP32串口频繁出现UART_BREAK中断
    ESP32音频开发板ESP32-Korvo V1.1踩坑
    驱动开发常用位运算
    ESP8266 RTOS 开发笔记(4)串口透传
    mosquitto服务状态监控(转载)
    ESP8266 RTOS 开发笔记(3)用户参数
    ESP8266 RTOS 开发笔记(2)TCP Client+Server
    ESP8266 RTOS 开发笔记(1)STA+AP模式(共存)
    C uint32 转 uint8
    python 简易计算器(只能计算加减乘除和括号)
  • 原文地址:https://www.cnblogs.com/suishiguang/p/5877116.html
Copyright © 2011-2022 走看看