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

    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
    HintINPUT DETAILS: 

    There are five landmarks. 

    OUTPUT DETAILS: 

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


    最短路裸题。


    #include <cstdio>
    #include <algorithm>
    #include <functional>
    #include <cstring>
    #include <queue>
    using namespace std;
    const int maxn=10100,inf=0x7fffffff;
    struct node{
        int u,v,w,next;
    }edge[maxn];
    int pre[maxn],dis[maxn],n,e,cnt;
    bool vis[maxn];
    void init(){
        memset(pre,-1,sizeof(pre));
        cnt=0;
    }
    void add(int u,int v,int c){
        edge[cnt].u=u;
        edge[cnt].w=c;
        edge[cnt].v=v;
        edge[cnt].next=pre[u];
        pre[u]=cnt++;
    }
    void spfa(int s){
        memset(vis,false,sizeof(vis));
        for (int i=0;i<=n;i++) dis[i]=inf;
        dis[s]=0,vis[s]=1;
        queue<int>q;
        q.push(s);
        while(!q.empty()){
            int u=q.front();
            q.pop();
            vis[u]=false;
            for (int i=pre[u]; i!=-1; i=edge[i].next){
                int v=edge[i].v,w=edge[i].w;
                if(dis[v]>dis[u]+w){
                    dis[v]=dis[u]+w;
                    if(!vis[v]){
                        vis[v]=1;
                        q.push(v);
                    }
                }
            }
        }
    }
    int main(){
        int u,v,w;
        while(~scanf("%d%d",&e,&n)){
            init();
            while(e--){
                scanf("%d%d%d",&u,&v,&w);
                add(u,v,w),add(v,u,w);
            }
            spfa(1);
            printf("%d
    ",dis[n]);
        }
        return 0;
    }
    

  • 相关阅读:
    sql2slack alash3al 开源的又个轻量级工具
    pgspider fetchq 扩展docker镜像
    godns 集成coredns 的demo
    godns 简单dnsmasq 的dns 替换方案
    aviary.sh 一个基于bash的分布式配置管理工具
    使用coredns 的template plugin实现一个xip 服务
    nginx 代理 coredns dns 服务
    基于nginx proxy dns server
    几个不错的geodns server
    spring boot rest api 最好添加servlet.context-path
  • 原文地址:https://www.cnblogs.com/acerkoo/p/9490324.html
Copyright © 2011-2022 走看看