import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main { static int MAX = 987654321; static int N,M; static int[][] map; static class Edge{ int x; int y; Edge(int x,int y){ this.x=x; this.y=y; } } static int[] dx = {-1,1,0,0}; static int[] dy = {0,0,-1,1}; static boolean[][] visited; static int target = 0; static int result= MAX; public static void main(String[] args) throws IOException{ 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][N]; int count=0; for(int i=0; i queue = new LinkedList<>(); queue.offer(new Edge(x,y)); while(!queue.isEmpty()) { Edge cur = queue.poll(); for(int i=0; i<4; i++) { int nx = cur.x+dx[i]; int ny = cur.y+dy[i]; if(nx<0 || ny <0 || nx>=N || ny>=N) { continue; } if(visited[nx][ny]) { continue; } visited[nx][ny]=true; if(map[nx][ny]==2) { distance = Math.min(distance, (Math.abs(ny-y)+ Math.abs(nx-x))); } queue.offer(new Edge(nx,ny)); } } return distance; } public static void findResult(int[][] map, int count) { if(target - count == 0) { //DebugPrint(map); 디버깅용 int way=0; for(int i=0; i

제출 #31906

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: