hdu1312深搜！！！

 

Red and Black

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

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
  
  

 

#include<stdio.h>i

nt w,h,count;

char ch[29][29];

int dir[4][2]={1,0,-1,0,0,1,0,-1};

void dfs(int a,int b)

{ int i,c,d;

count++;

for(i=0;i<4;i++)

 { c=a+dir[i][0];

 d=b+dir[i][1];

 if(c>=0&&c<h&&d>=0&&d<w&&ch[c][d]=='.')

 { ch[c][d]='#';

dfs(c,d);

}

}

}

int main()

{ int i,j,sx,sy;

 while(scanf("%d%d",&w,&h),w!=0||h!=0)

{

for(i=0;i<h;i++）

scanf("%s",ch[i]);

for(i=0;i<h;i++)

for(j=0;j<w;j++)

 if(ch[i][j]=='@')

{ sx=i; sy=j; }

count=0; dfs(sx,sy);

 printf("%d\n",count);

 }

return 0;

}