【洛谷】P1451 求细胞数量（flood fill)

穿越隧道

求连通块的数量，类似flood fill

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#define x first
#define y second
using namespace std;
const int N = 1e2 + 10;
typedef pair<int,int> pii;
char g[N][N];
bool st[N][N];
pii q[N*N];
int ans;
int n,m;
int cnt;
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
void bfs(int sx, int sy){
	int hh = 0, tt = 0;
	q[0] = {sx,sy};
	st[sx][sy] = true;
	while(hh <= tt){
		pii t = q[hh++];
		for(int i = 0; i < 4; i++){
			int a = t.x + dx[i], b = t.y + dy[i];
			if(a >= 1 && a <= n && a >= 1 && b <= m && !st[a][b] && (g[a][b] >= '1' && g[a][b] <= '9')){
				st[a][b] = true;
				q[++tt] = {a,b};
			} 
		}
	}
}
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(!st[i][j] && g[i][j] != '0'){
				bfs(i,j);
				cnt++;
			}
		}
	}
	cout << cnt << endl;
	return 0;
}