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

    Time Limit: 1000MS
    Memory Limit: 65536K

    Total Submissions: 59755
    Accepted: 20336

    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

    USACO 2004 November

    题解:

            ①啊其实就是粘一个BFS-SPFA的板子。

    #include<stdio.h>
    #define go(i,a,b) for(int i=a;i<=b;i++)
    #define fo(i,a,x) for(int i=a[x],v=e[i].v;i;i=e[i].next,v=e[i].v)
    struct E{int v,next,w;}e[5002];
    int n,m,head[2003],d[2003],k=1,U,V,W;
    void ADD(int u,int v,int w){e[k]=(E){v,head[u],w};head[u]=k++;}
    void dfs(int u){fo(i,head,u)if(d[u]+e[i].w<d[v])d[v]=d[u]+e[i].w,dfs(v);}
    int main()
    {
    	scanf("%d%d",&m,&n);
    	go(i,1,m)scanf("%d%d%d",&U,&V,&W),ADD(U,V,W),ADD(V,U,W);
    	go(i,1,n)d[i]=1e9;d[1]=0;dfs(1);printf("%d
    ",d[n]);return 0;
    }//Paul_Guderian

    你要成为那美丽的向阳花,在布满创痛的凄风苦雨中,

    坚韧地辉煌地绽放……——————汪峰《向阳花》

  • 相关阅读:
    重拾安卓_01_安卓开发环境搭建(eclipse)
    重拾安卓_01_安卓开发环境搭建(android studio)
    【BZOJ】1038: [ZJOI2008]瞭望塔
    【BZOJ】2178: 圆的面积并
    【UR #4】元旦三侠的游戏(博弈论+记忆化)
    【BZOJ】1027: [JSOI2007]合金(凸包+floyd)
    【POJ】1151 Atlantis(线段树)
    【POJ】1228 Grandpa's Estate(凸包)
    【POJ】1556 The Doors(计算几何基础+spfa)
    【POJ】1113 Wall(凸包)
  • 原文地址:https://www.cnblogs.com/Damitu/p/7667071.html
Copyright © 2011-2022 走看看