POJ1979 Red and Black 【深搜】

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<iostream>
#include<cstdio>

using namespace std;
char a[25][25];
void dfs(int x,int y);
int W,H;
int sum;
int main()
{

    int x,y; 
    cin>>W>>H;//H行W列 
    //读入并找到@ 
    while(W!=0&&H!=0)
    {
        sum = 1;
        for(int i=1;i<=H;i++)
        {
            for(int j=1;j<=W;j++)
            {
                cin>>a[i][j];
                if(a[i][j]=='@')
                {
                     x = i;
                     y = j;
                }
            }
        }
        dfs(x,y);
        cout<<sum<<endl;
        cin>>W>>H;
    }

    return 0;
}


void dfs(int x, int y )
{
    a[x][y] = '#';//为避免重复计算，重新标记为不能跳 
    for(int i = -1;i<=1;i++)//行变化 
    {
        for(int j = -1;j<=1;j++)//列变化 
        {
            if(i!=0&&j!=0)//为保证是上下左右四个方向，则i和j必有一个为0 
                continue;
            int xa = x+i;
            int ya = y+j;
            if(xa>=1&&xa<=H&&ya>=1&&ya<=W&&a[xa][ya]=='.')
            {
                sum++;
                dfs(xa,ya);
            }

        }
    } 
}

四个方向的设定也可以：

int dir[4][2] = {{-1,0},{1,0},{0,1},{0,-1}};  

void dfs(int x,int y)  
{  
    ans++;  
    str[x][y] = '#';  
    for(int i = 0;i < 4; i++){  
        int xx = x + dir[i][0];  
        int yy = y + dir[i][1];  
        if(xx < 1 || xx > m || yy < 1 || yy > n)  
            continue ;  
        if(str[xx][yy] == '.'){  
            dfs(xx,yy);  
        }  
    }  
}