题目链接
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
大致题意
第一行T和N,表示T条路线以及N个村庄
接下来给出相通 的两个村庄以及两个村庄之间的距离
问从1到N的最短路径(可能重边)
具体思路
dijkstra裸题,后面做的差不多再整理一下dijkstra和spaf的区别
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
vector< pair<int,int> >line[1005];
int n,dis[1005],flag[1005];
void dijkstra(int from)
{
memset(flag,0,sizeof(flag));
fill(dis,dis+1005,0x7fffffff);
dis[from]=0;
flag[from]=1;
queue<int>dui;
dui.push(from);
while (!dui.empty())
{
int now=dui.front();
dui.pop();
flag[now]=0;
for (int i=0;i<line[now].size();i++)
{
if (dis[now]+line[now][i].second<dis[line[now][i].first])
{
dis[line[now][i].first]=dis[now]+line[now][i].second;
if (flag[line[now][i].first]==0)
{
flag[line[now][i].first]=1;
dui.push(line[now][i].first);
}
}
}
}
}
int main()
{
int t,n;
scanf("%d %d",&t,&n);
while (t--)
{
int from,to,cost,flag=0;
scanf("%d %d %d",&from,&to,&cost);
for (int i=1;i<line[from].size();i++)
{
if (line[from][i].first==to)
{
line[from][i].second=min(cost,line[from][i].second);
flag=1;
break;
}
}
if (flag==0)
line[from].push_back(make_pair(to,cost));
flag=0;
for (int i=1;i<line[to].size();i++)
{
if (line[to][i].first==from)
{
line[to][i].second=min(cost,line[to][i].second);
flag=1;
break;
}
}
if (flag==0)
line[to].push_back(make_pair(from,cost));
}
dijkstra(1);
printf("%d\n",dis[n]);
return 0;
}