[백준알고리즘] 2178번 미로탐색

#include<stdio.h>
#include<queue>
#include<iostream>
using namespace std;
 
queue <pair<int, int>>q;
 
int answer_min = 0;
char arr[101][101];
char s[101];
int dx[4] = { 0,0,-1,1 };
int dy[4] = { 1,-1,0,0 };
 
int main()
{
    int N, M;
 
    cin >> N >> M;
 
    for (int i = 0; i < N; i++)
    {
        cin >> s;
 
        for (int j = 0; j < M; j++)
        {
            arr[i][j] = s[j];
        }
    }
 
    q.push(make_pair(0, 0));
 
    while (1)
    {
        int sz = q.size();
        answer_min++;
 
        while (sz--)
        {
            pair<int, int>p = q.front();
            q.pop();
            int _r = p.first;
            int _c = p.second;
 
            arr[_r][_c] = '1';
 
            if (_r == N - 1 && _c == M - 1)
            {
                cout << answer_min;
                return 0;
            }
 
            for (int i = 0; i < 4; i++)
            {
                int mx = _r + dx[i];
                int my = _c + dy[i];
 
                if (mx >= 0 && mx < N && my >= 0 && my < M && arr[mx][my] == '1')
                {
                    q.push(make_pair(mx, my));
                    arr[mx][my] = '0';
                }
            }
        }
    }
}