Til the Cows Come Home/最短路

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.

题意

Bessie在田里，想回谷仓，农场有n个点，T条双向道路，Bessie在n点的苹果树下想尽快回到在1点的谷仓问，求最小距离让Bessie尽快回到谷仓。

解法

就是求1到n的最短路，模板题，我用的是spfa做的。

代码：

#include <stdio.h>
#include <cstring>
#include <queue> 
using namespace std;
queue <int > Q;
int t,n,a,b,c,dis[1010],map[1010][1010];
bool f[1010];

void spfa()
{
	Q.push(1);
	dis[1]=0;
	f[1]=true;
	while (!Q.empty())
	{
		int now=Q.front();
		Q.pop();
		f[now]=false;
		for (int i=1;i<=n;i++) 
		{
			if (map[now][i]==1000000) continue;
			if (dis[now]+map[now][i]<dis[i]) 
			{
				dis[i]=dis[now]+map[now][i];
				if (!f[i]) 
				{
					f[i]=true;
					Q.push(i);
				}
			}
 		}
	}
}

int main()
{
	scanf("%d%d",&t,&n);
	for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) map[i][j]=1000000;
	for (int i=1;i<=n;i++) dis[i]=1000000;
	for (int i=1;i<=t;i++) 
	{
		scanf("%d%d%d",&a,&b,&c);
		if (c<map[a][b]) map[a][b]=map[b][a]=c;
	}
	spfa();
	printf("%d",dis[n]);
	return 0;
}