📍 문제 설명 💡 접근 전형적인 BFS 문제 👩💻 코드 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, v, e, k, answer, cnt; static int[][] board; static int[] arr; static long[] dp; static boolean[][] visited; static int[] dx = {-1,1,0,0}; static int[] dy = {0,0,-1,1}; static ArrayList list = new ArrayList(); static StringBuilder sb = new Strin..