HDU-1312 Red and Black

HDU-1312 Red and Black

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
 

Problem 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)
 

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

 
题目网址：http://acm.hdu.edu.cn/showproblem.php?pid=1312
 

分析

题意：就是给你一个地图，分为红色和黑色两种瓦片，再给出你现在的位置，然后开始走，每次只能走上下左右四个方向，而且还只能走黑色的地板，问他能走的黑色地板的数量
 
思路：首先呢，这是一个很简单的深搜，套用模板就可以了，走过之后避免重复走，给走过的地板标记成红色就可以了，最后输出总数。
 

代码

#include <iostream>
#include <stdio.h>
using namespace std;
int xy[4][2]={1,0,0,-1,0,1,-1,0};
char dt[20][20];
int num;
int m,n;
void DFS(int x,int y)
{
    int X,Y;
    if (dt[x][y]!='.'||x>=n||y>=m||x<0||y<0)
        return;
    dt[x][y]='#';
    num++;
    for(int i=0;i<4;i++)
    {
        X=x+xy[i][0];
        Y=y+xy[i][1];
        DFS(X,Y);
    }
}
int main()
{
    while (~scanf("%d %d",&m,&n),m!=0&&n!=0)
    {
        num=0;
        for (int i=0;i<n;i++)
            for (int j=0;j<m;j++)
               cin>>dt[i][j];
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<m;j++)
                if (dt[i][j]=='@')
                {
                    dt[i][j]='.';
                    DFS(i,j);
                }
        }
        cout<<num<<endl;
    }
    return 0;
}