package algo; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class boj_14940 { static int n,m; static int[][] map; static boolean[][] visited; 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()); n = Integer.parseInt(st.nextToken()); //세로 m = Integer.parseInt(st.nextToken()); //가로 map = new int[n][m]; visited = new boolean[n][m]; for(int i=0;i q = new LinkedList<>(); q.add(new int[] {i, j}); visited[i][j] = true; map[i][j] = 0; while(!q.isEmpty()) { int[] c = q.poll(); int cx = c[0]; int cy = c[1]; for(int k=0;k<4;k++) { int nx = cx + dx[k]; int ny = cy + dy[k]; if(nx <0 || ny < 0 || nx >= n || ny >= m) continue; if(visited[nx][ny] || map[nx][ny] != 1) continue; map[nx][ny] = map[cx][cy] + 1; visited[nx][ny] = true; q.add(new int[] {nx,ny}); } } } static boolean canGo(int i, int j) { for(int k=0;k<4;k++) { int nx = i + dx[k]; int ny = j + dy[k]; if(nx < 0 || ny < 0 || nx >=n || ny >= m) { continue; } if(map[nx][ny] != 0) return true; } return false; } }

제출 #53502

제출 정보

제출 결과

제출 코드

찾은 반례