2过了，其他的都是MLE

#include <bits/stdc++.h>
#define mian main
using namespace std;

int n,xx,yy,xxx,yyy;
int a[2005][2005];
int vis[2005][2005];
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};

struct Node {
    int x,y,step;
};

void read() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            char c;
            cin >> c;
            a[i][j] = c - '0';
        }
    }
    cin >> xx >> yy >> xxx >> yyy;
}

void bfs() {
    queue<Node> q;
    int x1 = xx,y1 = yy,x2 = xxx,y2 = yyy;
    q.push({x1,y1,0});
    int ans = 1e9;
    while(!q.empty()) {
        Node nw = q.front();
        q.pop();
        int x = nw.x,y = nw.y,step = nw.step;
        vis[x][y] = 1;
        if(x == x2 && y == y2) ans = min(ans,step);
        for(int i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(nx < 1 || nx > n || ny < 1 || ny > n || vis[nx][ny] == 1 || a[nx][ny] == 1) continue;
            q.push({nx,ny,step+1});
        }
    }
    cout << ans;
}

int mian() {
    read();
    bfs();
    return 0;
}