import java.util.*; import java.io.*; public class Main { static int n, m; static int[][] arr; static int[][] result; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); n = Integer.parseInt(st.nextToken()); m = Integer.parseInt(st.nextToken()); arr = new int[n][m]; result = new int[n][m]; int startX = 0; int startY = 0; for(int i=0; i queue = new LinkedList<>(); queue.add(new int[] {x, y, 0}); while(!queue.isEmpty()) { int[] cur = queue.poll(); int cx = cur[0]; int cy = cur[1]; int cd = cur[2]; for(int i=0; i<4; i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; int nd = cd + 1; if(!isValid(nx, ny) || arr[nx][ny] == 0) continue; if(result[nx][ny] > nd) { result[nx][ny] = nd; queue.add(new int[] {nx, ny, nd}); } } } for(int i=0; i -1 && y > -1 && x < n && y < m; } } package baekjoons; import java.util.*; import java.io.*; public class Main { static int n, m; static int[][] arr; static int[][] result; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); n = Integer.parseInt(st.nextToken()); m = Integer.parseInt(st.nextToken()); arr = new int[n][m]; result = new int[n][m]; int startX = 0; int startY = 0; for(int i=0; i queue = new LinkedList<>(); queue.add(new int[] {x, y, 0}); while(!queue.isEmpty()) { int[] cur = queue.poll(); int cx = cur[0]; int cy = cur[1]; int cd = cur[2]; for(int i=0; i<4; i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; int nd = cd + 1; if(!isValid(nx, ny) || arr[nx][ny] == 0) continue; if(result[nx][ny] > nd) { result[nx][ny] = nd; queue.add(new int[] {nx, ny, nd}); } } } for(int i=0; i -1 && y > -1 && x < n && y < m; } }

제출 #33373

제출 정보

제출 결과

제출 코드

찾은 반례