2019独角兽企业重金招聘Python工程师标准>>>

Red and Black

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

http://acm.hdu.edu.cn/showproblem.php?pid=1312

深搜入门题

转载于:https://my.oschina.net/hlslml77/blog/176738

hdu 1312深搜入门题相关推荐

DSF深搜入门全排列笔记nyoj366
DFS深搜之全排列(初学) 题目描述思路解析与dfs模板伪代码题目描述以nyoj2.0 366题为例,记录入门dfs的代码,并理清思路,方便以后复习巩固,初学dfs如果有问题还请指出~ 链接: ...
LeetCode —— 深搜水题记录
正文之前好长一段时间没有更新博客了,是因为放假了都是一整个白天地去学车,然后晚上看看书,做一做题就过去了,好在已经完成驾照考试,但是最近又没有研究什么技术,所以就只好拿这几天做的 LeetCode ...
【codevs1116】四色问题，深搜入门题目
(说实话我已开始是不想写这道题目的,因为太水了,但是发现最近实在是打不出什么好一些的题目,所以就凑活一下好了) 1116 四色问题时间限制: 1 s 空间限制: 128000 KB 题目等级 : 黄 ...
HDU 1010 深搜+奇偶剪枝
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1010 贴个资料: http://acm.hdu.edu.cn/forum/read.php?tid=615 ...
Black And White HDU - 5113 深搜dfs+剪枝
原题 Problem Description In mathematics, the four color theorem, or the four color map theorem, states ...
acm公选课第三节4.7直播4.9补递归深搜啥的
今天主要讲递归深搜 dp做准备, 能看到算法复杂度要真正理解:(从上往下扎,到边界结束,再一层一层往上返) 下图:第一行时边界,第二行时递归模式爆了: RE:(我也出过原来是这样) 递推就行老 ...
蒟蒻萌新的c++深搜指南
适合萌新的c++深搜指南 (好吧好吧,我是蒟蒻,但教程肯定是原创的啦,比较符合蒟蒻的水平,就是为了方便自己以后复习啦,dalao不要吐槽,多多指教) 先来深搜吧,好不容易学完了,深搜全称"深 ...
算法学习笔记 4-3 深搜（DFS）与广搜（BFS）：初识问题状态空间与 LeetCode真题（Java）
喜欢该类型文章可以给博主点个关注,博主会持续输出此类型的文章,知识点很全面,再加上LeetCode的真题练习,每一个LeetCode题解我都写了详细注释,比较适合新手入门数据结构与算法,后续也会更新进 ...
HDU 1248 寒冰王座(全然背包:入门题)
HDU 1248 寒冰王座(全然背包:入门题) http://acm.hdu.edu.cn/showproblem.php?pid=1248 题意: 不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票 ...

hdu 1312深搜入门题

Red and Black

hdu 1312深搜入门题相关推荐

最新文章

热门文章