题目来源:poj 2502 Subway
思路:
计算任意两个站点之间的距离。但是这里有地铁距离和步行距离,先计算地铁距离,即一条地铁线的点之间所需时间,再计算所有点之间的步行时间,与之前算的地铁距离作比较,取小的那个。
#include <iostream>
#include <cmath>
using namespace std;
const int maxn = 300;
const double INF = 1e30;
bool vis[maxn];
double dis[maxn];
double G[maxn][maxn];
struct Node
{
double x, y;
} node[maxn];
double dist(Node a, Node b)
{
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
void Dijkstra(int s, int n)
{
for (int i = 1; i <= n; i++)
{
vis[i] = false;
dis[i] = INF;
}
dis[s] = 0;
for (int i = 1; i <= n; i++) //循环n次
{
int u = -1; //使d[u]最小且还没有被访问的结点
double min = INF;
for (int j = 1; j <= n; j++)
{
if (vis[j] == false && dis[j] < min)
{
u = j;
min = dis[j];
}
}
if (u == -1)
{
break;
}
vis[u] = true;
for (int i = 1; i <= n; i++)
{
if (vis[i] == false && G[u][i] != 0 && dis[i] > dis[u] + G[u][i])
{
dis[i] = dis[u] + G[u][i];
}
}
}
}
int main()
{
double v1 = 10000.0 / 60;
double v2 = 40000.0 / 60;
while (scanf("%lf%lf%lf%lf", &node[1].x, &node[1].y, &node[2].x, &node[2].y) == 4)
{
for (int i = 1; i < maxn; i++)
{
for (int j = 1; j < maxn; j++)
{
if (i == j)
{
G[i][j] = 0;
}
else
{
G[i][j] = INF;
}
}
}
int x, y;
int n = 2;
int cnt1 = 3;
while (scanf("%d%d", &x, &y) == 2)
{
if (x == -1 && y == -1)
{
cnt1 = n + 1;
continue;
}
n++;
node[n].x = x;
node[n].y = y;
if (n != cnt1)
{
G[n][n - 1] = G[n - 1][n] = min(G[n][n - 1], dist(node[n - 1], node[n]) / v2); //相邻的站点
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
G[i][j] = min(G[i][j], dist(node[i], node[j]) / v1);
}
}
Dijkstra(1, n);
printf("%.f\n", dis[2]);
}
return 0;
}