import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { private static int[][] directions = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; private static int[][] map; private static int N, M; 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][M]; st = new StringTokenizer(br.readLine()); int robotX = Integer.parseInt(st.nextToken()); int robotY = Integer.parseInt(st.nextToken()); int robotDir = Integer.parseInt(st.nextToken()); Robot robot = new Robot(robotX, robotY, robotDir); for(int i = 0; i < N; i++) { st = new StringTokenizer(br.readLine()); for (int j = 0; j < M; j++) { map[i][j] = Integer.parseInt(st.nextToken()); } } robot.execute(); System.out.println(robot.count); } private static class Robot { int x, y; int dir; boolean[][] visited; int count = 1; private Robot(int x, int y, int dir) { this.x = x; this.y = y; this.dir = dir; visited = new boolean[N][M]; visited[x][y] = true; } private void execute() { if (isCleanable()) { clean(); execute(); } else { if (isPossibleBackward()) { backward(); execute(); } } } private void clean() { for (int i = 1; i <= 4; i++) { dir = (4 + (dir - i)) % 4; int[] direction = directions[dir]; int nx = x + direction[0]; int ny = y + direction[1]; if (nx < 0 || ny < 0 || nx >= N || ny >= M) continue; if (!visited[nx][ny] && map[nx][ny] != 1) { visited[nx][ny] = true; count++; x = nx; y = ny; return; } } } private void backward() { x += directions[dir][0] * -1; y += directions[dir][1] * -1; } private boolean isPossibleBackward() { int bx = x + directions[dir][0] * -1; int by = y + directions[dir][1] * -1; return bx >= 0 && by >= 0 && bx < N && by < M && map[bx][by] != 1; } private boolean isCleanable() { for (int i = 0; i < 4; i++) { int nDir = (4 + (dir - i)) % 4; int[] direction = directions[nDir]; int nx = x + direction[0]; int ny = y + direction[1]; if (nx < 0 || ny < 0 || nx >= N || ny >= M) continue; if (!visited[nx][ny] && map[nx][ny] != 1) { return true; } } return false; } } }

제출 #24876

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: