A - Til the Cows Come Home

最新推荐文章于 2020-03-08 16:16:01 发布

ZZ --瑞 hopeACMer

最新推荐文章于 2020-03-08 16:16:01 发布

阅读量330

点赞数

分类专栏：最短路文章标签： A - Til the Cows Come Home

本文链接：https://blog.csdn.net/qq_44134712/article/details/86612134

版权

最短路专栏收录该内容

3 篇文章 0 订阅

订阅专栏

A - 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

    Hint
    
  
   INPUT DETAILS:

There are five landmarks.

OUTPUT DETAILS:

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

（典型的最短路题型）

#include <iostream>
#include <string.h>
#define inf 0x3f3f3f3f

using namespace std;

int a,b;
int n[1010][1010];
int disv[1010];
int flag[1010];

void bigboom()
{
    int i,j,k;
    for(i=1; i<=b; i++)
    {
        disv[i]=n[i][1];
    }
    flag[1]=1;
    for(i=1; i<b; i++)
    {
        int g=inf;
        int h;
        for(j=1; j<=b; j++)
        {
            if(flag[j]==0&&disv[j]<g)
            {
                g=disv[j];
                h=j;
            }
        }
        flag[h]=1;
        for(k=1; k<=b; k++)
        {
              if(flag[k]==0&&disv[k]>disv[h]+n[k][h])
              {
                  disv[k]=disv[h]+n[k][h];
              }
        }
    }
    cout << disv[b] << endl;
}

int main()
{
    int i;
    cin >> a >> b;
    memset(n,inf,sizeof(n));
    memset(flag,0,sizeof(flag));
    for(i=1; i<=b; i++)
    {
        n[i][i]=0;
    }
    int u,v,w;
    while(a--)
    {
        cin >> u >> v >> w;
        if(n[u][v]>w)
        {
            n[u][v]=n[v][u]=w;
        }
    }
    bigboom();
    return 0;
}