LG1273 [USACO10OCT] Lake Counting S

暂无评定 传统题 洛谷P1596搜索图论2010USACO深度优先搜索 DFS连通块 上传者
时间限制1000ms
内存限制125MiB
通过 / 提交0/0

LG1273[USACO10OCT] Lake Counting S

暂无评定 传统题 洛谷P1596搜索图论2010USACO深度优先搜索 DFS连通块 上传者
时间限制1000ms
内存限制125MiB
通过 / 提交0/0

[USACO10OCT] Lake Counting S

题目描述

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.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
3

提示

OUTPUT DETAILS: There are three ponds: one in the upper left, one in the lower left, and one along the right side. 标签: P1596|搜索|图论|2010|USACO|深度优先搜索 DFS|连通块

来源

P1596|[USACO10OCT] Lake Counting S


题目来源:洛谷 P1596。