poj1979

In this problem , x indicates the rows , and y indicates the cols.

#include <iostream>
#include <queue>
using namespace std;
char M[24][24];
typedef pair<int,int> P;
queue<P> q;
int W,H;
int dx[4] = {0,0,-1,1};
int dy[4] = {-1,1,0,0};

int bfs(){
    int count = 0,i,j;
    while(q.size()){
        P front = q.front();
        q.pop();
        count = count + 1;
        for(i=0;i<4;i++){
            int x = front.first,y = front.second;
            int newx = x + dx[i];
            int newy = y + dy[i];
            if(newx>=0 && newx <H && newy >=0 && newy <W && M[newx][newy]=='.'){
                M[newx][newy] = '#';
                q.push(pair<int,int>(newx,newy));
            }
        }
    }
    return count;
}
int main(int argc, const char * argv[]) {
    int i,j;
    char c;

    cin>>W>>H;
    while(W!=0 || H!=0){
        for(i=0;i<H;i++){
            getchar();
            for(j=0;j<W;j++){
                scanf("%c",&M[i][j]);
                if(M[i][j] == '@'){
                    M[i][j] = '#';
                    q.push(pair<int,int>(i,j));
                }
            }
        }
        cout<<bfs()<<endl;
        cin>>W>>H;
    }

    return 0;
}