BEAKJOON JAVA ALGORITHM #2583(영역구하기)

https://www.acmicpc.net/problem/2583

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class a2583 { public static void main(String[] args) throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); StringTokenizer token=new StringTokenizer(br.readLine()); int m=Integer.parseInt(token.nextToken()); int n=Integer.parseInt(token.nextToken()); int k=Integer.parseInt(token.nextToken()); int[][] arr=new int[m+2][n+2]; boolean[][] boo=new boolean[m+2][n+2]; for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ arr[i][j]=1; } } for(int i=0;i<k;i++){ token=new StringTokenizer(br.readLine()); int x1=Integer.parseInt(token.nextToken()); int y1=Integer.parseInt(token.nextToken()); int x2=Integer.parseInt(token.nextToken()); int y2=Integer.parseInt(token.nextToken()); for(int p=y1+1;p<=y2;p++){ for(int q=x1+1;q<=x2;q++){ arr[p][q]=0; } } } int[] dx={-1,0,1,0}; int[] dy={0,1,0,-1}; ArrayList<Integer> cnt=new ArrayList<>(); Queue<find> q=new LinkedList<>(); for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ if(arr[i][j]==1 && !boo[i][j]){ int rcnt=0; q.add(new find(i,j)); boo[i][j]=true; rcnt++; while(!q.isEmpty()){ find f=q.poll(); for(int h=0;h<4;h++){ int rx=f.x+dx[h]; int ry=f.y+dy[h]; if(arr[rx][ry]==1 && !boo[rx][ry]){ q.add(new find(rx,ry)); boo[rx][ry]=true; rcnt++; } } } cnt.add(rcnt); } } } System.out.println(cnt.size()); Collections.sort(cnt); //오름차순으로 정렬 for(int cnt2:cnt){ System.out.print(cnt2+" "); } } } class find{ int x; int y; find(int x, int y){ this.x=x; this.y=y; } }