forked from bamsarts/DS-ALGO
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathx-total-shapes.java
86 lines (85 loc) · 2.68 KB
/
x-total-shapes.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
/**
* CREATED BY ROSHAN SINGH
*
*/
import java.io.*;
import java.util.*;
class Main{
static class FastScanner { // for string + number
BufferedReader br;
StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastScanner(String file) throws IOException{
br = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
static void helper(char[][] a,boolean[][] visited,int x,int y){
if(visited[x][y]) return;
visited[x][y] = true;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if(Math.abs(i) != Math.abs(j) && (x+i) >= 0 && (y+j) >= 0 && (x+i) < a.length && (y+j) < a[0].length && a[x+i][y+j] == 'X') helper(a,visited,x+i,y+j);
}
}
}
public static void main(String[] args) throws IOException {
FastScanner s = new FastScanner();
// FastScanner s = new FastScanner("INPUT");
OutputStream outputStream = System.out;
// OutputStream outputStream = new FileOutputStream("OUTPUT");
PrintWriter o = new PrintWriter(outputStream);
// start
int t = s.nextInt();
while (t-->0){
int n = s.nextInt();
int m = s.nextInt();
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = s.next().toCharArray();
}
boolean[][] visited = new boolean[n][m];
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if(a[i][j] == 'X' && !visited[i][j]){
helper(a,visited,i,j);
count++;
}
}
}
o.println(count);
}
// end
o.close();
}
}