hdu 1312Red and Black

dfs 水题

wa两个小时，dfs 数据范围和map范围有偏差错了好久，真要认真，最近太浪了；

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

Sample Output

45
59
6
13

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
using namespace std;
int ii, jj, s,n,m;
char map[100][100];
int dir[4][2] = { -1,0 ,1,0,0,-1,0,1 };
void dfs(int x, int y)
{
int i,xx, yy;
for (i = 0; i < 4; i++)
{
xx = x + dir[i][0];
yy = y + dir[i][1];
if (xx<0 || yy<0 || xx >= m || yy >= n)
continue;
if (map[xx][yy] == '.')
{
s++;
map[xx][yy] = '#';
dfs(xx, yy);
}
}
}
int main()
{
int i, j;
while (cin >> n >> m && (n || m))
{



getchar();
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
{
scanf("%c", &map[i][j]);
if (map[i][j] == '@')
{
ii = i;
jj = j;
}
}
getchar();
}
map[ii][jj] = '#';
/*for (i = 1; i <= m; i++)
{
for (j = 1; j <= n; j++)
cout << map[i][j];
cout << endl;
}*/
s = 1;
//cout << ii << ' ' << jj << endl;
dfs(ii, jj);
cout << s << endl;
}
return 0;
}
/*
6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
*/