[Silver 1] 2178번 미로 탐색

백준 2178번 미로 탐색 풀이 코드입니다~

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <utility>

using namespace std;

int main(void)
{
    int N, M;
    vector<vector<int> > board_list;
    vector<int> board;

    vector<vector<int> > distance_list;
    vector<int> distance;

    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

    queue<pair<int, int> > q;

    cin >> N >> M;

    for (int i = 0; i < N; i++)
    {
        string input;

        cin >> input;
        for (int j = 0; j < M; j++)
        {
            board_list.push_back(board);
            distance_list.push_back(distance);
            board_list[i].push_back(input[j] - '0');
            distance_list[i].push_back(0);
        }
    }

    board_list[0][0] = 1;
    q.push(make_pair(0, 0));

    while (!q.empty())
    {
        int x = q.front().first, y = q.front().second;
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int new_x = x + dx[i], new_y = y + dy[i];

            if ((0 <= new_x && new_x < M) && (0 <= new_y && new_y < N) && board_list[new_y][new_x] == 1)
            {
                board_list[new_y][new_x] = 0; // 노드 방문 처리
                q.push(make_pair(new_x, new_y));
                distance_list[new_y][new_x] = distance_list[y][x] + 1; // 다음 방문 노드에 거리 대입
            }
        }
    }

    if (distance_list[N - 1][M - 1] == 0)
        cout << "-1" << endl;
    else
        cout << distance_list[N - 1][M - 1] + 1<< endl;
}

궁금한건 댓글 남겨주세요~