BEAKJOON JAVA ALGORITHM #1012(유기농배추)

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class a1012 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int num=Integer.parseInt(br.readLine()); for(int i=0;i<num;i++){ 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][n]; boolean[][] boo=new boolean[m][n]; for(int j=0;j<k;j++){ token=new StringTokenizer(br.readLine()); int x=Integer.parseInt(token.nextToken()); int y=Integer.parseInt(token.nextToken()); arr[x][y]=1; } int[] dx={-1,0,1,0}; int[] dy={0,1,0,-1}; Queue<findd> que=new LinkedList<>(); ArrayList<Integer> cnt=new ArrayList<>(); for(int p=0;p<m;p++){ for(int q=0;q<n;q++){ if(arr[p][q]==1 && !boo[p][q]){ int rcnt=0; que.add(new findd(p,q)); boo[p][q]=true; rcnt++; while(!que.isEmpty()){ findd f=que.poll(); for(int r=0;r<4;r++){ int rx=f.x+dx[r]; int ry=f.y+dy[r]; if((rx>=0 && rx<m) && (ry>=0 && ry<n) && arr[rx][ry]==1 && !boo[rx][ry]){ que.add(new findd(rx,ry)); boo[rx][ry]=true; rcnt++; } } } cnt.add(rcnt); } } } System.out.println(cnt.size()); } } } class findd{ int x; int y; findd(int x, int y){ this.x=x; this.y=y; } }