김기헌

#include<vector> #include<queue> #include<utility> #include<algorithm> using namespace std; typedef pair<int, int>p; queue<p>q; int dx[4] = { 0,1,0,-1 }; int dy[4] = { 1,0,-1,0 }; int check[105][105]; int solution(vector<vector<int> > maps) { int answer; int n = maps.size(), m = maps[0].size(); q.push({ 0,0 }); //bfs 시작 check[0][0] = 1; while (!q.empty()) { p now = q.front(); q.pop(); int x = now.first, y = now.second; for (int i = 0; i < 4; i++) { int nx = x + dx[i], ny = y + dy[i]; if (nx < 0 || n <= nx || ny < 0 || m <= ny || !maps[nx][ny])continue; if (!check[nx][ny]) { check[nx][ny] = check[x][y] + 1; q.push({ nx,ny }); } } } answer = check[n - 1][m - 1]; return !answer ? -1 : answer; }