import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main { static int R,C,fireX, fireY, jihunX, jihunY; static char[][] map; static boolean[][] visited; static int[] dx = {1,0, -1,0}; static int[] dy = {0,1,0,-1}; static int[][] jihunRoute, fireRoute; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); R = Integer.parseInt(st.nextToken()); C = Integer.parseInt(st.nextToken()); map = new char[R][C]; jihunRoute = new int[R][C]; fireRoute = new int[R][C]; visited = new boolean[R][C]; for(int i=0;i q = new LinkedList<>(); q.add(new int[] {x,y}); visited[x][y] = true; jihunRoute[x][y] = 0; while(!q.isEmpty()) { int[] cur = q.poll(); int cx = cur[0]; int cy = cur[1]; visited[cx][cy] = true; for(int i=0;i<4;i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; if(!onMap(nx, ny)) continue; if(visited[nx][ny] || map[nx][ny] == '#' || map[nx][ny] == 'F') continue; visited[nx][ny] = true; if(jihunRoute[nx][ny] + 1 >= fireRoute[nx][ny]) { continue; } jihunRoute[nx][ny] = jihunRoute[cx][cy] + 1; q.add(new int[] {nx, ny}); } } } static void fire(int x, int y) { Queue q = new LinkedList<>(); q.add(new int[] {x,y}); visited[x][y] = true; fireRoute[x][y] = 0; while(!q.isEmpty()) { int[] cur = q.poll(); int cx = cur[0]; int cy = cur[1]; visited[cx][cy] = true; for(int i=0;i<4;i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; if(!onMap(nx, ny)) continue; if(visited[nx][ny] || map[nx][ny] == '#') continue; visited[nx][ny] = true; fireRoute[nx][ny] = fireRoute[cx][cy] + 1; q.add(new int[] {nx, ny}); } } } static boolean onMap(int x, int y) { if(x < 0 || y < 0 || x >=R || y >= C) return false; return true; } }

제출 #63451

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: