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 { static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); static StringBuilder sb = new StringBuilder(); static char[][] arr; static boolean[][] visited; static boolean[][] fireloc; static int w; static int h; static Queue queue; static boolean isEscaped; static int time; public static void main(String[] args) throws NumberFormatException, IOException { int T = Integer.parseInt(br.readLine()); StringTokenizer st; for (int t=1;t<=T;t++) { st = new StringTokenizer(br.readLine()); w = Integer.parseInt(st.nextToken()); h = Integer.parseInt(st.nextToken()); time = 0; arr = new char[h][w]; visited = new boolean[h][w]; for (int i=0;i(); isEscaped = false; for (int i=0;i0&&bound(x,y)&&!visited[x][y]) { visited[x][y] = true; if(isEscaped(x,y)) { time = dist; isEscaped = true; break; } else { if (bound(x+1,y)&&!visited[x+1][y]) queue.add(new int[] {x+1,y,dist+1}); if (bound(x-1,y)&&!visited[x-1][y]) queue.add(new int[] {x-1,y,dist+1}); if (bound(x,y+1)&&!visited[x][y+1]) queue.add(new int[] {x,y+1,dist+1}); if (bound(x,y-1)&&!visited[x][y-1]) queue.add(new int[] {x,y-1,dist+1}); } } else if (dist==0) { if (bound(x+1,y)) { arr[x+1][y] = '*'; queue.add(new int[] {x+1,y,0}); } if (bound(x-1,y)) { arr[x-1][y] = '*'; queue.add(new int[] {x-1,y,0}); } if (bound(x,y+1)) { arr[x][y+1] = '*'; queue.add(new int[] {x,y+1,0}); } if (bound(x,y-1)) { arr[x][y-1] = '*'; queue.add(new int[] {x,y-1,0}); } } } if (isEscaped) { sb.append(time).append("\n"); } else { sb.append("IMPOSSIBLE\n"); } } System.out.println(sb); } static boolean isEscaped(int x,int y) { if (x-1<0||x+1>=h||y-1<0||y+1>=w) { return true; } else { return false; } } static boolean bound(int x,int y) { if (x<0||x>=h||y<0||y>=w||arr[x][y]=='*'||arr[x][y]=='#') { return false; } else { return true; } } }

제출 #10860

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: