[USACO10OCT] Lake Counting S-CSDN博客

本文链接：https://blog.csdn.net/weixin_72368992/article/details/131655919

该编程题目要求解决一个关于连通组件的问题，具体是在一个N×M的网格图中，找出所有相连的水（W）形成的水坑数量。给定田地的布局，通过深度优先搜索(DFS)遍历并标记已访问的单元格，从而计算出水坑的总数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[USACO10OCT] Lake Counting S

题面翻译

由于近期的降雨，雨水汇集在农民约翰的田地不同的地方。我们用一个 $N×M(1≤N≤100,1≤M≤100)N\times M(1\leq N\leq 100, 1\leq M\leq 100)$ 的网格图表示。每个网格中有水（W）或是旱地（.）。一个网格与其周围的八个网格相连，而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图，确定当中有多少水坑。

输入第 $1$ 行：两个空格隔开的整数： $N$ 和 $M$ 。

第 $2$ 行到第 $N + 1$ 行：每行 $M$ 个字符，每个字符是 W 或 .，它们表示网格图中的一排。字符之间没有空格。

输出一行，表示水坑的数量。

题目描述

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.

样例 #1

样例输入 #1

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

样例输出 #1

提示

OUTPUT DETAILS: There are three ponds: one in the upper left, one in the lower left, and one along the right side.

这个题一眼看出就是连通块的问题，但是和普通的上下左右的联通痛快有些不同，就是这个题多了斜着走的状况

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int N=105;
char g[N][N];
int n,m,cnt;
void dfs(int i,int j)
{
	if(i<1||j<1||i>=n+1||j>=m+1||g[i][j]=='.')return ;
	g[i][j]='.';
	dfs(i+1,j);
	dfs(i-1,j);
	dfs(i+1,j+1);
	dfs(i+1,j-1);
	dfs(i,j+1);
	dfs(i,j-1);
	dfs(i-1,j-1);
	dfs(i-1,j+1);
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)cin>>g[i][j];
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(g[i][j]=='W')
			{
				cnt++;
				dfs(i,j);
			}
		}
	}
	cout<<cnt;
	return 0;
}