Til the Cows Come Home(链式前向星+spfa）

最新推荐文章于 2020-11-13 20:43:10 发布

Techay

最新推荐文章于 2020-11-13 20:43:10 发布

阅读量331

点赞数

分类专栏：最短路

本文链接：https://blog.csdn.net/Techay/article/details/49232689

版权

最短路专栏收录该内容

17 篇文章 0 订阅

订阅专栏

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.
非常裸的题目，就是给出无向图，然后求最短路，以后都是用链式前向星+spfa。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int head[1005],d[1005],leap[1005];
struct Node
{
    int u,v,w,next;
}node[4010];
void add_edge(int u,int v,int w,int tot)
{
    node[tot].u = u;node[tot].v = v;
    node[tot].w = w;
    node[tot].next = head[u];
    head[u] = tot;
}
int main()
{
    #ifdef LOCAL
    freopen("C:\\Users\\巍巍\\Desktop\\in.txt","r",stdin);
    //freopen("C:\\Users\\巍巍\\Desktop\\out.txt","w",stdout);
    #endif // LOCAL
    int t,n;
    while(scanf("%d%d",&t,&n) != EOF)
    {
        for(int i = 1;i <= n;i++)head[i] = -1;
        for(int i = 1;i <= t;i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            add_edge(u,v,w,2*i - 1);
            add_edge(v,u,w,2*i);
        }
        for(int i = 1;i <= n;i++)leap[i] = 0;
        for(int i = 1;i <= n;i++)d[i] = inf;
        queue<int>p;
        p.push(1);
        leap[1] = 1;d[1] = 0;
        while(p.size())
        {
            int u = p.front();p.pop();
            leap[u] = 0;
            for(int i = head[u];i != -1;i = node[i].next)
            {
                int e = node[i].v;
                if(d[e] > d[u] + node[i].w)
                {
                    d[e] = d[u] + node[i].w;
                    if(!leap[e])
                    {
                        p.push(e);
                        leap[e] = 1;
                    }
                }
            }
        }
        printf("%d\n",d[n]);
    }
    return 0;
}