A - 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).
Sample Input
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
Sample Output
45 59 6 13
十字搜索,over
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
using namespace std;
char mp[21][21];
int w,h;
void found(int &si,int &sj) {
for (si=0; si<h; si++) {
for (sj=0; sj<w; sj++) {
if (mp[si][sj] == '@')
return;
}
}
}
int start(int i,int j) {
if (i<0||i>=h||j<0||j>=w)
return 0;
if (mp[i][j] != '.')
return 0;
mp[i][j] = '@';
return 1+start(i-1,j)+start(i+1,j)+start(i,j-1)+start(i,j+1);
}
int main()
{
int i,j;
int si,sj;
while (scanf("%d%d",&w,&h) && w) {
for (i=0; i<h; i++) {
scanf("%s",mp+i);
}
found(si,sj);
mp[si][sj] = '.';
printf("%d\n",start(si,sj));
}
return 0;
}