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 h; static int w; 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(); int testCase = Integer.parseInt(st.nextToken()); for(int i=0; i fq = new ArrayDeque(); Queue sq = new ArrayDeque(); for(int j=0; j=w || y<0 || y>=h) continue; if(map[y][x] == '#' || fDist[y][x] >= 0) continue; fDist[y][x] = fDist[cur[0]][cur[1]] + 1; fq.offer(new int[]{y,x}); } } boolean possible = false; //상근이 bfs while(!sq.isEmpty()){ int[] cur = sq.poll(); for(int j=0; j<4; j++){ int x = cur[1] + dx[j]; int y = cur[0] + dy[j]; if(x<0 || x>=w || y<0 || y>=h){ sb.append(sDist[cur[0]][cur[1]] + 1); sb.append('\n'); possible = true; break; } if(map[y][x] == '#' || sDist[y][x] >= 0) continue; if(sDist[cur[0]][cur[1]] + 1 >= fDist[y][x]) continue; sDist[y][x] = sDist[cur[0]][cur[1]] + 1; sq.offer(new int[]{y,x}); } if(possible){ break; } } if(!possible){ sb.append("IMPOSSIBLE"); sb.append('\n'); } } System.out.print(sb.toString()); } }

제출 #33148

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: