0分求条

#include <bits/stdc++.h>
using namespace std;
int x,y;
int a[1005][1005];
bool vis[1005][1005];
int n,qx,qy,zx,zy,ans=0;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
void bfs()
{
	if (x==zx&&y==zy)
	return;
	queue <int> q;
	while (!q.empty())
	{
		int tou=q.front();
		q.pop();
		for (int i=1;i<=n;i++)
		{
			for (int j=1;j<=n;j++)
			{
				if (a[i][j]!=1&&!vis[i][j]&&dx[i]+tou>0&&dx[i]+tou<n&&dy[j]>0&&dy[j]<n)
				{
					x=dx[i]+tou;
					y=dy[j]+tou;
					ans++;
					vis[i][j]=1;
				}
			}
		}
	}
}
int main()
{
	cin >> n;
	for (int i=1;i<=n;i++){
	for (int j=1;j<=n;j++){
		cin >> a[i][j];
		if (a[i][j]==1)
		{
			vis[i][j]=1;
		}}}
	cin >> qx >> qy >> zx >> zy;
	vis[qx][qy]=1;
	x=qx,y=qy;
	bfs();
	cout << ans;
}