import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int m = Integer.parseInt(st.nextToken()); char[][] board = new char[n][m]; int[][][] dist = new int[2][n][m]; // 0은 지훈, 1은 불 Queue jq = new LinkedList<>(); Queue fq = new LinkedList<>(); for (int i = 0; i < n; i++) { String s = br.readLine(); for (int j = 0; j < m; j++) { board[i][j] = s.charAt(j); if (board[i][j] == '#') { dist[0][i][j] = 0; dist[1][i][j] = 0; } if (board[i][j] == 'J') jq.add(new Pair(i, j)); if (board[i][j] == 'F') fq.add(new Pair(i, j)); if (board[i][j] == '.') { dist[0][i][j] = -1; dist[1][i][j] = -1; } } } int[] dx = {-1, 1, 0, 0}; int[] dy = {0, 0, -1, 1}; while (!fq.isEmpty()) { Pair cur = fq.poll(); for (int dir = 0; dir < 4; dir++) { int nx = cur.x + dx[dir]; int ny = cur.y + dy[dir]; if (nx < 0 || ny < 0 || nx >= n || ny >= m) continue; if (board[nx][ny] == '#' || dist[1][nx][ny] >= 0) continue; fq.add(new Pair(nx, ny)); dist[1][nx][ny] = dist[1][cur.x][cur.y] + 1; } } while (!jq.isEmpty()) { Pair cur = jq.poll(); for (int dir = 0; dir < 4; dir++) { int nx = cur.x + dx[dir]; int ny = cur.y + dy[dir]; if (nx < 0 || ny < 0 || nx >= n || ny >= m) { System.out.println(dist[0][cur.x][cur.y] + 1); return; } if (board[nx][ny] == '#' || dist[0][nx][ny] >= 0 || dist[1][nx][ny] <= dist[0][nx][ny]) continue; jq.add(new Pair(nx, ny)); dist[0][nx][ny] = dist[0][cur.x][cur.y] + 1; } } System.out.println("IMPOSSIBLE"); } private static class Pair { int x, y; public Pair(int x, int y) { this.x = x; this.y = y; } } }

제출 #44272

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: