HDU1312 Red and Black（DFS）

Red and Black

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

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
  
  

 

Source

Asia 2004, Ehime (Japan), Japan Domestic

 

一道很简单的深搜题目

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

char a[25][25];
int n,m,cnt;
int dir[4][2] = {1,0,-1,0,0,1,0,-1};
void dfs(int sx, int sy){
	int x,y;
	
	a[sx][sy] = '#';
	
	for(int i = 0; i < 4; i ++){
		x = sx + dir[i][0];
		y = sy + dir[i][1];
		
		if( x >= 0 && y >= 0 && x < m && y < n && a[x][y] == '.'){
			cnt ++;
			dfs(x,y);
		}
	}
}

int main(){
	int sx,sy;
	while(~scanf("%d%d",&n,&m)){
		if(!n && !m)
			break;
		for(int i = 0; i < m; i ++){
			getchar();	
			for(int j = 0; j < n; j ++){
		    	scanf("%c",&a[i][j]);
		    	if(a[i][j] == '@'){
					sx = i; sy = j;
				}
			}	
		}
		getchar();
	
		cnt = 1;
		dfs(sx,sy);
		printf("%d\n",cnt);
	}
	return 0;
}