HDOJ1312. Red and Black（无回溯DFS）

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 23956    Accepted Submission(s): 14495

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
  
  

【分析】无回溯DFS

        题意：一个人在一个H*W矩形房间中，当前位置为 @ 点。他只能沿上下左右4个方向走，且只能走 . 点，不能走 # 点，已走过的 . 点可重复走，问他最多可走多少 . 点。

        由于已走过的 . 点可重复走，故可考虑无回溯DFS，将走过的 . 点标记为 #，这样可避免设置vis数组。最终结果即走过的 . 数目。

#include <stdio.h>
#include <string.h>
#define maxlen 25
int W,H,sx,sy;
char room[maxlen][maxlen];
int ans;
int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
void dfs(int x,int y)
{
	int i;
	int newx,newy;
	for(i=0;i<4;i++)
	{
		newx=x+dir[i][0];
		newy=y+dir[i][1];
		if(newx>=0 && newx<H && newy>=0 && newy<W && room[newx][newy]=='.')
		{
			ans++;
			room[newx][newy]='#';
			dfs(newx,newy);
		}
	}
}
int main()
{
	int i,j;
	while(scanf("%d %d",&W,&H)!=EOF)
	{
		if(W==0 && H==0)
			break;
		for(i=0;i<H;i++)
			scanf("%s",room[i]);
		for(i=0;i<H;i++)
		{
			for(j=0;j<W;j++)
			{
				if(room[i][j]=='@')
				{
					sx=i;
					sy=j;
					break;
				}
			}
		}
		ans=1;
		dfs(sx,sy);
		printf("%d\n",ans);
	}
	return 0;
}