hdu1312

Red and Black

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

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<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int x, y, gx, gy;
char map[25][25];
int sum = 0;
int dir[4][2] = {1,0,-1,0,0,1,0,-1};
bool visit[25][25];

void dfs(int x, int y){
	int nextx, nexty;
	for(int i = 0; i < 4; i++){
		nextx = x+dir[i][0];
		nexty = y+dir[i][1];
		if(!visit[nextx][nexty]&&map[nextx][nexty]=='.'){
			visit[nextx][nexty] = 1;
			sum++;
			dfs(nextx, nexty);
		}
	}
}

int main(){
	freopen("in.txt", "r", stdin);
	while(scanf("%d%d", &y, &x), y&&x){
		memset(visit, 0, sizeof(visit));
		sum = 0;
		char c;
		for(int i = 1; i <= x; i++){
			for(int j = 1; j <= y; j++){
				cin>>c;
				map[i][j] = c;
				if(c=='@'){
					gx = i;
					gy = j;
				}
			}
		}
		int X = x+1;
		for(int i = 0; i <= x+1; i++){
			map[i][0] = '#';
			map[i][y+1] = '#';
		} 
		for(int i = 0; i <= y+1; i++){
			map[0][i] = '#';
			map[x+1][i] = '#';
		}
	//	print(x, y);
		visit[gx][gy] = 1;
		dfs(gx, gy);
		cout<<sum+1<<endl;
	}
	return 0;
}