HDU1312：Red and Black(DFS)

G - Red and Black

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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

#include<iostream>

#include<stdlib.h>

#include<cstdio>

//#include<algorithm>

#include<cstring>

//#include<queue>

using namespace std;

int w,h,sum;

char ma[25][25];

int dir[4][2]= {{1,0},{0,1},{-1,0},{0,-1}};

void dfs(int i,int j)

{

    sum++;

    ma[i][j]='!';

    for(int k=0; k<4; k++)

    {

        int x = i+dir[k][0];

        int y = j+dir[k][1];

        if(x<h&&y<w&&x>=0&&y>=0&&ma[x][y]=='.')

            dfs(x,y);

    }

    return;

}

int main()

{

    int fi,fj;

    while(scanf("%d%d",&w,&h)!=EOF&&w!=0&&h!=0)

    {

        sum=0;

        for(int i=0; i<h; i++)

        {

            for(int j=0; j<w; j++)

            {

                cin>>ma[i][j];

                //scanf("%c",&ma[i][j]);

                if(ma[i][j]=='@')

                {

                    fi=i;

                    fj=j;

                }

            }

            //getchar();

        }

        sum=0;

        dfs(fi,fj);

        cout<<sum<<endl;

        //printf("%d\n",sum);

    }

    return 0;

}