import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main { static char[][] map; static int[][] water, gosumdochi; static boolean[][] visited; static int R, C; static int[] dx = {1,0,-1,0}; static int[] dy = {0,1,0,-1}; 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]; water = new int[R][C]; gosumdochi = new int[R][C]; int waterX = 0, waterY = 0; int gosumdochiX = 0, gosumdochiY = 0; int goalX = 0, goalY = 0; boolean isWater = false; for(int i=0;i=R || ny >=C) continue; if(water[nx][ny] > gosumdochi[nx][ny] || (water[nx][ny] == 0 && gosumdochi[nx][ny] != 0)) { flag = true; if(ans > gosumdochi[nx][ny] + 1) ans = gosumdochi[nx][ny] + 1; } } if(flag) System.out.println(ans); else System.out.println("KAKTUS"); } static void waterBfs(int x , int y) { Queue q = new LinkedList<>(); q.add(new int[] {x,y}); visited[x][y] = true; while(!q.isEmpty()) { int[] c = q.poll(); int cx = c[0]; int cy = c[1]; for(int i=0;i<4;i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; if(nx < 0 || ny < 0 || nx >= R || ny >= C) continue; if(visited[nx][ny] || map[nx][ny] == 'X' || map[nx][ny] == 'D') continue; visited[nx][ny] = true; water[nx][ny] = water[cx][cy] + 1; q.add(new int[] {nx, ny}); } } } static void gosumdochiBfs(int x , int y) { Queue q = new LinkedList<>(); q.add(new int[] {x,y}); visited[x][y] = true; while(!q.isEmpty()) { int[] c = q.poll(); int cx = c[0]; int cy = c[1]; for(int i=0;i<4;i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; if(nx < 0 || ny < 0 || nx >= R || ny >= C) continue; if(visited[nx][ny] || map[nx][ny] == 'X' || map[nx][ny] == '*') continue; gosumdochi[nx][ny] = gosumdochi[cx][cy] + 1; visited[nx][ny] = true; q.add(new int[] {nx, ny}); } } } }

제출 #58611

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: