HDU1312&&ZOJ2165-Red and Black

Red and Black

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

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 <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

int n,m,cnt;
char mp[30][30];
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};

void dfs(int x,int y)
{
    cnt++;
    mp[x][y] = '#';
    for(int i = 0; i<4; i++)
    {
        int xx= x+dir[i][0];
        int yy= y+dir[i][1];
        if(xx<n && yy<m && xx>=0 && yy>=0 && mp[xx][yy] == '.')
            dfs(xx,yy);
    }
}

int main()
{
    int x,y;
    while(~scanf("%d%d%*c",&m,&n))
    {
        if(m==0&&n==0)
            break;
        for(int i=0; i<n; i++)
        {
            scanf("%s",mp[i]);
            for(int j = 0; j<m; j++)
            {
                if(mp[i][j] == '@')
                {
                    x=i;
                    y=j;
                }
            }
        }
        cnt = 0;
        dfs(x,y);
        printf("%d\n",cnt);
    }
    return 0;
}