HDU 1312 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)

Simple Input:

6 9

....#.

.....#

......

......

......

......

......

#@...#

.#..#.

11 9

.#.........

.#.#######.

.#.#.....#.

.#.#.###.#.

.#.#..@#.#.

.#.#####.#.

.#.......#.

.#########.

...........

11 6

..#..#..#..

..#..#..#..

..#..#..###

..#..#..#@.

..#..#..#..

..#..#..#..

7 7

..#.#..

..#.#..

###.###

...@...

###.###

..#.#..

..#.#..

0 0

Simple Output:

45

59

6

13

题目分析:本题主要讲述的是求@所在的人可以走的 . 的数量（包括自己所在的那个点）,如果四周或边缘被#包围，则无法到达。因此可以用dfs算法遍历得到.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
int n,m,count;
char s[100][100];
int vis[100][100];//做标记
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
void dfs(int x,int y)
{
    int x1,y1;
    count++;
    for(int i=0;i<4;i++)
    {
        x1=x+dir[i][0];
        y1=y+dir[i][1];
        if(x1>=0&&x1<n&&y1>=0&&y1<m&&s[x1][y1]=='.'&&!vis[x1][y1])
        {
            vis[x1][y1]=1;
            dfs(x1,y1);
        }
    }

}
int main()
{
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        int i,j;
        memset(vis,0,sizeof(vis));
        if(m==0)
            break;
        count=0;
        for(i=0;i<n;i++)
            scanf("%s",&s[i]);
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                if(s[i][j]=='@')//找到起始点，跳出
                    break;
            }
            if(j<m)//继续跳出
                break;
        }
        vis[i][j]=1;//起始点被访问
        dfs(i,j);
        printf("%d\n",count);
    }
    return 0;
}