import java.util.*; import java.io.*; public class Main { static int[] dx = {1,-1,0,0}; static int[] dy = {0,0,-1,1}; static int n; static int m; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st = new StringTokenizer(br.readLine()); StringBuilder sb = new StringBuilder(); n = Integer.parseInt(st.nextToken()); m = Integer.parseInt(st.nextToken()); boolean[][] visit = new boolean[n][m]; char[][] maze = new char[n][m]; int[][] fDist = new int[n][m]; int[][] jDist = new int[n][m]; Queue fq = new ArrayDeque(); Queue jq = new ArrayDeque(); for(int i=0; i=m || y<0 || y>=n) continue; if(fDist[y][x] >=0 || maze[y][x] == '#') continue; fDist[y][x] = fDist[cur[0]][cur[1]]+1; fq.offer(new int[]{y,x}); } } int count = 0; while(!jq.isEmpty()){ int[] cur = jq.poll(); // fire for(int i=0; i<4; i++){ int x = cur[1] + dx[i]; int y = cur[0] + dy[i]; if(x<0 || x>=m || y<0 || y>=n){ System.out.print(jDist[cur[0]][cur[1]]+1); return; } if(jDist[y][x] >=0 || maze[y][x] == '#') continue; if(jDist[cur[0]][cur[1]] + 1 >= fDist[y][x] && fDist[y][x] != -1); jDist[y][x] = jDist[cur[0]][cur[1]]+1; jq.offer(new int[]{y,x}); } } System.out.println("IMPOSSIBLE"); } }

제출 #31911

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: