HDU 1312 Red and Black

A - Red and Black

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1312

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 
     
     

 

DFS floodfill

#include <iostream>
#include<cstring>
using namespace std;
int w,h,ans,f[50][50];
char g[50][50];
void dfs(int x,int y){
  if (g[x][y]=='#') return;
  if (f[x][y]) return;
  ans++;f[x][y]=1;
  if (x-1>0) dfs(x-1,y);
  if (x+1<=h) dfs(x+1,y);
  if (y-1>0) dfs(x,y-1);
  if (y+1<=w) dfs(x,y+1);
}
int main()
{
    int x,y,i,j;
    while(cin>>w>>h){
      if ((w==0) && (h==0)) break;
      memset(f,0,sizeof(f));
      for (i=1;i<=h;i++)
        for (j=1;j<=w;j++) {
            cin>>g[i][j];
            if (g[i][j]=='@') {x=i;y=j;};
        }
      ans=0;
      dfs(x,y);
      cout<<ans<<endl;
    }
    return 0;
}