扫除地雷c++

#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define PII pair<int,int >
#define int long long 
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);

using namespace std;

const int M = 210;

int n,m;
int stx,sty;
char va[M][M];
int dist[M][M];//ju li shu zu
int dx[8] = {0,0,1,-1,1,-1,1,-1};//fang xiang shu zu
int dy[8] = {1,-1,0,0,1,1,-1,-1};//fang xiang shu zu

void bfs()
{
	queue<pair<int,int> > q;
	q.push({stx,sty});
	if(va[stx][sty]=='0') return;
	va[stx][sty]='2';
	
	while(q.size())//shu zu li hai you dian
	{
		pair<int,int> now = q.front();//huo zhe auto now......
		q.pop();
		int x = now.first,y = now.second;
		for(int i=0;i<8;i++)
		{
			int xx = x+dx[i],yy = y+dy[i];
			if(xx>=1&&xx<=n&&yy>=1&&yy<=m)
			{
				if(va[xx][yy]=='1') 	q.push({xx,yy});
				va[xx][yy] = '2';
					
			
			}
		}
	}	
}

signed main()
{
	IOS;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		cin>>va[i][j];
	}
	cin>>stx>>sty;
	bfs();
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cout<<va[i][j];
		}
		cout<<"\n";
	}
	return 0;
}