코더의 개발 일지

import java.util.Scanner;public class Main { static int N,M,count; static int[][] dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {-1, 1}, {-1, -1}, {1, -1}}; static int[][] Nary; static boolean[][] visited; static StringBuilder sb = new StringBuilder(); public static void input() { Scanner scan = new Scanner(System.in); N = scan.nextInt(); M = scan.nextIn..

import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main { static int N; //체스판 크기 static int[][] dist; //이동 횟수 static boolean[][] visited; //방문 여부 static int[][] dir = {{-2, -1}, {-2, 1}, {0, -2}, {0, 2}, {2, -1}, {2, 1}}; //데스나이트 static int deathKnightX,deathKnightY,endDeathKnightX,endDeathKnightY; static StringBuilder sb = new StringBuilde..

1.Scanner : 436ms import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main { static int N,M,T,knightX,knightY,min = Integer.MAX_VALUE,mid; //mid (1+2) 1.검을 찾을때까지의 거리 +2.검을 찾고 벽을 허물면서 가는 거리 static int[][] Nary; static boolean[][] visited; static int[][] dist; static int[][] dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; public static void input() ..