（HDU4198）Quick out of the Harbour-BFS-优先队列

Quick out of the Harbour

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2025    Accepted Submission(s): 853

 

Problem Description

Captain Clearbeard decided to go to the harbour for a few days so his crew could inspect and repair the ship. Now, a few days later, the pirates are getting landsick(Pirates get landsick when they don't get enough of the ships' rocking motion. That's why pirates often try to simulate that motion by drinking rum.). Before all of the pirates become too sick to row the boat out of the harbour, captain Clearbeard decided to leave the harbour as quickly as possible.
Unfortunately the harbour isn't just a straight path to open sea. To protect the city from evil pirates, the entrance of the harbour is a kind of maze with drawbridges in it. Every bridge takes some time to open, so it could be faster to take a detour. Your task is to help captain Clearbeard and the fastest way out to open sea.
The pirates will row as fast as one minute per grid cell on the map. The ship can move only horizontally or vertically on the map. Making a 90 degree turn does not take any extra time.

 

 

Input

The first line of the input contains a single number: the number of test cases to follow. Each test case has the following format:
1. One line with three integers, h, w (3 <= h;w <= 500), and d (0 <= d <= 50), the height and width of the map and the delay for opening a bridge.
2.h lines with w characters: the description of the map. The map is described using the following characters:
—"S", the starting position of the ship.
—".", water.
—"#", land.
—"@", a drawbridge.
Each harbour is completely surrounded with land, with exception of the single entrance.

 

 

Output

For every test case in the input, the output should contain one integer on a single line: the travelling time of the fastest route to open sea. There is always a route to open sea. Note that the open sea is not shown on the map, so you need to move outside of the map to reach open sea.

 

 

Sample Input

2

6 5 7

#####

#S..#

#@#.#

#...#

#@###

#.###

4 5 3

#####

#S#.#

#@..#

###@#

Sample Outpu

16 11

题目分析：

题目大意就是一个迷宫给你起始位置问怎么在最小的时间（代价）内出去。这里要用到优先队列，为什么要用优先队列，且听我慢慢道来，每次从当前位置可以向四个方向行驶，但不同情况下的代价不同，及当走到有桥（‘@’）的位置，代价为d+1（等待桥开为d，走到当前桥的位置为1）,没有桥且可走（‘.’）的情况下代价为1。同一层（每次可以探测的四个方向，四个方向为一层）不同情况代价不同，问从起始状态到目标状态的最小代价，用BFS+优先队列。

代码：

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
struct Node {
	int x;
	int y;
	int step;
	Node(int x = 0, int y = 0, int step = 0) {
		this->x = x;
		this->y = y;
		this->step = step;
	}
	bool operator<(const Node &a) const {
		return step > a.step;
	}
};
int n,h, w, d;
char maze[502][502];
int visit[502][502];
Node p[4] = { {0,1,1}, {1,0,1}, {0,-1,1}, {-1,0,1} };
priority_queue<Node> q;		//优先队列，step小的优先级高
void bfs() {
	Node temp;
	while (!q.empty()) {
		temp = q.top();
		q.pop();
		//结束状态
		if (temp.x == 0 || temp.x == h - 1 || temp.y == 0 || temp.y == w - 1) {
			cout << temp.step + 1 << endl;
			return;
		}
		int x1, y1, s1;
		//向四个方向去探测
		for (int i = 0; i < 4; i++) {
			x1 = temp.x + p[i].x;
			y1 = temp.y + p[i].y;
			s1 = temp.step + p[i].step;
			if (!visit[x1][y1]) {
				visit[x1][y1] = 1;
				if (maze[x1][y1] == '@')s1 = s1 + d;
				q.push(Node(x1,y1,s1));
			}
		}
	}
}

int main() {
	cin >> n;
	while (n--) {
		cin >> h >> w >> d;
		while (!q.empty())q.pop();
		memset(visit, 0, sizeof(visit));
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				cin >> maze[i][j];
				if (maze[i][j] == 'S') { q.push(Node(i, j, 0)); visit[i][j] = 1; }
				if (maze[i][j] == '#')visit[i][j] = 1;
			}
		}
		bfs();
	}
	return 0;
}