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;
    }
    

  • 相关阅读:
    asp.net zero 8.2 学习-9-多租户设置,发送邮件配置
    asp.net zero 8.2 学习-8-实现在页面添加、编辑、删除、查看实体
    asp.net zero 8.2 学习-7-展示实体列表,实现查询,分页,过滤,排序功能
    asp.net zero 8.2 学习-6-权限控制
    asp.net zero 8.2 学习-5-实现增删改查服务及API测试
    asp.net zero 8.2 学习-4-创建接口及服务
    asp.net zero 8.2 学习-3-添加实体,并迁移到数据库
    asp.net zero 8.2 学习-2-创建一个页面
    asp.net zero 8.2 学习-1-安装
    .net core 3.1 jwt认证
  • 原文地址:https://www.cnblogs.com/acerkoo/p/9490324.html
Copyright © 2011-2022 走看看