POJ-1979 Red And Black

题目如下：
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).
AC题解（T:32ms,M:628K)

#include <iostream>
#include<cstdio>
#include<cstring>

using namespace std;
const int MAXN=20;

struct direct{
    int dx;
    int dy;
}dir[4]={{0,1},{0,-1},{1,0},{-1,0}};

char board[MAXN+2][MAXN+2],vis[MAXN+1][MAXN+1];//数组开大便于放置边界

int x,y,man_x,man_y,cnt;

void dfs(int yf,int xf)//DFS
{
    if(board[yf][xf]=='#')
        return;
    else if((board[yf][xf]=='.'||board[yf][xf]=='@')&&vis[yf][xf]==0)
    {
        cnt++;
        vis[yf][xf]=1;
        for(int i=0;i<4;i++)
        {
            int nextx=yf+dir[i].dx;
            int nexty=xf+dir[i].dy;

            dfs(nextx,nexty);
        }
    }
}

int main()
{
    while(~scanf("%d%d",&x,&y)&&(x||y)){

        memset(board,0,sizeof(board));
        memset(vis,0,sizeof(vis));

        for(int i=1;i<=y;i++)
            for(int j=1;j<=x;j++)
            {
                cin>>board[i][j];
                if(board[i][j]=='@')//标记起始位置
                {
                    man_y=i;
                    man_x=j;
                }
            }

        for(int i=0;i<=y+1;i++)//放边界墙
        {
            board[0][i]='#';
            board[y+1][i]='#';
        }
        for(int j=0;j<=x+1;j++)
        {
            board[j][0]='#';
            board[j][x+1]='#';
        }

        cnt=0;//计数归零

        dfs(man_y,man_x);

        printf("%d\n",cnt);

    }
    return 0;
}