#include #include #include #include #include #include #include #include #include #include using namespace std; char mazeMap[1001][1001]; int fire[1001][1001]; int goOut[1001][1001]; int n, m; int dx[4] = {1, 0, -1, 0}; int dy[4] = { 0, 1, 0 ,-1 }; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> mazeMap[i][j]; fire[i][j] = -1; goOut[i][j] = -1; } } //Fire의 퍼지는 시간 계산 queue> fireQueue; //탈출 확인 queue> goOutQueue; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (mazeMap[i][j] == 'F') { fireQueue.push({ i,j }); fire[i][j] = 0; } if (mazeMap[i][j] == 'J') { goOutQueue.push({ i,j }); goOut[i][j] = 0; } } } while (!fireQueue.empty()) { pair currentQueue = fireQueue.front(); fireQueue.pop(); for (int dir = 0; dir < 4; dir++) { int nx = dx[dir] + currentQueue.first; int ny = dy[dir] + currentQueue.second; if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue; if (fire[nx][ny] >= 0 || mazeMap[nx][ny] == '#') continue; fire[nx][ny] = fire[currentQueue.first][currentQueue.second] + 1; fireQueue.push({ nx,ny }); } } while (!goOutQueue.empty()) { pair currentQueue = goOutQueue.front(); goOutQueue.pop(); for (int dir = 0; dir < 4; dir++) { int nx = dx[dir] + currentQueue.first; int ny = dy[dir] + currentQueue.second; if (nx < 0 || nx >= n || ny < 0 || ny >= m) { cout << goOut[currentQueue.first][currentQueue.second] + 1; return 0; } if (goOut[nx][ny] >= 0 || mazeMap[nx][ny] == '#') continue; int currentgoOut = goOut[currentQueue.first][currentQueue.second] + 1; if (fire[nx][ny] < currentgoOut) continue; goOut[nx][ny] = currentgoOut; goOutQueue.push({ nx,ny }); } } cout << "IMPOSSIBLE"; return 0; }

제출 #23823

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: