C. Connect 【 BFS + 暴力 】

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
struct node {
    int x;
    int y;
}l,w,s[20000],e[20000];
int n,sx,sy,ex,ey;
bool vis[200][200];
char gra[200][200];
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
void bfs(int x, int y, struct node a[], int &p)
{
    memset(vis,false,sizeof(vis));
    queue<node> q;
    l.x = x-1;l.y = y-1;
    q.push(l);
    vis[x-1][y-1] = true;
    a[p].x = x-1;
    a[p ++].y = y-1;
    while(!q.empty())
    {
        w = q.front();
        q.pop();
        for(int i = 0;i < 4; i ++)
        {
            int tx = w.x + dx[i];
            int ty = w.y + dy[i];
            if(tx >= 0 && tx < n && ty >= 0 && ty < n && gra[tx][ty] == '0' && vis[tx][ty] == false)
            {
                l.x = tx;
                l.y = ty;
                a[p].x = tx;
                a[p ++].y = ty;
                q.push(l);
                vis[tx][ty] = true;
            }
        }
    }
//    return ;
}
int main()
{
    scanf("%d", &n);
    scanf("%d %d %d %d", &sx, &sy, &ex, &ey);
    for(int i = 0; i < n; i ++)
    {
        getchar();
        scanf("%s", gra[i]);
    }
    int p1 = 0;
    int p2 = 0;
    bfs(sx,sy,s,p1);
    bfs(ex,ey,e,p2);
//    printf("%d %d\n",p1,p2);
//    for(int i = 0; i < p1; i ++) cout << s[i].x  << " " << s[i].y << endl;
//    cout << "dddddddddd" << endl;
//    for(int i = 0; i < p2; i ++) cout << e[i].x << " " << e[i].y << endl;
    int sum = 0x3f3f3f3f;
    for(int i = 0; i < p1; i ++)
    {
        for(int j = 0; j < p2; j ++){
 
            sum = min((s[i].x - e[j].x) * (s[i].x - e[j].x) + (s[i].y - e[j].y) * (s[i].y - e[j].y),sum);
        }
    }
    printf("%d\n",sum);
    return 0;
}