-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathGeeksGarden.java
91 lines (87 loc) · 3.24 KB
/
GeeksGarden.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
/*https://practice.geeksforgeeks.org/problems/geekss-garden/0*/
import java.util.*;
import java.lang.*;
import java.io.*;
class Position implements Comparable<Position>
{
int r, c;
Position(int r, int c)
{
this.r = r;
this.c = c;
}
@Override
public int compareTo(Position p)
{
return 0;
}
}
class GFG
{
public static void main (String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int cases = Integer.parseInt(br.readLine());
String[] tokens;
String token;
int n, m, i, j;
char[][] rosarium;
Queue<Position> queue;
boolean[][] visited;
int currCount, maxCount;
Position p;
for (int ii = 0; ii < cases; ++ii)
{
tokens = br.readLine().trim().split(" +");
n = Integer.parseInt(tokens[0]);
m = Integer.parseInt(tokens[1]);
rosarium = new char[n][m];
visited = new boolean[n][m];
for (i = 0; i < n; ++i)
{
token = br.readLine();
for (j = 0; j < m; ++j)
rosarium[i][j] = token.charAt(j);
}
maxCount = 0; currCount = 0;
queue = new LinkedList<Position>();
for (i = 0; i < n; ++i)
{
for (j = 0; j < m; ++j)
{
if (!visited[i][j] && rosarium[i][j] == '1')
{
queue.add(new Position(i,j));
currCount = 0;
while (!queue.isEmpty())
{
p = queue.poll();
if (visited[p.r][p.c]) continue;
visited[p.r][p.c] = true;
++currCount;
if (p.r+1 < n && !visited[p.r+1][p.c] && rosarium[p.r+1][p.c] == '1')
queue.add(new Position(p.r+1,p.c));
if (p.r-1 >= 0 && !visited[p.r-1][p.c] && rosarium[p.r-1][p.c] == '1')
queue.add(new Position(p.r-1,p.c));
if (p.r+1 < n && p.c+1 < m && !visited[p.r+1][p.c+1] && rosarium[p.r+1][p.c+1] == '1')
queue.add(new Position(p.r+1,p.c+1));
if (p.r-1 >= 0 && p.c+1 < m && !visited[p.r-1][p.c+1] && rosarium[p.r-1][p.c+1] == '1')
queue.add(new Position(p.r-1,p.c+1));
if (p.r+1 < n && p.c-1 >= 0 && !visited[p.r+1][p.c-1] && rosarium[p.r+1][p.c-1] == '1')
queue.add(new Position(p.r+1,p.c-1));
if (p.r-1 >= 0 && p.c-1 >= 0 && !visited[p.r-1][p.c-1] && rosarium[p.r-1][p.c-1] == '1')
queue.add(new Position(p.r-1,p.c-1));
if (p.c+1 < m && !visited[p.r][p.c+1] && rosarium[p.r][p.c+1] == '1')
queue.add(new Position(p.r,p.c+1));
if (p.c-1 >= 0 && !visited[p.r][p.c-1] && rosarium[p.r][p.c-1] == '1')
queue.add(new Position(p.r,p.c-1));
}
if (currCount > maxCount) maxCount = currCount;
}
}
}
if (currCount > maxCount) maxCount = currCount;
System.out.println(maxCount);
}
}
}