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 R = Integer.parseInt(st.nextToken()) + 1; // 행 int C = Integer.parseInt(st.nextToken()) + 1; // 열 int[][] board = new int[R][C]; int[][] jdp = new int[R][C]; int[][] fdp = new int[R][C]; Queue q = new LinkedList<>(); Queue fq = new LinkedList<>(); for (int i = 1; i < R; i++) { String s = br.readLine(); for (int j = 1; j < C; j++) { char c = s.charAt(j - 1); if (c == '.') { board[i][j] = 1; jdp[i][j] = -1; fdp[i][j] = -1; } else if (c == 'J') { q.offer(new Pair(i, j)); } else if (c == 'F') { fq.offer(new Pair(i, j)); } else if (c == '#') board[i][j] = -1; } } int[] dx = {-1, 0, 1, 0}; int[] dy = {0, -1, 0, 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 < 1 || ny < 1 || nx >= R || ny >= C) continue; if (fdp[nx][ny] >= 0 || board[nx][ny] == -1) continue; fdp[nx][ny] = fdp[cur.x][cur.y] + 1; fq.add(new Pair(nx, ny)); } } while (!q.isEmpty()) { Pair cur = q.poll(); for (int dir = 0; dir < 4; dir++) { int nx = cur.x + dx[dir]; int ny = cur.y + dy[dir]; if (nx < 1 || ny < 1 || nx >= R || ny >= C) { System.out.println(jdp[cur.x][cur.y] + 1); return; } if (jdp[nx][ny] >= 0 || board[nx][ny] == -1) continue; if (fdp[nx][ny] != -1 && fdp[nx][ny] <= jdp[nx][ny] + 1) continue; jdp[nx][ny] = jdp[cur.x][cur.y] + 1; q.add(new Pair(nx, ny)); } } System.out.println("IMPOSSIBLE"); } private static class Pair { int x, y; public Pair(int x, int y) { this.x = x; this.y = y; } } }

제출 #30969

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: