1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1b:T653, import java.util.ArrayDeque; import java.util.Deque; import java.util.Scanner; import java.util.TreeSet; public class Main { static int[] dx = {-1, 0, 1, 0}; static int[] dy = {0, 1, 0, -1}; static int[][] board; static int N; static int num = 1; static int res; public static void main(String[] args) { Main T = new Main(); TreeSet numHouse = new TreeSet<>(); Scanner scanner = new Scanner(System.in); N = scanner.nextInt(); scanner.nextLine(); board = new int[N][N]; for (int i = 0; i < N; i++) { String line = scanner.nextLine(); for (int j = 0; j < N; j++) { board[i][j] = line.charAt(j) - '0'; } } for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if(board[i][j] == 1){ num++; res = 1; numHouse.add(T.DFS(i, j)); } } } System.out.println(numHouse.size()); for (int i = 0; i < num - 1; i++) { System.out.println(numHouse.pollFirst()); } public int DFS(int x, int y){ board[x][y] = num; for (int i = 0; i < 4; i++) { int tempx = x + dx[i]; int tempy = y + dy[i]; if(tempx >= 0 && tempy >= 0 && tempx < N && tempy < N && board[tempx][tempy] == 1){ board[tempx][tempy] = nu

제출 #63979

제출 정보

제출 결과

제출 코드

찾은 반례