hdu 1312 Red and Black（深搜）

Red and Black

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

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 做好細節工作，迫在眉睫！！！本來測試數據三組都對了，最後一組怎麼都不對，調試了一中午，才發現是map數組忘了初始化了。。。。 代碼如下：

#include
#include
char map[1001][1001];
int visit[1001][1001];
int count,n,m;
void dfs(int a,int b)
{
	if(a<0||b<0||a>=1001||b>=1001)
	return ;
	if(!visit[a-1][b]&&map[a-1][b]=='.')
	{
		visit[a-1][b]=1; 
		count++;
		dfs(a-1,b);
	//	visit[n-1][m]=0;
	}
	if(!visit[a][b-1]&&map[a][b-1]=='.')
	{
		visit[a][b-1]=1;
		count++;
		dfs(a,b-1);
	//	visit[n][m-1]=0;
	}
	if(!visit[a+1][b]&&map[a+1][b]=='.')
	{
		visit[a+1][b]=1;
		count++;
		dfs(a+1,b);
	//	visit[n+1][m]=0;
	}	
	if(!visit[a][b+1]&&map[a][b+1]=='.')
	{
		visit[a][b+1]=1;
		count++;
		dfs(a,b+1);
	//	visit[n][m+1]=0;
	}
	else 
		return ;
}
int main()
{
	int i,j;
	while(~scanf("%d%d",&n,&m),n||m)
	{
		count=1;
		memset(visit,0,sizeof(visit));
		memset(map,'#',sizeof(map));//這個一定要加上，就因為這個疏忽，我足足調試了一中午。。。 
		for(i=0;i