POJ-2502（需要自己建图的Dijkstra）

居然不知道Dijkstra是个什么玩意儿了，悲催

struct point
{
	int x;
	int y;
} p[505];
double d[505][505];
double distance(int x1, int y1, int x2, int y2)
{
	return sqrt(1.0 * (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
#define N 505
bool visit[N];
double dis[N];
#define MAX_DISTANCE 10000000000.0
double Dijkstra(int n, int s, int t, double g[][N])
{
	int i, j, p;
	memset(visit, 0, sizeof(visit));
	for (i = 1; i <= n; ++i) dis[i] = MAX_DISTANCE;
	dis[s] = 0.0;
	for (i = 1; i <= n; ++i) {
		p = -1;
		for (j = 1; j <= n; ++j) {//找到没访问过而且距离源点最近的点
			if (visit[j] == 0 && (p == -1 || dis[j] < dis[p])) {
				p = j;
			}
		}
		visit[p] = 1;//访问之
		if (p == t) break;
		for (j = 1; j <= n; ++j) {
			if (visit[j] == 0 && g[p][j] != 0 && dis[p] + g[p][j] < dis[j]) {
				dis[j] = dis[p] + g[p][j];
			}
		}
	}
	return dis[t];
}
int main()
{
	int i, j;
	scanf("%d%d%d%d", &p[1].x, &p[1].y, &p[2].x, &p[2].y);
	int x, y;
	int index = 3;
	int flag = 0;
	while (scanf("%d%d", &x, &y) == 2) {
		if (x == -1 && y == -1) {
			flag = 0;
			continue;
		}
		p[index].x = x;
		p[index].y = y;
		if (flag) {
			d[index - 1][index] = d[index][index - 1] = distance(p[index - 1].x, p[index - 1].y, p[index].x, p[index].y) / 40000;
		}
		flag = 1;
		++index;
	}
	--index;
	for (i = 1; i <= index; ++i) {
		for (j = 1; j <= index; ++j) {
			if (j == i || d[i][j]) continue;
			d[i][j] = d[j][i] = distance(p[i].x, p[i].y, p[j].x, p[j].y) / 10000;
		}
	}
	printf("%.0lf\n", Dijkstra(index, 1, 2, d) * 60);
	return 0;
}