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.
摘抄ppt
题意:第一行给出两个整数m,n,接下来m行每行三个数a,b,c代表从a到b有一条长度为c的路径,问从n到1的最短路。
做法:简单的dijkstra即可。
注意可能有重边。
重边,重边,贡献了好多次wa。。。
其实也很简单,不要开数组按点存,按边存就可以了。
最短路入门题
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdio>
#include<queue>
using namespace std;
vector<int>v[1005];
vector<int>w[1005];
queue<int>q;
int m,n,dis[1005];
bool b[1005];
void spfa(int s,int e)
{
memset(dis,0x7f,sizeof(dis));
dis[s]=0;
q.push(s);
b[s]=1;
while(!q.empty())
{
int u=q.front();
for(int i=0;i<v[u].size();i++)
if(dis[v[u][i]]>dis[u]+w[u][i])
{
dis[v[u][i]]=dis[u]+w[u][i];
if(!b[v[u][i]])
{
q.push(v[u][i]);
b[v[u][i]]=1;
}
}
b[u]=0;
q.pop();
}
printf("%d\n",dis[e]);
}
int main()
{
scanf("%d%d",&m,&n);
for(int i=1;i<=m;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
v[x].push_back(y);
v[y].push_back(x);
w[x].push_back(z);
w[y].push_back(z);
}
spfa(n,1);
return 0;
}