Red and Black(DFS)

                     Red and Black

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

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 <iostream>
#include <algorithm>
using namespace std;
#define maxn 32
  char mat[maxn][maxn];
  int vis[maxn][maxn];
  int dir[4][2]={1,0 ,-1,0, 0,1 ,0,-1};     //设定四个方向。
  void FS(int x,int y)
  {    
      vis[x][y]=1;
      for(int k=0;k<4;k++) //依次向四边搜。
      {
          int a=x+dir[k][0];
          int b=y+dir[k][1];
          if(vis[a][b]==0&&mat[a][b]=='.')  //没有搜到过，又可以走的位置。
          {
              FS(a,b);                      //以此为新的节点继续搜索。
          }
      }
  }
int main()
{
    int n,t,i,j,x,y;

    while(~scanf("%d%d",&y,&x)&&x!=0&&y!=0)
    {  getchar();                              //要将回车吸收掉。
       memset(mat,'#',sizeof(mat));            
       memset(vis,0,sizeof(vis));              //清零。
       t=0;
       for(i=1;i<=x;i++)
       {
           for(j=1;j<=y;j++)   
               scanf("%c",&mat[i][j]);
           getchar();                         //同样吸收回车。
       }   
       for(i=1;i<=x;i++)
           for(j=1;j<=y;j++)
               if(mat[i][j]=='@')            //找到起点。
               {   
                   FS(i,j);
               }
     for(i=1;i<=x;i++)
           for(j=1;j<=y;j++)
               t+=vis[i][j];                //将所有可以到达的点相加。
           printf("%d\n",t);
           
    }
    return 0;
}