#include using namespace std; #define X first #define Y second int row, col; char board[1005][1005]; int dis_jihoon[1005][1005]; int dis_fire[1005][1005]; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; bool outOfBoard(int x, int y); bool isWall(int x, int y); bool hasVisited(int dis[1005][1005], int x, int y); int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> row >> col; queue> Q_jihoon; queue> Q_fire; for (int i = 0; i < row; i++) { // init fill(dis_fire[i], dis_fire[i] + col, -1); fill(dis_jihoon[i], dis_jihoon[i] + col, -1); for (int j = 0; j < col; j++) { cin >> board[i][j]; if (board[i][j] == 'J') { Q_jihoon.push({i, j}); dis_jihoon[i][j] = 0; } else if (board[i][j] == 'F') { Q_fire.push({i, j}); dis_fire[i][j] = 0; } } } // cout << "CHECK BOARD INPUT\n"; // for (int i = 0; i < row; ++i) { // for (int j = 0; j < col; ++j) { // cout << dis_fire[i][j] << " "; // } // cout << "\n"; // } while (!Q_fire.empty()) { auto cur = Q_fire.front(); Q_fire.pop(); for (int dir = 0; dir < 4; ++dir) { int x = cur.X + dx[dir]; int y = cur.Y + dy[dir]; if (outOfBoard(x, y)) continue; if (isWall(x, y)) continue; if (hasVisited(dis_fire, x, y)) continue; Q_fire.push({x, y}); dis_fire[x][y] = dis_fire[cur.X][cur.Y] + 1; } } while (!Q_jihoon.empty()) { auto cur = Q_jihoon.front(); Q_jihoon.pop(); for (int dir = 0; dir < 4; ++dir) { int x = cur.X + dx[dir]; int y = cur.Y + dy[dir]; int dis = dis_jihoon[cur.X][cur.Y] + 1; if (outOfBoard(x, y)) { cout << dis; return 0; } if (isWall(x, y)) continue; if (hasVisited(dis_jihoon, x, y)) continue; if (dis_jihoon[cur.X][cur.Y] < dis_fire[x][y]) { Q_jihoon.push({x, y}); dis_jihoon[x][y] = dis; } } } cout << "IMPOSSIBLE"; return 0; } bool outOfBoard(int x, int y) { return (x < 0 || x >= row || y < 0 || y >= col); } bool isWall(int x, int y) { return (board[x][y] == '#'); } bool hasVisited(int dis[1005][1005], int x, int y) { return dis[x][y] >= 0; }

제출 #51817

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: