import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; public class Main { static char[][] arr= new char[1001][1001]; static char[][] arr= new char[1001][1001]; static boolean[][] val= new boolean[1001][1001]; static char[][] jarr= new char[1001][1001]; static int[] dx= {1,0,-1,0}; static int[] dy= {0,1,0,-1}; /* 4 4 #### #JF# #..# #..# */ public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); String line = bufferedReader.readLine(); String[] split = line.split(" "); int n= Integer.parseInt(split[0]); int m= Integer.parseInt(split[1]); Queue queue= new LinkedList<>(); //Queue fQueue= new LinkedList<>(); Pair jPair=null; Pair fPair = null; for(int i=0; i=m || nextY<0 || nextY >=n) continue; if(val[nextY][nextX]==true || arr[nextY][nextX] == '#') continue; val[nextY][nextX]=true; arr[nextY][nextX]=(char) (deep + 1); queue.add(new Pair(nextX, nextY)); } } queue.clear(); val= new boolean[1001][1001]; arr[jPair.n][jPair.m]='0'; queue.add(jPair); while(!queue.isEmpty()) { Pair pair = queue.poll(); char deep= (char)(arr[pair.n][pair.m] + 1); for(int i=0; i<4; i++) { int nextX= pair.m + dx[i]; int nextY= pair.n + dy[i]; if(nextX<0 || nextX>=m || nextY<0 || nextY >=n) { //탈출 System.out.println(deep); return; } if(val[nextY][nextX]==true || arr[nextY][nextX] == '#') continue; if(arr[nextY][nextX]!='.' && arr[nextY][nextX]<= deep) continue; val[nextY][nextX]=true; arr[nextY][nextX]= deep; queue.add(new Pair(nextX, nextY)); } } System.out.println("IMPOSSIBLE"); } } class Pair{ int m; int n; public Pair(int m,int n) { this.m=m; this.n=n; } }

제출 #97858

제출 정보

제출 결과

제출 코드

찾은 반례