搜索-宽搜(张老师）

#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=2000;
int n;
int vis[M][M];
int dist[M][M];
int stx,sty;
dx[4]={0,0,1,-1};
dy[4]={1,-1,0,0};
void bfs()
{
	queue<pair<int,int>> q;
	vis[stx][sty]=1;
	dist[stx][sty]=0;
	q.push({stx,sty});
	while(q.size()>=1)
	{
		pair<int,int> now=q.front();
		q.pop();
		int x=now.first,y=now.second;
		for(int i=0;i<=3;i++)
		{
			int xx=x+dx[i],yy=y+dy[i];
			if(xx>=1&&xx<=n&&yy>=1&&yy<=n&&vis[xx][yy]==0)
			{
				vis[xx][yy]=1;
				dist[xx][yy]=dist[x][y]+1;
				q.push({xx,yy});
			}
		}
	}
	
}

signed main()
{
	return 0;
}