import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, max = 0; static int[] dx = {0, 1, 0, -1}; static int[] dy = {1, 0, -1, 0}; static int[][] arr, arr2; static boolean[][] check; static Queue q = new LinkedList<>(); 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()); arr = new int[n][m]; arr2 = new int[n][m]; check = new boolean[n][m]; for (int i = 0; i < n; i++) { String str = br.readLine(); for (int j = 0; j < m; j++) { arr[i][j] = str.charAt(j) == 'W' ? -1: 0; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[i][j] == 0) { for (int k = 0; k < n; k++) { arr2[k] = arr[k].clone(); } bfs(i,j); } } } System.out.println(max); } static void bfs(int x, int y) { q.add(new int[]{x, y}); check[x][y] = true; while (!q.isEmpty()) { int[] cos = q.poll(); for (int i = 0; i < 4; i++) { int nx = cos[0] + dx[i]; int ny = cos[1] + dy[i]; if (nx >= 0 && ny >= 0 && nx < n && ny < m && arr2[nx][ny] == 0 && !check[nx][ny]) { arr2[nx][ny] = arr2[cos[0]][cos[1]] + 1; q.add(new int[]{nx, ny}); check[nx][ny] = true; max = Math.max(max, arr2[nx][ny]); } } } } }

제출 #172575

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: