Repository navigation
Expand file tree
/
Copy pathJustNumber2667.java
More file actions
77 lines (67 loc) · 1.72 KB
/
Copy pathJustNumber2667.java
File metadata and controls
77 lines (67 loc) · 1.72 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
package boj;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;
public class JustNumber2667 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] arr = new int[n+2][n+2];
String[][] sArr = new String[n+2][n+2];
for(int i = 1; i <= n; i++) {
sArr[i] = sc.next().split("");
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
arr[i][j] = Integer.parseInt(sArr[i][j-1]);
}
}
sc.close();
boolean visit[][] = new boolean[arr.length][arr.length];
List<Integer> list = new ArrayList<>();
Queue<int[]> q = new LinkedList<>();
for(int i = 1; i < arr.length; i++) {
for(int j = 1; j < arr.length; j++) {
if(arr[i][j] == 1 && visit[i][j] == false) {
visit[i][j] = true;
int[] qArr = new int[2];
qArr[0] = i;
qArr[1] = j;
q.add(qArr);
bfs(arr, visit, q, 0, list);
}
}
}
System.out.println(list.size());
Collections.sort(list);
for(int intVal : list) {
System.out.println(intVal);
}
}
public static void bfs(int[][] arr, boolean[][] visit, Queue<int[]> q, int cnt, List<Integer> list) {
if(q.isEmpty()) {
list.add(cnt);
return;
}
int[] qArr = q.poll();
cnt += 1;
int[] minusX = {-1, 1, 0, 0};
int[] minusY = {0, 0, -1, 1};
for(int i = 0; i < 4; i++) {
int x = qArr[0] + minusX[i];
int y = qArr[1] + minusY[i];
if(arr[x][y] == 1 && visit[x][y] == false) {
visit[x][y] = true;
int[] newArr = new int[2];
newArr[0] = x;
newArr[1] = y;
q.add(newArr);
}
}
bfs(arr, visit, q, cnt, list);
}
}