-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIslands.java
More file actions
154 lines (123 loc) · 4.34 KB
/
Copy pathIslands.java
File metadata and controls
154 lines (123 loc) · 4.34 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
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.*;
public class Islands {
public static int dfs(char[][] picture,int[][] visited,int row, int column, int srcR, int srcC) {
int r = row;
int c = column;
int sourceRow = srcR;
int sourceC = srcC;
if (visited[sourceRow][sourceC] == 0) {
visited[sourceRow][sourceC] = 1;
// int[] directionR = { -1 , 1 , 0 , 0}; // up, down, left,right
// int[] directionC = { 0, 0, -1, 1};
// for (int i = 0; i < 4; i++) {
// int x = srcR + directionR[i];
// int y = srcC + directionC[i];
// if ( x < 0 || y < 0 || x >= r || y >= c) {
// continue;
// }
// if (( picture[x][y] == 'C' || picture[x][y] == 'L') && visited[x][y] == 0 ) {
// dfs(picture,visited,r,c,x,y);
// }
// }
if ( (!(sourceC + 1 >= c)) && (visited[srcR][sourceC+1] == 0) && (picture[srcR][sourceC+1] == 'C' || picture[srcR][sourceC+1] == 'L')) { //go right
dfs(picture,visited,r,c,srcR,sourceC+1);
}
if ((!(sourceC - 1 < 0)) && (visited[srcR][sourceC-1] == 0) && (picture[srcR][sourceC-1] == 'C' || picture[srcR][sourceC-1] == 'L')) { //go left
dfs(picture,visited,r,c,srcR,sourceC-1);
}
if ((!(srcR - 1 < 0)) && (visited[srcR - 1][sourceC] == 0) && (picture[srcR - 1][sourceC] == 'C' || picture[srcR-1][sourceC] == 'L')) { //go up
dfs(picture,visited,r,c,srcR-1,sourceC);
}
if ((!(srcR + 1 >= r)) && (visited[srcR+1][sourceC] == 0) && (picture[srcR+1][sourceC] == 'C' || picture[srcR+1][sourceC] == 'L')) { //go down
dfs(picture,visited,r,c,srcR+1,sourceC);
}
}
return 0;
}
public static void main(String[] args) {
FastIO fio = new FastIO();
int r = fio.nextInt();
int c = fio.nextInt();
char[][] image = new char[r][c];
int[][] visited = new int[r][c];
int counter = 0;
for(int i = 0; i < r ; i ++) {
char[] temp = fio.nextLine().toCharArray();
for (int j = 0; j < c; j++) {
image[i][j] = temp[j];
visited[i][j] = 0;
}
}
for ( int i = 0; i < r ; i ++) {
for (int j = 0; j < c ; j ++) {
if (image[i][j] == 'L' && visited[i][j] == 0) {
dfs(image,visited,r,c,i,j);
counter++;
}
}
}
fio.print(counter);
fio.close();
}
}
/**
* Fast I/O
* @source https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/
*/
class FastIO extends PrintWriter
{
BufferedReader br;
StringTokenizer st;
public FastIO()
{
super(new BufferedOutputStream(System.out));
br = new BufferedReader(new
InputStreamReader(System.in));
}
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;
}
}