P1596 [USACO10OCT]Lake Counting S（DFS）

最新推荐文章于 2022-12-18 15:49:00 发布

钟一淼

最新推荐文章于 2022-12-18 15:49:00 发布

阅读量184

点赞数 2

分类专栏：淼淼的DFS和BFS 文章标签：深度优先蓝桥杯算法 c++

本文链接：https://blog.csdn.net/m0_64045085/article/details/123484836

版权

淼淼的DFS和BFS 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

内心想法：作为我第一道独立思考出搜索的题目，当然值得纪念一下子。

上题目：（我看不懂英文的）

题目描述

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.

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

输入格式

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.

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

输出格式

Line 1: The number of ponds in Farmer John's field.

一行：水坑的数量

输入输出样例

输入 #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.

输出

说明/提示

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

题目分析：~~觉得这是一道简单提的请举手~~，典型的一个孤岛的问题，搜索这个w在八个方向，如果还有就继续搜索，直到这个搜索到边界条件为止，用VIS数组标记，走过的点将它变为旱地‘.’即可。

#include <iostream>
#include <cstring>
using namespace std;
int n, m;
int ans = 0;
char s[105][105];
int vis[105][105];
int fa[8][2] = { {0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,0},{1,1},{1,-1}};//八个方向
void dfs(int a, int b) {
    s[a][b] = '.';//标记
    for (int i =0; i <8; i++) {
            int x = a + fa[i][0];//遍历八个方向
            int y = b + fa[i][1];
        if (x>=0&&x<n&&y>=0&&y<m&&s[x][y] == 'W'&&vis[x][y]==0) {
            vis[x][y] = 1;//标记，也可以采用回溯的方法
            dfs(x,y);//继续递归
        }
    }
    return;
}
int main()
{
    cin >> n >> m;
    memset(vis, 0, sizeof(vis));//给数组赋初值
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> s[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (s[i][j] == 'W') {//如果该点为水
                dfs(i, j);
                ans++;
            }
        }
    }
    cout << ans << endl;
}

注意：不需要回溯的原因呢就是已经该点已经标记成了‘.’ 。

P1596 [USACO10OCT]Lake Counting S - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/P1596结束！