-
Notifications
You must be signed in to change notification settings - Fork 0
/
Drawing.java
128 lines (97 loc) · 3.24 KB
/
Drawing.java
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Queue;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class Drawing {
public static Node[][] resultArr;
public static int maxArea = Integer.MIN_VALUE;
public static int drawingCount = 0;
public static int[] dx = {1, -1, 0, 0};
public static int[] dy = {0, 0, 1, -1};
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
String[] infoArr = br.readLine().split(" ");
int height = Integer.parseInt(infoArr[0]);
int width = Integer.parseInt(infoArr[1]);
initResultArr(height, width);
for(int i = 0; i < height; i++) {
st = new StringTokenizer(br.readLine(), " ");
mkResultArr(st, i);
}
getResult();
System.out.println(drawingCount);
System.out.println(maxArea);
}
public static void getResult() {
for(int i = 0; i < resultArr.length; i++) {
for(int j = 0; j < resultArr[i].length; j++) {
Node node = resultArr[i][j];
if(node.isVisit()) continue;
if(node.getValue() == 0) continue;
drawingCount++;
maxArea = Math.max(bfs(node), maxArea);
}
}
if(drawingCount == 0) maxArea = 0;
}
public static int bfs(Node node) {
Queue<Node> resultQueue = new LinkedList<>();
resultQueue.offer(node);
int area = 0;
while(!resultQueue.isEmpty()) {
Node point = resultQueue.poll();
if(point.isVisit()) continue;
if(point.getValue() == 0) continue;
point.visitNode();
area++;
int xValue = point.getX();
int yValue = point.getY();
for(int i = 0; i < 4; i++) {
int x = dx[i] + xValue;
int y = dy[i] + yValue;
if(x < 0 || y < 0 || x >= resultArr[0].length || y >= resultArr.length) continue;
resultQueue.offer(resultArr[y][x]);
}
}
return area;
}
public static void mkResultArr(StringTokenizer st, int height) {
int numValue = 0;
for(;st.hasMoreTokens();) {
resultArr[height][numValue] = new Node(numValue, height, Integer.parseInt(st.nextToken()));
numValue++;
}
}
public static void initResultArr(int height, int width) {
resultArr = new Node[height][width];
}
public static class Node {
private int x;
private int y;
private int value;
private boolean visit;
public Node(int x, int y, int value) {
this.x = x;
this.y = y;
this.value = value;
this.visit = false;
}
public int getX() {
return this.x;
}
public int getY() {
return this.y;
}
public int getValue() {
return this.value;
}
public boolean isVisit() {
return this.visit;
}
public void visitNode() {
this.visit = true;
}
}
}