import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { private static int[] dx = new int[]{0, 0, 1, -1, 0, 0}; private static int[] dy = new int[]{0, 0, 0, 0, 1, -1}; private static int[] dh; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int y = sc.nextInt(); int x = sc.nextInt(); int box = sc.nextInt(); dh = new int[]{x, x*(-1), 0, 0, 0, 0}; int[][] board = new int[x*box][y]; Queue queue = new LinkedList<>(); for (int i = 0; i < x*box; i++) { for (int j = 0; j < y; j++) { board[i][j] = sc.nextInt(); if (board[i][j] == 1) queue.add(new Node(i, j, 0)); } } int max = 0; while (!queue.isEmpty()) { Node poll = queue.poll(); int pollX = poll.x; int pollY = poll.y; int depth = poll.depth; max = Math.max(max, depth); for (int i = 0; i < 2; i++) { if (pollX + dh[i] >= 0 && pollX + dh[i] < x*box) { int nextX = pollX + dh[i]; if (board[nextX][pollY] == 0) { board[nextX][pollY] = 1; queue.add(new Node(nextX, pollY, depth+1)); } } } for (int i = 2; i < 6; i++) { if (pollX + dx[i] >= 0 && pollX + dx[i] < x*box && pollY + dy[i] >= 0 && pollY + dy[i] < y) { int nextX = pollX + dx[i]; int nextY = pollY + dy[i]; if (board[nextX][nextY] == 0) { board[nextX][nextY] = 1; queue.add(new Node(nextX, nextY, depth+1)); } } } } for (int i = 0; i < x*box; i++) { for (int j = 0; j < y; j++) { if (board[i][j] == 0) { System.out.println(-1); return; } } } System.out.println(max); } private static class Node { int x, y, depth; public Node(int x, int y, int depth) { this.x = x; this.y = y; this.depth = depth; } } }

제출 #85574

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: