import java.util.*; import java.io.*; import java.nio.Buffer; public class Main { static int N,M; static List list; static int[][] arr; static int[][] tmp; static int zero; private static class Point{ int x; int y; int num; Point(int x, int y, int num){ this.x = x; this.y = y; this.num = num; } } public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); N = Integer.parseInt(st.nextToken()); M = Integer.parseInt(st.nextToken()); arr = new int[N][M]; list = new ArrayList<>(); zero = 0; for(int i = 0; i < N; i++) { st = new StringTokenizer(br.readLine()); for (int j = 0; j < M; j++) { arr[i][j] = Integer.parseInt(st.nextToken()); if (arr[i][j] == 0) zero++; if (arr[i][j] == 5) list.add(new Point(i, j, 5)); else if (arr[i][j] == 4) list.add(new Point(i, j, 4)); else if (arr[i][j] == 3) list.add(new Point(i, j, 3)); else if (arr[i][j] == 2) list.add(new Point(i, j, 2)); else if (arr[i][j] == 1) list.add(new Point(i, j, 1)); } } for(Point p : list){ int row = p.x; int col = p.y; int num = p.num; if(num == 1) { zero -= Num1(row,col); } if(num == 2){ zero -= Num2(row,col); } if(num == 3){ zero -= Num3(row,col); } if(num == 4){ zero -= Num4(row, col); } if(num == 5){ zero -= Num5(row, col); } } System.out.println(zero); } //main static private int Num5(int row, int col){ // 좌우 상하 int z = 0; //우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ z++; arr[row][c] = -1; } } //좌 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ z++; arr[row][c] = -1; } } // 상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0){ z++; arr[r][col] = -1; } } // 하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0){ z++; arr[r][col] = -1; } } return z; } static private int Num4(int row, int col){ //좌우상 int one = 0; // 좌우 하 int two = 0; //우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ one++; two++; } } //좌 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ one++; two++; } } // 상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) one++; } // 하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) two++; } int Max = Math.max(one, two); if(one == Max){ //우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ arr[row][c] = -1; } } //좌 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ arr[row][c] = -1; } } // 상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return one; } else{ // 좌우 하 //우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ arr[row][c] = -1; } } //좌 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0){ arr[row][c] = -1; } } // 하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return two; } } // Num4 static private int Num3(int row, int col){ //우 상 //우 int one = 0; for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) one++; } // 상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) one++; } // 좌 상 int two = 0; //좌 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) two++; } //상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) two++; } // 좌 하 //좌 int thr = 0; for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) thr++; } //하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) thr++; } //우 하 int four = 0; // 우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) four++; } //하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) four++; } int Max = Math.max(one, Math.max(two,Math.max(thr,four))); if(one == Max){ //우 상 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } // 상 for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return one; } else if(two == Max){ // 좌 상 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return two; } else if(thr == Max){ // 좌 하 for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } //하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return thr; } else{ // 우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } //하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return four; } } static private int Num2(int row, int col){ //좌우 int one = 0; for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) one++; } //우 for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) one++; } //상하 // 상 int two = 0; for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) two++; } // 하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) two++; } int Max = Math.max(one, two); if(one == Max){ for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } return one; } else{ for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } // 하 for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return two; } } // Num2 static private int Num1(int row, int col){ // 좌 int one = 0; for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) one++; } //우 int two = 0; for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) two++; } // 상 int thr = 0; for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) thr++; } // 하 int four = 0; for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) four++; } int Max = Math.max(one, Math.max(two,Math.max(thr,four))); if(one == Max){ for(int c = col -1; c >= 0; c--){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } return one; } else if(two == Max){ for(int c = col + 1; c < M; c++){ if(arr[row][c] == 6) break; if(arr[row][c] == 0) arr[row][c] = -1; } return two; } else if(thr == Max){ for(int r = row - 1; r >= 0; r--){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return thr; } else{ for(int r = row + 1; r < N; r++){ if(arr[r][col] == 6) break; if(arr[r][col] == 0) arr[r][col] = -1; } return four; } } // Num1 }

제출 #43259

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: