hdoj1312（dfs）

Red and Black

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 7   Accepted Submission(s) : 3

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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>
#include<string.h>
char sign[50][50];
int vis[50][50];
int m,n,cot;
void dfs(int x,int y)
{
 if(x<0||x>=n)
  return;
 if(y<0||y>=m)
  return;
 if(sign[x][y]=='#')
 {
  return;
 }
 sign[x][y]='#';
 cot++;
 vis[x][y]=1;
 dfs(x+1,y);
 dfs(x,y+1);
 dfs(x-1,y);
 dfs(x,y-1);
}
int main()
{
 while(scanf("%d%d",&m,&n)!=EOF&&(m||n))
 {
  int i,j,x,y;
  for(i=0;i<n;i++)
  {
   scanf("%s",sign[i]);
   for(j=0;j<m;j++)
   {
    if(sign[i][j]=='@')
    {
     x=i;
     y=j;
    }
   }
  }
  cot=0;
  memset(vis,0,sizeof(vis));
  dfs(x,y);
  printf("%d\n",cot);
 }
 return 0;
}