bfs #include<iostream> #include<queue> #include<cstring> #include<cstdio> using namespace std; ,,,},dy[]={,,-,}; queue<int>q; int n,m,ans,x,y; ][]; ][]; void bfs(int a,int b) { q.push(a);q.push(b); used[a][b]=; while(!q.empty…