hduRed and Black （bfs）

Problem 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
题意：@是出发点，‘.’是路，‘#’是墙，求从出发点最大可以遍历多少个点‘.’；

简单BFS
代码:

#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
struct node{
   int x,y;
};
char map[25][25];
int vis[4][2]={0,1,0,-1,1,0,-1,0};
int mark[25][25];
int t,n,m,dx,dy;
int ok(int x,int y)
{
    if(x>=1&&x<=n&&y>=1&&y<=m&&map[x][y]!='#')
        return 1;
    else
        return 0;
}
void bfs()
{
    node q,p;
    queue<node>que;
    q.x=dx,q.y=dy;
    que.push(q);
    while(que.size())
    {
        q=que.front();
        que.pop();
        for(int i=0;i<=3;i++)
        {
            p.x=q.x+vis[i][0];
            p.y=q.y+vis[i][1];
            if(ok(p.x,p.y)&&!mark[p.x][p.y])
            {
                t++;
                mark[p.x][p.y]=1;
                que.push(p);
            }
        }
    }
}
int main()
{
    while(~scanf("%d%d",&m,&n))
    {
        if(n==0&&m==0)
            break;
        for(int i=1;i<=n;i++)
            scanf("%s",map[i]+1);
        memset(mark,0,sizeof(mark));
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
               if(map[i][j]=='@')
                  dx=i,dy=j;
        t=1;
        mark[dx][dy]=1;
        bfs();
        printf("%d\n",t);
    }
}