-----hdu 1312 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

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
/求一个连通区域里面有多少个方格
char a[110][110];
int t[4][2]={{1,0},{0,1},{-1,0},{0,-1}};//一共4个方向
int n,m,ans;
int vis[110][110];
void dfs(int i,int j)
{
    vis[i][j]=1;//将已经查询过的方格做上标记
    for(int k=0;k<4;k++)//4个方向
    {
        int x=i+t[k][0];
        int y=j+t[k][1];
        if(x>=0&&y>=0&&x<n&&y<m&&vis[x][y]==0&&a[x][y]=='.')//如果该方格没有越界，并且该方格没有被查询过，并且该方格为黑色
        {
          ans++;
          dfs(x,y);
        }
    }
    return;
}
int main()
{
    while(cin>>m>>n&&n&&m)
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            cin>>a[i][j];
            ans=1;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                if(a[i][j]=='@'&&vis[i][j]==0)
                dfs(i,j);
            cout<<ans<<endl;
    }
}