Red and Black

Red and Black

Time Limit: 1000MS

Memory Limit: 30000K
Total Submissions: 52936

Accepted: 28072
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

#include <iostream>
#include <string>
#include <string.h>
#include <cstdio>

using namespace std;

const int MAX_N=25;
string s[MAX_N];
int H,W;//H行W列，但题目要求先输入列数
int ans;//计数
int fx[4]={-1,1,0,0};
int fy[4]={0,0,-1,1};

void dfs(int i,int j){
    ans++;
    s[i][j]='#';
    for(int k=0;k<4;k++){
        int dx=i+fx[k];
        int dy=j+fy[k];
        if(dx >= 0 && dx < H && dy >= 0 && dy < W && s[dx][dy]=='.'){
            dfs(dx,dy);
        }
    }
}

int main()
{
    while(cin>>W>>H && H!=0 && W!=0){
            int x,y;
            for(int i = 0;i < H; i++){
                cin>>s[i];//输入
                for(int j = 0; j < W; j++){
                    if(s[i][j] == '@'){//找人
                        x=i;
                        y=j;
                    }
                }
            }
            ans=0;
            dfs(x,y);
            cout<<ans<<endl;
    }
    return 0;
}