Red and Black

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
  
  
  
  


  
  

深度优先搜索和广度搜索都可以做，比较简单吧

bfs代码如下:

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{
    int x,y,s;
} que[2050];
int vis[4][2]= {{-1,0},{0,1},{1,0},{0,-1}};
int book[50][50];
int main()
{
    int i,j,tx,ty,head,tail,n,m;
    char map[50][50];
    while(scanf("%d %d",&n,&m)!=EOF,n,m)
    {
        memset(book,0,sizeof(book));
        for(i=0; i<m; i++)
        {
            scanf("%s",map[i]);
        }
        for(i=0; i<m; i++)
        {
            for(j=0; j<n; j++)
            {
                if(map[i][j]=='@')
                {
                    tx=i;
                    ty=j;
                }
            }
        }
        int f=0,sum=1;
        head=tail=1;
        que[tail].x=tx;
        que[tail].y=ty;
        tail++;
        book[tx][ty]=1;
        while(tail>head)
        {
            for(i=0; i<4; i++)
            {
                tx=que[head].x+vis[i][0];
                ty=que[head].y+vis[i][1];
                if(tx<0||ty<0||ty>=n||tx>=m)
                    continue;
                if(map[tx][ty]=='.'&&book[tx][ty]==0)
                {
                    sum++;
                    que[tail].x=tx;
                    que[tail].y=ty;
                    tail++;
                    book[tx][ty]=1;
                }
            }
            head++;
        }
        printf("%d\n",sum);
    }
    return 0;
}