BFS——池塘计数

池塘计数

        本质即统计连通块的个数，bfs即可。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
#define R register
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};

int n,m;
int dx[8]={-1,0,1,-1,1,-1,0,1};
int dy[8]={-1,-1,-1,0,0,1,1,1};

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	vector<string> g(n);
	rep(i,0,n) cin>>g[i];
	int ans=0;
	rep(i,0,n){
		rep(j,0,m){
			if(g[i][j]=='W'){
				queue<PII> q;
				q.push({i,j});
				g[i][j]='.';
				while(!q.empty()){
					auto [x,y]=q.front();
					q.pop();
					rep(k,0,8){
						int xx=x+dx[k],yy=y+dy[k];
						if(xx<0||xx>=n||yy<0||yy>=m||g[xx][yy]=='.') continue;
						q.push({xx,yy});
						g[xx][yy]='.';
					}
				}
				ans++;
			}
		}
	}
	cout<<ans;
	return 0;
}

时间复杂度：O（nm）

空间复杂度：O（nm）