pku 1979

Red and Black

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 3619		Accepted: 2375

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)
The end of the input is indicated by a line consisting of two zeros.

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 <string>
using namespace std;
char str[20][20];
int m,n;
int count;
int xx[4]={1,-1,0,0};
int yy[4]={0,0,1,-1};

int v[20][20];
int good(int x,int y)
{
 if(x<n && y<m && x>=0 && y>=0)
  return 1;
 else
  return 0;
}
void dfs(int i,int j)
{
 int k,x=i,y=j;
     
  if(good(x,y) && str[x][y]=='.')
  {
  
      ++count;
  
   v[x][y]=1;
          
           for(k=0;k<4;k++)
   {
          x=xx[k]+i;
          y=yy[k]+j;

          if( str[x][y]=='.' && good(x,y) && v[x][y]==0)
             dfs(x,y);
   }
  }
  
 
}

int main()
{
 
 while(cin>>m>>n && m && n)
 {
  
  char ch=getchar();
  count=0;
  int i,j;
  int x,y;
  for(i=0;i<n;++i)
   for(j=0;j<m;++j)
   {
    cin>>str[i][j];
    if(str[i][j]=='@')
    {
     x=i;
     y=j;
    }
   }
        str[x][y]='.';
        dfs(x,y);
  memset(v,0,sizeof(v));
  
  cout<<count<<endl;
       

 }
 return 0;
}