HDU 1312 Red and Black

Red and Black

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

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
  
  

 

此题是要找'@'能遍历的点数。要遍历每一个点，即用dfs（广搜），遍历时要做标记，避免重复。

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
using namespace std;
char map[30][30];
int n,m,cnt,x1,y1;
int bx[]={0,0,-1,1};
int by[]={-1,1,0,0};
void dfs(int x,int y)
{
   for(int i=0;i<4;i++)
   {
   	 int xx=x+bx[i];
   	 int yy=y+by[i];
   	 if(xx>0&&xx<=n&&yy>0&&yy<=m&&map[xx][yy]=='.'){
   	 	map[xx][yy]='#';
   	 	cnt++;
   	 	dfs(xx,yy);
   	 }
   }
}
int main()
{
	while(cin>>m>>n&&m||n)
	{
		cnt=0;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++){
				cin>>map[i][j];
				if(map[i][j]=='@'){
                    x1=i;
                    y1=j;
                    map[i][j]='#';
                    cnt++;
				}
			}
			dfs(x1,y1);
			cout<
       
       
        
        <