POJ-1979-Red and Black（DFS）

Red and Black
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 30891 Accepted: 16825
Description

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

题意：@为起点，#不能走，向上下左右移动，输出可以遍历.的数量

思路：从起点开始深搜，搜过的标记不再访问，同时记录搜过的数量

代码

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<string.h>
#include<queue>
using namespace std;
const int maxn=22;
char map[maxn][maxn];
int M,N;
int dis[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};
int num;//记录数量
void DFS(int x,int y)
{
    if(x>=0&&x<M&&y>=0&&y<N&&map[x][y]=='.')
    {
        map[x][y]='#';
        num++;

        for(int i=0;i<4;i++)
            DFS(x+dis[i][0],y+dis[i][1]);
    }
}
int main()
{
    while(~scanf("%d%d",&N,&M)&&M&&N)
    {
        int star_x,star_y;
        for(int i=0; i<M; i++)
        {
            getchar();
            for(int j=0; j<N; j++)
            {
                scanf("%c",&map[i][j]);
                if(map[i][j]=='@')
                {
                    star_x=i;
                    star_y=j;
                }
            }
        }
        num=0;
        map[star_x][star_y]='.';
        DFS(star_x,star_y);
        printf("%d\n",num);
    }
    return 0;
}