寒假水111——搜索【深搜】

 

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 <stdio.h>
 
using namespace std; 
 
char a[25][25];  
int dir[4][2]={1,0,-1,0,0,1,0,-1};  
int x,y,num;  

bool xin(int x0,int y0)
{  
    if(x0<y&&x0>=0&&y0>=0&&y0<x)  
        return true;  
    else  
        return false;  
}  

void dfs(int x0,int y0)  
{  
    a[x0][y0]='#';  
    num++;  
    int xx,yy;  
    for(int i=0; i<4; i++)  
    {  
        int xx=x0+dir[i][0];  
        int yy=y0+dir[i][1];  
        if(xin(xx,yy)&&a[xx][yy]=='.')  
            dfs(xx,yy);  
    }  
  
}  

int main()  
{  
    int i,j,di,dj;  
    while(~scanf("%d%d",&x,&y))  
    {  
        getchar();  
        if(x==0&&y==0) break;  
        for(i=0; i<y; i++)  
        {  
            for(j=0; j<x; j++)  
            {  
                scanf("%c",&a[i][j]);  
                if(a[i][j]=='@')  
                {  
                    di=i;  
                    dj=j;  
                }  
            }  
            getchar();  
        }  
        num=0;  
        dfs(di,dj);  
        cout<<num<<endl;  
    }  
    return 0;  
}  

题解：表示深搜要写吐了。