HDU1312Red and Black

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12176    Accepted Submission(s): 7582

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
  
  

 

DFS求联通块，找到所给起始点，上下左右搜到不能搜为止！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;

char map[25][25];
int dx[4]={-1,1,0,0};
int dy[4]={0,0,-1,1};
int vis[25][25];
int w,h;
int ans;
void dfs(int x,int y)
{
    int xx,yy;
    for(int i=0;i<4;i++)//四个方向搜
    {
        xx=x+dx[i];
        yy=y+dy[i];
        if(map[xx][yy]=='.'&&vis[xx][yy]==0)
        {
            ans++;
            vis[xx][yy]=1;
            dfs(xx,yy);
        }
    }
}
int main()
{
    while(scanf("%d%d",&w,&h),w+h)
    {
        int ii,jj;
        getchar();
        memset(vis,0,sizeof(vis));
        memset(map,'#',sizeof(map));
        ans=0;
        for(int i=1;i<=h;i++)
        {
            for(int j=1;j<=w;j++)
            {
                scanf("%c",&map[i][j]);
            }
            getchar();
        }
        for(int i=1;i<=h;i++)
         {
            for(int j=1;j<=w;j++)
            {
                if(map[i][j]=='@')
                {
                    ans++;
                    vis[i][j]=1;
                    dfs(i,j);
                    i=h;j=w;//找到就停，开始搜
                }
            }
         }
        printf("%d\n",ans);
    }
    return 0;
}