#include using namespace std; int main() { cin.tie(NULL); ios_base::sync_with_stdio(false); queue> Q; queue> Q2; int m, n; cin >> n >> m; vector> board(n, vector(m)); vector> dist(n, vector(m, -1)); vector> dist2(n, vector(m, -1)); int dx[4] = {1,0,-1,0}; int dy[4] = {0,1,0,-1}; cin.ignore(); string str; for(int i = 0; i < n; i++){ getline(cin,str); for(int j = 0; j < m; j++){ if(str[j] == '#'){ board[i][j] = -1; } else if(str[j] == '.'){ board[i][j] = 0; } else if(str[j] == 'J'){ board[i][j] = 1; } else if(str[j] == 'F'){ board[i][j] = 2; } } } //미로 설정 for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(board[i][j] == 2){ Q.push({i, j}); dist[i][j] = 0; //불 초기위치 } else if(board[i][j] == 1){ Q2.push({i, j}); dist2[i][j] = 0; //지훈이 초기위치 } } } // BFS(불) while(!Q.empty()) { auto cur = Q.front(); Q.pop(); for(int dir = 0; dir < 4; dir++) { int nx = cur.first + dx[dir]; int ny = cur.second + dy[dir]; if(nx < 0 || nx >= n || ny < 0 || ny >= m) continue; if(board[nx][ny] != 0 || dist[nx][ny] != -1) continue; dist[nx][ny] = dist[cur.first][cur.second] + 1; Q.push({nx, ny}); } } // BFS(지훈이) while(!Q2.empty()) { auto cur = Q2.front(); Q2.pop(); for(int dir = 0; dir < 4; dir++) { int nx = cur.first + dx[dir]; int ny = cur.second + dy[dir]; if(nx < 0 || nx >= n || ny < 0 || ny >= m) continue; if(board[nx][ny] != 0 || dist2[nx][ny] != -1) continue; dist2[nx][ny] = dist2[cur.first][cur.second] + 1; Q2.push({nx, ny}); } } bool check = false; int time = 0; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(dist[i][j] > 0 && dist2[i][j] > 0){ if(dist[i][j] > dist2[i][j]){ check = true; time = dist2[i][j] > time ? dist2[i][j] : time; } } } } if(check) cout << time + 1; else cout << "IMPOSSIBLE"; return 0; }

제출 #85436

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: