Til the Cows Come Home POJ - 2387
2018-02-22 23:58
204 查看
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
#include<stdio.h>
int p[11000][11000];
int n, m;
int inf = 1000000;
void dijkstra()
{
int k;
int min;
int dis[11000];
int vis[11000];
for (int i = 1; i <= n; i++)
{
dis[i] = p[1][i];
vis[i] = 0;
}
vis[1] = 1;
for (int i = 1; i <= n; i++)
{
min = inf;
for (int j = 1; j <= n; j++)
{
if (!vis[j] && dis[j] < min)
{
min = dis[j];
k = j;
}
}
vis[k] = 1;
for (int j = 2; j <= n; j++)
{
if (!vis[j] && dis[j] > min + p[k][j])
{
dis[j] = min + p[k][j];
}
}
}
printf("%d\n", dis
);}
int main()
{
int i, j, a, b, c;
while (scanf_s("%d%d", &m, &n)!=EOF)
{
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
if (i == j)
p[i][i] = 0;
else p[i][j] = p[j][i] = inf;
}
for (i = 1; i <= m; i++)
{
scanf_s("%d%d%d", &a, &b, &c);
if (p[a][b]>c)
p[a][b] = p[b][a] = c;
}
dijkstra();
}
return 0;
}
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 100Sample Output90
#include<stdio.h>
int p[11000][11000];
int n, m;
int inf = 1000000;
void dijkstra()
{
int k;
int min;
int dis[11000];
int vis[11000];
for (int i = 1; i <= n; i++)
{
dis[i] = p[1][i];
vis[i] = 0;
}
vis[1] = 1;
for (int i = 1; i <= n; i++)
{
min = inf;
for (int j = 1; j <= n; j++)
{
if (!vis[j] && dis[j] < min)
{
min = dis[j];
k = j;
}
}
vis[k] = 1;
for (int j = 2; j <= n; j++)
{
if (!vis[j] && dis[j] > min + p[k][j])
{
dis[j] = min + p[k][j];
}
}
}
printf("%d\n", dis
);}
int main()
{
int i, j, a, b, c;
while (scanf_s("%d%d", &m, &n)!=EOF)
{
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
if (i == j)
p[i][i] = 0;
else p[i][j] = p[j][i] = inf;
}
for (i = 1; i <= m; i++)
{
scanf_s("%d%d%d", &a, &b, &c);
if (p[a][b]>c)
p[a][b] = p[b][a] = c;
}
dijkstra();
}
return 0;
}
相关文章推荐
- POJ-2387-Til the Cows Come Home [最短路]
- POJ 2387 Til the Cows Come Home --最短路模板题
- POJ 2387 Til the Cows Come Home (Spfa)
- POJ 2387 Til the Cows Come Home(Dijkstra算法)
- POJ 2387 Til the Cows Come Home (最短路)
- [POJ - 2387] Til the Cows Come Home(最短路)
- POJ 2387 Til the Cows Come Home 最短路 Dijstra
- POJ 2387 Til the Cows Come Home(最短路,Dijkstra算法)
- 最短路dij——POJ 2387 Til the Cows Come Home题解
- poj 2387 Til the Cows Come Home(最短路径)
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- POJ 2387 Til the Cows Come Home (dijikstra)
- poj 2387 Til the Cows Come Home (最短路问题 注意判重)
- POJ - 2387 Til the Cows Come Home(Dijkstra)
- POJ - 2387 Til the Cows Come Home(Dijkstra SPFA 邻接矩阵 邻接表)
- poj 2387 Til the Cows Come Home(dijkstra算法)
- POJ 2387 Til the Cows Come Home(spfa)
- poj 2387 Til the Cows Come Home(最短路水题 = =)
- POJ 2387 Til the Cows Come Home (最短路+Dijkstra)
- POJ 2387 Til the Cows Come Home (裸SPFA)