openjudge_2.5基本算法之搜索_1388:Lake Counting

原创

已于 2024-06-30 17:10:35 修改 · 895 阅读

9 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #广度优先

于 2024-04-05 19:07:55 首次发布

题目

1388:Lake Counting
查看提交统计提问
总时间限制: 1000ms 内存限制: 65536kB
描述
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (‘.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.

Given a diagram of Farmer John’s field, determine how many ponds he has.
输入

Line 1: Two space-separated integers: N and M
Lines 2…N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.
输出
Line 1: The number of ponds in Farmer John’s field.
样例输入
10 12
W…WW.
.WWW…W