URAL 1254 Die Hard (SPFA)

最新推荐文章于 2022-01-14 10:10:09 发布

tiutiu2011

最新推荐文章于 2022-01-14 10:10:09 发布

阅读量617

点赞数

分类专栏： Talk is cheap Show me the code ACM-ICPC 文章标签： URAL 1254 Die Hard SPFA

本文链接：https://blog.csdn.net/tiutiu2011/article/details/48783185

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define MAX_SIZE 75
#define MAX_BOMBS 1000
#define SQUARE_ROOT_2 1.414213562373095048
#define MAX_DISTANCE 5626

int xSize, ySize, numOfBombs;
double velocity;
char map[MAX_SIZE + 1][MAX_SIZE + 1];
typedef struct Location{
	int x;
	int y;
}Location;
Location queue[10000];//注意数组别开小了
int head, tail;
Location directionArray[8] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}, {1, -1}, {1, 1}, {-1, 1}, {-1, -1}};
double distanceArray[MAX_BOMBS + 1][MAX_BOMBS + 1];
double totalDistance;

void printfDistance(){
	int x, y;
	for (y = 1; y <= ySize; y++){
		for (x = 1; x <= xSize; x++)
			printf("%7.2lf ", distanceArray[y][x]);
		printf("\n");
	}
	printf("\n");		
}

int main(){

	scanf("%d%d%d%lf", &xSize, &ySize, &numOfBombs, &velocity);

	int y, x;
	for (y = 1; y <= ySize; y++)
		for (x = 1; x <= xSize; x++)
			scanf(" %c", &map[y][x]);

	Location LocationPushed;
	scanf("%d%d", &LocationPushed.x, &LocationPushed.y);

	int bomb;
	for (bomb = 1; bomb <= numOfBombs; bomb++){
		Location bombLocation;
		scanf("%d%d", &bombLocation.x, &bombLocation.y);

		for (y = 1; y <= ySize; y++)
			for (x = 1; x <= xSize; x++)	
				distanceArray[y][x] = MAX_DISTANCE;

		head = tail = 0;
		queue[tail++] = LocationPushed;
		distanceArray[LocationPushed.y][LocationPushed.x] = 0;

		//SPFA:注意不能用简单的BFS，因为有每个点有多条边，先到的路径不一定就是路程最短的路径
		while (head < tail){
			Location LocationPoped = queue[head++];
			int directionIndex;
			for (directionIndex = 0; directionIndex < 8; directionIndex++){
				x = LocationPoped.x + directionArray[directionIndex].x;
				y = LocationPoped.y + directionArray[directionIndex].y;
				if (x < 1 || x > xSize || y < 1 || y > ySize || map[y][x] == '#')
					continue;
				//注意是路程最短的点，不是常规的最短路径
				double distance = distanceArray[LocationPoped.y][LocationPoped.x] + (directionIndex < 4 ? 1.0 :  1.414213562373095048);
				if (distance < distanceArray[y][x]){
					distanceArray[y][x] = distance;
					LocationPushed.x = x;
					LocationPushed.y = y;
					queue[tail++] = LocationPushed;
				}
			}
		}

		if (distanceArray[bombLocation.y][bombLocation.x] < MAX_DISTANCE){
			totalDistance += distanceArray[bombLocation.y][bombLocation.x];
			LocationPushed = bombLocation;
		} else 
			LocationPushed = queue[0];
	}

	printf("%.2lf\n", totalDistance / velocity);

	return 0;
}