HDU 1312 BFS

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18803    Accepted Submission(s): 11413

Problem Description

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above. 

 

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

'.' - a black tile 
'#' - a red tile 
'@' - a man on a black tile(appears exactly once in a data set) 

 

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself). 

 

Sample Input

  
  

   
   6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0
  
  

 

Sample Output

  
  

   
   45
59
6
13
  
  

 

题意：类似于走迷宫，'@'是起点，'.'是路，'#'是墙，问你从起点开始出发，一共能走多长的路。（有些路因为存在墙 的阻挡而不能走。）

思路：

还是用BFS，因为进队列的点都是可以到达的路，所以加个计数器，当一个点进队时（包括起点），计数器就加1。最后输出计数器的大小即可。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 25;
int maze[maxn][maxn],vis[maxn][maxn];
int n,m,sx,sy,ans;
int dx[4] = {1,-1,0,0},dy[4] = {0,0,1,-1};
struct P{
	int x,y;
};

bool check(int xx,int yy){
	if(xx<0 || xx>=n || yy<0 || yy>=m || !maze[xx][yy] || vis[xx][yy])
		return false;
	return true;
}

void bfs(void){
	queue<P> que;
	int i;
	P a,b;
	a.x = sx;
	a.y = sy;
	vis[a.x][a.y] = 1;
	que.push(a);
	ans++;
	while(que.size()){
		a = que.front();
		que.pop();
		for(i=0 ;i<4 ;i++){
			b.x = a.x + dx[i];
			b.y = a.y + dy[i];
			if(check(b.x,b.y)){
				vis[b.x][b.y] = 1;
				que.push(b);
				ans++;
			}
		}
	}
}

int main(){
	while(scanf("%d%d",&m,&n) != EOF && (m||n)){
		int i,j;
		char ch;
		for(i=0 ;i<n ;i++){
			for(j=0 ;j<m ;j++){
				vis[i][j] = 0;
				cin >> ch;
				if(ch == '.'){
					maze[i][j] = 1;
				}
				else if(ch == '#'){
					maze[i][j] = 0;
				}
				else{
					sx = i;
					sy = j;
					maze[i][j] = 1;
				}
			}
		}
		ans = 0;
		bfs();
		printf("%d\n",ans);
	}
	return 0;
}