暴力搜索训练——Lake Counting S

[USACO10OCT] Lake Counting S

题目

题面翻译

由于近期的降雨，雨水汇集在农民约翰的田地不同的地方。我们用一个 $N\times M(1\le N\le 100,1\le M\le 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

3

提示

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

设计思路

这道题就是典型的flood fill模型，因此我们直接套用模板即可。总结：flood fill模型针对那种求一块一块的题目来说，而且它的内核就是bfs，具体模板见下

代码

//BFS flood fill

#include<bits/stdc++.h>

using namespace std;

const int N = 110;

typedef pair<int,int>PII;

char str[N][N];
bool st[N][N];
queue<PII> q;
int n,m,ans;
int dx[]={0,1,1,1,0,-1,-1,-1};
int dy[]={1,1,0,-1,-1,-1,0,1};

void bfs(int x1,int y1){
    
    q.push({x1,y1});
    st[x1][y1]=true;
    while(q.size()){
        PII t=q.front();
        q.pop();
        int x=t.first,y=t.second;
        for(int i=0;i<8;i++){
            int a=dx[i]+x,b=dy[i]+y;
            if(a<1||b<1||a>n||b>m)continue;
            if(st[a][b])continue;
            if(str[a][b]=='.')continue;
            st[a][b]=true;
            q.push({a,b});
        }
    }
    
}

int main(){
    cin>>n>>m;
    
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>str[i][j];
        }
    }
    
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(str[i][j]=='W'&&!st[i][j]){
                bfs(i,j);
                ans++;
            }
        }
    }
    
    cout<<ans;
    
    return 0;
}