HDU：1312 Red and Black(dfs)

最新推荐文章于 2021-07-26 12:30:47 发布

zugofn

最新推荐文章于 2021-07-26 12:30:47 发布

阅读量339

点赞数

文章标签： dfs 水题易错

本文链接：https://blog.csdn.net/zugofn/article/details/50512811

版权

Red and Black

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

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 <stdio.h>      //n是列。m是行 
#include <string.h>
char map[21][21];
int visit[21][21];
int ans=0;
void find(int x,int y,int n,int m)
{
	if(x>=0&&y>=0&&x<m&&y<n&&map[x][y]!='#'&&visit[x][y]==0)
	{
		ans++;
		visit[x][y]=1;
	}
	else
	{
		return ;
	}
	/*if(x<0||y<0||x>=m||y>=n||map[x][y]=='#'||visit[x][y]==1)
	return ;
	ans++;
	visit[x][y]=1;*/     //或这种写法    记得return 
	find(x+1,y,n,m);
	find(x-1,y,n,m);
	find(x,y-1,n,m);
	find(x,y+1,n,m);
}
int main()
{
	int n,m;
	while (scanf ("%d%d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)
		break;
		memset (map,0,sizeof(map));
		memset (visit,0,sizeof(visit));
		for(int i=0;i<m;i++)
		{
			scanf("%s",&map[i]);
		}
		int sx,sy;
		for (int i=0;i<m;i++)
		{
			for (int j=0;j<n;j++)
			{
				if(map[i][j]=='@')
				{
					sx=i;
					sy=j;
				}
			}
		}
		find(sx,sy,n,m);
		printf ("%d\n",ans);
		ans=0;
	}
	return 0;
}