题解 | #走迷宫#

最短路dfs暴搜就行

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define x  first
#define y second
using namespace std;
const int N = 1010;
typedef pair<int, int> PII;
char g[N][N];
int st[N][N];
int n, m, sx, sy, ex, ey;
int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, -1, 1};
int main()
{
    scanf("%d%d", &n, &m);
    scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
    for (int i = 1; i <= n; i ++)
        scanf("%s", g[i] + 1);
    memset(st, -1, sizeof(st));
    queue<PII> q;
    q.push({sx, sy});
    st[sx][sy] = 0;
    while (q.size())
    {
        auto t = q.front();
        q.pop();
        for (int i = 0; i < 4; i ++)
        {
            int x = t.x + dx[i], y = t.y + dy[i];
            if (x >= 1 && x <= n && y >= 1 && y <= m && st[x][y] == -1 && g[x][y] == '.')
            {
                st[x][y] = st[t.x][t.y] + 1;
                q.push({x, y});
            }
        }
    }
    cout << st[ex][ey] << endl;
    return 0;
}