poj1979 Red and Black dfs

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

Source

Japan 2004 Domestic

dfs

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn=25;

char map[maxn][maxn];
bool vis[maxn][maxn];
int move[4][2]={1,0,-1,0,0,1,0,-1};
int n,m,tot;
int sx,sy;

bool out(int x,int y){
    return (x<0||x>=n||y<0||y>=m);
}

void dfs(int x,int y){
    //map[x][y]='#';
    tot++;
    for(int i=0;i<4;++i){
        int x0=x+move[i][0];
        int y0=y+move[i][1];
        if(out(x0,y0)) continue;
        if(map[x0][y0]=='.'){
            map[x0][y0]='#';
            dfs(x0,y0);
        }
    }
}

int main()
{
    while(cin>>m>>n,n+m){
        for(int i=0;i<n;++i)
            scanf("%s",map[i]);
        for(int i=0;i<n;++i){
            for(int j=0;j<m;++j){
                if(map[i][j]=='@'){
                    sx=i;
                    sy=j;
                }
            }
        }
        tot=0;
        map[sx][sy]='#';
        dfs(sx,sy);
        cout<<tot<<endl;
    }
    return 0;
}