Red and Black

Red and Black

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 11   Accepted Submission(s) : 11

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <cstring>
//#include <iostream>
using namespace std;
int b[25][25];
char a[25][25];
int cnt=0;
void DFS(int x,int y)
{
    if (b[x][y]==0)
    {
        b[x][y]=1;
        cnt++;
        if (a[x][y-1]=='.')  DFS(x,y-1);
        if (a[x][y+1]=='.')  DFS(x,y+1);
        if (a[x-1][y]=='.')  DFS(x-1,y);
        if (a[x+1][y]=='.')  DFS(x+1,y);
    }
}
int main ()
{
    int n,t,p,q,i,j;
    char c;
    while (scanf ("%d%d",&n,&t))
    { cnt=0;
    if (n==0&&t==0)
        return 0;
    memset(b,0,sizeof(b));
    memset(a,0,sizeof(a));
    c=getchar();
        for (i=0;i<t;i++)
        {
            for (j=0;j<n;j++)
            {
                scanf ("%c",&a[i][j]);
                if (a[i][j]=='@')
                {
                    p=i;
                    q=j;
                }
            }
            c=getchar();
        }
        DFS(p,q);
        printf ("%d\n",cnt);
    }
    return 0;
}