hdu 1312

Red and Black

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

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

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:   1241  1010  1372  1242  1253 

 

#include<iostream>
#include<string.h>
using namespace std;
int direct[4][2]={-1,0,1,0,0,1,0,-1};//定义移动的四个方向,左右上下

char map[20][20];
bool mark[20][20];
int W,H;
int Dx,Dy;
int ans;

void DFS(int x,int y)
{
    int p,q,k;
    mark[x][y]=true;
    for(k=0;k<4;k++){
    p=x+direct[k][0];
    q=y+direct[k][1];
    if(p>=0&&q>=0&&p<H&&q<W&&!mark[p][q]&&map[p][q]!='#'){
        ans++;
        DFS(p,q);
    }
    }
    return;
} 

int main()
{
    int i,j,k;
    while(cin>>W>>H&&(W||H)){  
        memset(mark,false,sizeof(mark));
        for(i=0;i<H;i++){
            for(j=0;j<W;j++){
                cin>>map[i][j];
                if(map[i][j]=='@'){
                Dx=i;
                Dy=j;
                }
            }
        }
        ans=1;  //统计个数
        DFS(Dx,Dy);
        cout<<ans<<endl;
    }
    return 0;
}