[백준] 2178 - 미로 탐색(설명X)

#include <cstdio>
#include <queue>
using namespace std;
 
int bfs(int** arr, int sizeX, int sizeY) {
    queue<pair<int, int>> order;
    int** visited = new int* [sizeX];
    for (int i = 0; i < sizeX; i++)
        visited[i] = new int[sizeY] {0, };
    visited[0][0] = 1;
    order.push({ 0, 0 });
    while (!order.empty()) {
        pair<int, int> now = order.front();
        order.pop();
 
        if (now.first == sizeX - 1 && now.second == sizeY - 1)
            return visited[sizeX - 1][sizeY - 1];
 
        if (now.first + 1 < sizeX && arr[now.first + 1][now.second] == 1 && visited[now.first + 1][now.second] == 0) {
            order.push({ now.first + 1, now.second });
            visited[now.first + 1][now.second] = visited[now.first][now.second] + 1;
        }
        if (now.first - 1 >= 0 && arr[now.first - 1][now.second] == 1 &&  visited[now.first - 1][now.second] == 0) {
            order.push({ now.first - 1, now.second });
            visited[now.first - 1][now.second] = visited[now.first][now.second] + 1;
        }
        if (now.second + 1 < sizeY && arr[now.first][now.second + 1] == 1 && visited[now.first][now.second + 1] == 0) {
            order.push({ now.first, now.second + 1 });
            visited[now.first][now.second + 1] = visited[now.first][now.second] + 1;
        }
        if (now.second - 1 >= 0 && arr[now.first][now.second - 1] == 1 && visited[now.first][now.second - 1] == 0) {
            order.push({ now.first, now.second - 1 });
            visited[now.first][now.second - 1] = visited[now.first][now.second] + 1;
        }
    }
    return -1;
}
 
int main() {
    int N, M, max;
    scanf("%d %d", &N, &M);
    max = N * M;
    int** arr = new int* [N];
    for (int i = 0; i < N; i++) {
        arr[i] = new int[M];
        for (int j = 0; j < M; j++)
            scanf("%1d", &arr[i][j]);
    }
    printf("%d\n", bfs(arr, N, M));
}