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
  
  

 

Source

Asia 2004, Ehime (Japan), Japan Domestic

 

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

代码如下：

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int n,m,ans;
const int maxn=30;
bool vis[maxn][maxn];
char map[maxn][maxn];
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
void dfs(int x,int y)
{  //cout<<"1"<<endl;
    vis[x][y]=1;
    ans++;
    for(int i=0;i<4;i++)
    {
        int nx=x+dir[i][0];
        int ny=y+dir[i][1];
        if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&map[nx][ny]!='#'&&!vis[nx][ny])
        dfs(nx,ny);
    }
}
int main()
{
   while(scanf("%d%d",&m,&n)==2&&(n||m))
   {

       int sx,sy;
       for(int i=1;i<=n;i++)
       {
           for(int j=1;j<=m;j++)
           {
               cin>>map[i][j];
               if(map[i][j]=='@')
               {
                   sx=i;
                   sy=j;
               }
           }
       }
       ans=0;
       memset(vis,0,sizeof(vis));
       dfs(sx,sy);
       //cout<<"1"<<endl;
       cout<<ans<<endl;
   }
    return 0;
}