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.
- 因为结点数为1000,如果用弗洛伊德最短路会超时,需要用迪杰斯特拉。
- 这道题应该就是很普通的板子题,虽然做的过程也很曲折。
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f, N = 1005;
int ma[N][N];
int dis[N];
bool vis[N];
int n, m, st, ed;
void init()
{
//初始化ma数组
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
ma[i][j] = (i == j ? 0 : INF);
}
void Dijk()
{
for (int i = 0; i < n - 1; i++){
int minv = INF, k;//k用来存储最小的且没被松弛过的城市
for (int j = 1; j <= n; j++){
if (minv > dis[j] && !vis[j]){
minv = dis[j];
k = j;
}
}
vis[k] = 1;
for (int h = 1; h <= n; h++)
dis[h] = min(dis[h], dis[k] + ma[k][h]);
}
}
int main(void)
{
int a, b, c;
cin >> m >> n;
//初始化ma数组
init();
for (int i = 0; i < m; i++){
cin >> a >> b >> c;
if (ma[a][b] > c)
ma[a][b] = ma[b][a] = c;
}
//输入起点和终点
st = n, ed = 1;
//初始化dis数组
for (int i = 1; i <= n; i++)
dis[i] = ma[st][i];
//初始化vis数组
memset(vis, 0, sizeof vis);
vis[st] = 1;
Dijk();
cout << (dis[ed] == INF ? -1 : dis[ed]) << endl;
return 0;
}