import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int[][] arr; static boolean[][] check; static int n, l, r, count = 0; static boolean isMove = true; static Queue q = new LinkedList<>(); static int[] dx = {1, 0, -1, 0}; static int[] dy = {0, 1, 0, -1}; 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()); l = Integer.parseInt(st.nextToken()); r = Integer.parseInt(st.nextToken()); arr = new int[n][n]; for (int i = 0; i < n; i++){ st = new StringTokenizer(br.readLine()); for (int j = 0; j < n; j++){ arr[i][j] = Integer.parseInt(st.nextToken()); } } while(isMove) { check = new boolean[n][n]; isMove = false; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (!check[i][j]) { for (int k = 0; k < 2; k++){ int nx = i + dx[k]; int ny = j + dy[k]; if(nx < n && ny < n && Math.abs(arr[i][j] - arr[nx][ny]) >= l && Math.abs(arr[i][j] - arr[nx][ny]) <= r && !check[nx][ny]) { bfs(new int[]{i, j}); } } } } } if(isMove) count++; } System.out.println(count); } static void bfs(int[] start){ isMove = true; q.add(start); check[start[0]][start[1]] = true; ArrayList list = new ArrayList<>(); int num = 0; while(!q.isEmpty()){ int[] cos = q.poll(); int x = cos[0]; int y = cos[1]; num += arr[x][y]; list.add(cos); 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 < n && Math.abs(arr[x][y] - arr[nx][ny]) >= l && Math.abs(arr[x][y] - arr[nx][ny]) <= r && !check[nx][ny]){ q.add(new int[]{nx, ny}); check[nx][ny] = true; } } } int m = num / list.size(); for (int[] set : list){ arr[set[0]][set[1]] = m; } } }

제출 #68698

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: