import java.io.*; import java.util.*; public class Main { static int sec = 0; static int n; static int[] di = {0, 1, 0, -1}; // 우, 하, 좌, 상 static int[] dj = {1, 0, -1, 0}; // 우, 하, 좌, 상 public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); n = Integer.parseInt(br.readLine()); int k = Integer.parseInt(br.readLine()); int[][] apple = new int[n + 1][n + 1]; boolean[][] graph = new boolean[n + 1][n + 1]; Map map = new HashMap<>(); List list = new ArrayList<>(); for (boolean[] g : graph) { Arrays.fill(g, false); } StringTokenizer st; for (int i = 0; i < k; i++) { st = new StringTokenizer(br.readLine()); int idx = Integer.parseInt(st.nextToken()), jdx = Integer.parseInt(st.nextToken()); apple[idx][jdx] = 1; } int l = Integer.parseInt(br.readLine()); for (int i = 0; i < l; i++) { st = new StringTokenizer(br.readLine()); int x = Integer.parseInt(st.nextToken()); String c = st.nextToken(); map.put(x, c); } dfs(graph, 1, 1, apple, map, list, 0); System.out.println(sec); } private static void dfs(boolean[][] graph, int i, int j, int[][] apple, Map map, List list, int direction) { if (i < 1 || i > n || j < 1 || j > n || graph[i][j]) { return; } if (apple[i][j] != 1) { if (!list.isEmpty()) { int[] idx = list.get(0); list.remove(0); graph[idx[0]][idx[1]] = false; } } list.add(new int[]{i, j}); graph[i][j] = true; if (map.containsKey(sec)) { String forward = map.get(sec); switch (forward) { case "D" : direction = (direction + 1) % 4; break; case "L" : direction = (direction + 3) % 4; break; } } sec++; dfs(graph, i + di[direction], j + dj[direction], apple, map, list, direction); } }

제출 #19082

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: