import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int N, K, L; static boolean flag; static int[][] apple, map; static ArrayList dir; static Queue queue; 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()); st = new StringTokenizer(br.readLine()); K = Integer.parseInt(st.nextToken()); apple = new int[N + 1][N + 1]; map = new int[N + 1][N + 1]; dir = new ArrayList<>(); queue = new LinkedList<>(); map[1][1] = 3; for (int i = 0; i < K; i++) { st = new StringTokenizer(br.readLine()); int a = Integer.parseInt(st.nextToken()); int b = Integer.parseInt(st.nextToken()); apple[a][b] = 1; } L = Integer.parseInt(br.readLine()); for (int i = 0; i < L; i++) { st = new StringTokenizer(br.readLine()); String a = st.nextToken(); String b = st.nextToken(); dir.add(new String[] {a, b}); } int x = 1; int y = 1; int[] head = new int[] { x, y }; int[] tail = new int[] { x, y }; int direction = 0; map[1][1] = 3; int index = 0; String dir1 = dir.get(0)[0]; String dir2 = dir.get(0)[1]; int count = 0; queue.add(new int[] {1, 1}); while(head[0] >= 0 && head[0] <= N && head[1] >= 0 && head[1] <= N) { count++; int h1 = head[0]; int h2 = head[1]; if (count == Integer.parseInt(dir1)) { if (dir2.equals("L")) { if (direction < 1) { direction = direction + 3; } else { direction = (direction - 1) % 4; } } else { direction = (direction + 1) % 4; } index++; if (index < dir.size()) { dir1 = dir.get(index)[0]; dir2 = dir.get(index)[1]; } } if (apple[h1][h2] == 1) { if (direction == 0) { head[1]++; } else if (direction == 1) { head[0]++; } else if (direction == 2) { head[1]--; } else if (direction == 3) { head[0]--; } apple[h1][h2] = 0; } else { map[tail[0]][tail[1]] = 0; int[] s = queue.poll(); if (direction == 0) { head[1]++; tail[0] = s[0]; tail[1] = s[1]; } else if (direction == 1) { head[0]++; tail[0] = s[0]; tail[1] = s[1]; } else if (direction == 2) { head[1]--; tail[0] = s[0]; tail[1] = s[1]; } else if (direction == 3) { head[0]--; tail[0] = s[0]; tail[1] = s[1]; } } if (head[0] < 0 || head[1] < 0 || head[0] > N || head[1] > N) { break; } if (map[head[0]][head[1]] == 3) { break; } map[head[0]][head[1]] = 3; queue.add(new int[] {head[0], head[1]}); // for (int i = 1; i <= N; i++) { // for (int j = 1; j <= N; j++) { // System.out.print(map[i][j] + " "); // } // System.out.println(); // } // System.out.println(); } System.out.println(count); } }

제출 #107109

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: