import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { static int[][] map; static int N, M; static int[] dx = { 0, 1, 0, -1 }; static int[] dy = { -1, 0, 1, 0 }; static int angle; static int now_x; static int now_y; static int clean_count = 0; public static void main(String[] args) throws IOException { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); N = Integer.parseInt(st.nextToken()); M = Integer.parseInt(st.nextToken()); st = new StringTokenizer(br.readLine()); now_y = Integer.parseInt(st.nextToken()); now_x = Integer.parseInt(st.nextToken()); angle = Integer.parseInt(st.nextToken()); map = new int[N][M]; for (int i = 0; i < N; i++) { String[] line = br.readLine().split(" "); for (int j = 0; j < M; j++) { map[i][j] = Integer.parseInt(line[j]); } } while (true) { if (map[now_y][now_x] == 0) { clean(); } if (check()) { angle= (angle+3)%4; System.out.println(angle); if(map[now_y+dy[angle]][now_x+dx[angle]]==0) { now_x+=dx[angle]; now_y+=dy[angle]; } } else { int nx = now_x - dx[angle]; int ny = now_y - dy[angle]; if (nx < 0 || nx >= M || ny < 0 || ny >= N || map[ny][nx] == 1) { break; } now_x = nx; now_y = ny; } } System.out.println(clean_count); } static void clean() { if (map[now_y][now_x] == 0) { map[now_y][now_x] = 2; clean_count++; } } static boolean check() { for (int i=0; i<4;i++) { int nx = now_x + dx[i]; int ny = now_y + dy[i]; if (nx > 0 || nx <= M || ny > 0 || ny <= N) { if(map[ny][nx]==0) { return true; } } } return false; } // static boolean check() // { // for (int i = 1; i < 5; i++) // { // int nx = now_x + dx[(angle - i + 4) % 4]; // int ny = now_y + dy[(angle - i + 4) % 4]; //// System.out.println(nx); //// System.out.println(ny); // if (nx < 0 || nx >= M || ny < 0 || ny >= N) // { // continue; // } // else // { // if (map[ny][nx] == 0) // { // angle = (angle - i + 4) % 4; // return true; // } // } // } // return false; // } }

제출 #16724

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: