백준 2178 C++
최단 경로는 BFS!! #include #include #include using namespace std;int n,m;int arr[101][101];int dist[101][101];bool visited[101][101];int dx[] = {-1,1,0,0};int dy[] = {0,0,-1,1};int cnt = 1;void bfs(int x, int y) { queue> q; q.emplace(x,y); visited[x][y] = true; dist[x][y] = 1; while (!q.empty()) { auto [cx,cy] = q.front(); q.pop(); for (int i = 0; i = 0 && nx = 0 &..