hduoj1312Red and Black DFS

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) 

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

思路：（感慨）

第一次写dfs，看着旁边大佬们都写出来了，自己却什么也不懂，写不出来很烦，但总归要有自己的思路的，最后还是看着学长的板子加上自己的理解写出来了，感觉自己对dfs多了自己的那么一点点儿理解吧

代码：

#include<bits/stdc++.h>
using namespace std;
int n,m;
char str[50][50];
bool vis[50][50];
int dx[4][2] = {0,1,1,0,0,-1,-1,0};
int ans;
void dfs(int x,int y)
{
    ans ++; 
    vis[x][y] = 1;
    
    for (int i = 0;i < 4;i ++)
    {
        int fx = x + dx[i][0],fy = y + dx[i][1];
        if (fx >= 0 && fx < n && fy >= 0 && fy < m && !vis[fx][fy] && str[fx][fy] != '#')
        {
            dfs(fx,fy);
        }
    }
}
int main()
{
    while (~scanf("%d %d",&m,&n) && (n + m))
    {
        ans = 0;
        memset(vis,0,sizeof(vis));
        for (int i = 0;i < n;i ++)
            scanf("%s",str[i]);
        for (int i = 0;i < n;i ++)
            for (int j = 0;j < m;j ++)
                if (str[i][j] == '@')
                    dfs(i,j);
        printf("%d\n",ans);
    }
    return 0;
}