hdu-1312-Red and Black

  
  

   
   6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0
  
  

Sample Output

  
  

   
   45
59
6
13
  
  

#include <iostream>
#include <stdio.h>
#include <queue>
#include <cstring>
using namespace std;
struct nobe
{
    int x,y;
};

char map[150][150];
int visit[150][150],flag,go[4][2]= {0,-1,0,1,1,0,-1,0};
int n,m;
void BFS(int x,int y)
{
    int i;
    queue<nobe> q;
    nobe que,ue;
    que.x=x;
    que.y=y;
    q.push(que);
    while(!q.empty())
    {
        que=q.front();
        q.pop();
        for(i=0; i<4; i++)
        {
            ue=que;
            ue.x+=go[i][0];
            ue.y+=go[i][1];
            if(ue.x>0&&ue.x<=n&&ue.y>0&&ue.y<=m&&!visit[ue.x][ue.y]&&map[ue.x][ue.y]=='.')
            {
                flag++;
                visit[ue.x][ue.y]=1;
                q.push(ue);
            }
        }
    }
}
int main()
{
    int i,j,x,y;
    while(scanf("%d%d",&m,&n))
    {
        if(n==0&&m==0)
        break;
        for(i=1; i<=n; i++)
        {
            for(j=1; j<=m; j++)
            {
                cin>>map[i][j];
                if(map[i][j]=='@')
                {
                    x=i;
                    y=j;
                }
            }
        }
        memset(visit,0,sizeof(visit));
        flag=1;
        BFS(x,y);
        printf("%d\n",flag);
    }
}