HDOJ 1312-Red and Black【基础DFS】

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 14551    Accepted Submission(s): 9009

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 

#include<stdio.h>
#include<string.h>//string strcpy strcmp
#include<math.h>
#include<algorithm>
#include<queue>
#define PI 22
using namespace std;
char a1[PI][PI];
int f(int xx,int yy)
{
    if(a1[xx][yy]=='#')
    return 0;
    else a1[xx][yy]='#';
    return 
     1+f(xx+1,yy)+f(xx,yy+1)+f(xx-1,yy)+f(xx,yy-1);    

}
int main()
{    
    int a,b,x,y;
    while(scanf("%d%d",&a,&b)&&(a||b))
    {
        int oo,j;
        for(oo=0;oo<PI;oo++)
        {
            for(j=0;j<PI;j++)
            {
                a1[oo][j]='#';
            }
        }
        for(oo=1;oo<=b;oo++)
        {
            getchar();
            for(j=1;j<=a;j++)
            {
                scanf("%c",&a1[oo][j]);
                if(a1[oo][j]=='@')
                {
                    x=oo;
                    y=j;
                    a1[x][j]='.';
                }
            }
        }
        int zz=f(x,y);
        printf("%d\n",zz);
    }
    return 0;
}