import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.StringTokenizer; //시간 초과 public class Main { static int[][] arr; static boolean[][] visited; static boolean[][] copy; static int result = 0; static int n; static int[] dx = {-1, 1, -1, 1}; static int[] dy = {-1, 1, 1, -1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); n = Integer.parseInt(br.readLine()); arr = new int[n][n]; visited = new boolean[n][n]; copy = new boolean[n][n]; for (int i = 0; i < n; i++) { StringTokenizer st = new StringTokenizer(br.readLine()); for (int j = 0; j < n; j++) arr[i][j] = Integer.parseInt(st.nextToken()); } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { solve(i, j); if(visited[i][j]) result++; } } /*for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) copy[i][j] = visited[i][j]; }*/ for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if(arr[i][j] != 0 && visited[i][j]) { copy = new boolean[n][n]; int bufferResult = 0; for (int k = 0; k < n; k++) { for (int l = 0; l < n; l++) { if (k == i && l == j) continue; solve2(k, l); if (copy[k][l]) bufferResult++; } } result = Math.max(result, bufferResult); } } } System.out.println(result); } private static void solve(int x, int y) { if(arr[x][y] == 1) { int buffX = x-1; int buffY = y-1; while (buffX >= 0 && buffY >= 0) { if(visited[buffX][buffY]) return; buffX--; buffY--; } buffX = x + 1; buffY = y + 1; while (buffX < n && buffY < n) { if(visited[buffX][buffY]) return; buffX++; buffY++; } buffX = x - 1; buffY = y + 1; while (buffX >= 0 && buffY < n) { if(visited[buffX][buffY]) return; buffX--; buffY++; } buffX = x + 1; buffY = y - 1; while (buffX < n && buffY >= 0) { if(visited[buffX][buffY]) return; buffX++; buffY--; } visited[x][y] = true; } } private static void solve2(int x, int y) { if(arr[x][y] == 1) { int buffX = x-1; int buffY = y-1; while (buffX >= 0 && buffY >= 0) { if(copy[buffX][buffY]) return; buffX--; buffY--; } buffX = x + 1; buffY = y + 1; while (buffX < n && buffY < n) { if(copy[buffX][buffY]) return; buffX++; buffY++; } buffX = x - 1; buffY = y + 1; while (buffX >= 0 && buffY < n) { if(copy[buffX][buffY]) return; buffX--; buffY++; } buffX = x + 1; buffY = y - 1; while (buffX < n && buffY >= 0) { if(copy[buffX][buffY]) return; buffX++; buffY--; } copy[x][y] = true; } } }

제출 #153844

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: