004求细胞数量

题目来源：https://www.luogu.org/problem/P1451

题目大意：求联通块数目

思路：直接把同一联通块的途程相同颜色即可。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define ll long long
int n, m, cnt = 0;
int a[122][122];
int vis[122][122];
int dx[4] = { 1,0,-1,0 };//上下左右四个方向
int dy[4] = { 0,1,0,-1};
int petr=0;
void dfs(int x, int y) {
	vis[x][y]=1;
	if(a[x][y]==0)return ;
	a[x][y]=petr;
	for(int i=0;i<=3;i++){
		int row=dx[i]+x;
		int col=dy[i]+y;
		if(row>=1&&row<=n&&col>=1&&col<=m)
			if(!vis[row][col])dfs(row,col);
	}
}
int main()
{
	char x;
	cin >> n >> m;
	for(int i=1;i<=n;i++)
		for (int j = 1; j <= m; j++) {
		cin>>x;
		a[i][j]=int(x-'0');
		vis[i][j]=0;
		}

	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==0)continue;
			if(vis[i][j]==0){
			petr++;
			dfs(i,j);
	
			}
		}
	}
	/*for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<a[i][j];
		}
		cout<<endl;
	}*/
	cout<<petr;
	return 0;
}