HDU - 1312 Red and Black （dfs）

#include"iostream"
#include"cstdio"
#include"cstring"
using namespace std;
const int maxn=20+3;
int m,n,visit[maxn][maxn];
char pic[maxn][maxn];
int sum,num;
int dic[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void dfs(int h,int w){
if(h<0||h>n||w<0||w>m)  return ;
if(visit[h][w]==1||(pic[h][w]!='.'&&pic[h][w]!='@')) return ;
++sum;
visit[h][w]=1;
for(int i=0;i<4;i++)
dfs(h+dic[i][1],w+dic[i][0]);
}
int main(){
while(scanf("%d %d",&m,&n)==2&&n&&m){
        num=0;
        sum=0;
        memset(visit,0,sizeof(visit));
        memset(pic,0,sizeof(pic));
    for(int i=0;i<n;i++) scanf("%s",pic[i]);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(pic[i][j]=='@'){
             //  pic[i][j]='.';
               dfs(i,j);
               break;
              // cout<<"***";
            }
        }
    }
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        num+=visit[i][j];
        cout<<num<<endl;
        //cout<<sum<<endl;
}
}

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %I64d & %I64u

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