[백준/BFS/C++] 2178번 미로 탐색

https://www.acmicpc.net/problem/2178

2178번: 미로 탐색

bfs를 사용하여 풀었고
생각해보니 visited를 안쓰고

if(graph[nx][ny] != 0 && visited[nx][ny]==false)

조건 대신

if(graph[nx][ny] == 1)

조건을 썼어도 됐을 것 같다

#include <bits/stdc++.h>

using namespace std;

int n,m;
int graph[101][101];
bool visited[101][101];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};

bool bfs(int x, int y){
    queue<pair<int, int>> q;
    q.push({x,y});
    visited[x][y] = true;

    while(!q.empty()){
        int first = q.front().first;
        int second = q.front().second;
        q.pop();

        for(int i=0; i<4; i++){
            int nx = first + dx[i];
            int ny = second + dy[i];

            if(nx<=-1 || nx>=n || ny<=-1 || ny>=m) continue;

            if(graph[nx][ny] != 0 && visited[nx][ny]==false){
                graph[nx][ny] = graph[first][second] + 1;
                q.push({nx, ny});
                visited[nx][ny] = true;
            }
        }
    }
    return true;
}

int main(void) {

    cin >> n >> m;

    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            scanf("%1d", &graph[i][j]);
        }
    }
    bfs(0,0);

    cout << graph[n-1][m-1];

    return 0;
}

비슷한 문제
https://develop-me-z.tistory.com/99

[이코테/ DFS&BFS/ C++] 미로탈출