-
Notifications
You must be signed in to change notification settings - Fork 694
/
Copy pathSolution.java
465 lines (407 loc) · 10.6 KB
/
Solution.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
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
//Problem: https://www.hackerrank.com/challenges/bomber-man
//Java 8
/*
We can simply keep three sets of bombs
1 second bombs
2 second bombs
3 second bombs
Then iteratively detonate and plant bombs each cycle
Cycle: 2
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 3
OOO.OOO
OO...OO
OOO...O
..OO.OO
...OOOO
...OOOO
Cycle: 4
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 5
.......
...O...
....O..
.......
OO.....
OO.....
Cycle: 6
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 7
OOO.OOO
OO...OO
OOO...O
..OO.OO
...OOOO
...OOOO
Cycle: 8
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 9
.......
...O...
....O..
.......
OO.....
OO.....
Cycle: 10
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 11
OOO.OOO
OO...OO
OOO...O
..OO.OO
...OOOO
...OOOO
Cycle: 12
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 13
.......
...O...
....O..
.......
OO.....
OO.....
Cycle: 14
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 15
OOO.OOO
OO...OO
OOO...O
..OO.OO
...OOOO
...OOOO
Cycle: 16
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 17
.......
...O...
....O..
.......
OO.....
OO.....
Cycle: 18
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Cycle: 19
OOO.OOO
OO...OO
OOO...O
..OO.OO
...OOOO
...OOOO
Cycle: 20
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
OOOOOOO
Grouping based on pattern
1 | 2 | 3 | 4
5 | 6 | 7 | 8
9 | 10| 11| 12
13| 14| 15| 16
17| 18| 19| 20
We see there are only 4 cycles, and all even cycles are the same grid
so if we have a even cycle we can just print a full grid
If we have an odd cycle then there are two different grids to choose from
we can find which grid the number corresponds to by doing n % 4
Time Complexity: O(m*n) //We must build the result which is a m*n matrix
Space Complexity: O(m*n) //We store every bomb in a map so our Maps cumulative size is O(n*m)
*/
import java.io.*;
import java.util.*;
public class Solution {
static Map<Integer,Map<Integer,Integer>> threeSecondBombs = new HashMap<>();
static Map<Integer,Map<Integer,Integer>> twoSecondBombs = new HashMap<>();
static Map<Integer,Map<Integer,Integer>> oneSecondBombs = new HashMap<>();
static Map<Integer,Map<Integer,Integer>> damagedBombs = new HashMap<>();
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner input = new Scanner(System.in);
int row = input.nextInt();
int col = input.nextInt();
int n = input.nextInt();
input.nextLine();
if(n % 2 == 0)//If n is even we always have a full grid of bombs
{
n = 2;
}
else if(n > 3) //We are in a repeated pattern(See example above) so we only do either 5 or 7 iterations
{
n = (n % 4)+4;
}
//Initialze variables according to input grid
char[][] grid = new char[row][col];
for(int i = 0; i < row; i++)
{
String readRow = input.nextLine();
for(int j = 0; j < col; j++)
{
if(readRow.charAt(j) == 'O')
{
if(threeSecondBombs.get(i) == null)
{
Map<Integer,Integer> map = new HashMap<Integer, Integer>();
threeSecondBombs.put(i, map);
threeSecondBombs.get(i).put(j,0);
}
else
{
threeSecondBombs.get(i).put(j,0);
}
}
grid[i][j] = readRow.charAt(j);
}
}
int cycle = 2;
//Plant all the 2 second bombs
if(cycle <= n)//2 second cycle
{
plantBombs(twoSecondBombs, grid);
cycle++;
//System.out.println("Plant 2 sec bombs");
//System.out.println("Cycle: 2");
//printGrid(grid);
}
if(cycle <= n)//3 second cycle
{
detonateBombs(threeSecondBombs, grid);
threeSecondBombs = new HashMap<>();
cycle++;
//System.out.println("Detonate 3 sec bombs");
//System.out.println("Cycle: 3");
//printGrid(grid);
}
//All future cycles
//These will function as switches where false is place bomb and true is detonate bomb
boolean one = false;
boolean two = true;
boolean three = false;
while(cycle <= n)
{
//System.out.println("Cycle: "+cycle);
if(cycle % 3 == 1)//One cycle
{
if(!one)
{
plantBombs(oneSecondBombs, grid);
one = !one;
//System.out.println("Plant 1 sec bombs");
}
else
{
detonateBombs(oneSecondBombs, grid);
one = !one;
//System.out.println("Detonate 1 sec bombs");
}
}
else if(cycle % 3 == 2)//Two cycle
{
if(!two)
{
plantBombs(twoSecondBombs, grid);
two = !two;
//System.out.println("Plant 2 sec bombs");
}
else
{
detonateBombs(twoSecondBombs, grid);
two = !two;
//System.out.println("Detonate 2 sec bombs");
}
}
else if(cycle % 3 == 0)//Three cycle
{
if(!three)
{
plantBombs(threeSecondBombs, grid);
three = !three;
//System.out.println("Plant 3 sec bombs");
}
else
{
detonateBombs(threeSecondBombs, grid);
three = !three;
//System.out.println("Detonate 3 sec bombs");
}
}
cycle++;
//printGrid(grid); //Grid after each cycle
}
//Print the output grid
printGrid(grid);
}
//Plants a bomb on all open tiles
static void plantBombs(Map<Integer,Map<Integer,Integer>> bombSet, char[][] grid)
{
for(int i = 0; i < grid.length; i++)
{
for(int j = 0; j < grid[0].length; j++)
{
if(grid[i][j] == '.')
{
//System.out.println("Planting 2s Bomb");
if(bombSet.get(i) == null)
{
//System.out.println("No bomb in row "+i);
Map<Integer,Integer> map = new HashMap<Integer, Integer>();
bombSet.put(i, map);
bombSet.get(i).put(j,0);
}
else
{
bombSet.get(i).put(j,0);
}
grid[i][j] = 'O';
}
}
}
}
//Detonates bombs of a given Map updating the other maps and the grid
static void detonateBombs(Map<Integer,Map<Integer,Integer>> bombSet, char[][] grid)
{
for(Map.Entry<Integer, Map<Integer,Integer>> x : bombSet.entrySet())
{
int px = x.getKey();
for(Map.Entry<Integer,Integer> y : x.getValue().entrySet())
{
removeDamage(px,y.getKey(),grid);
}
}
for(Map.Entry<Integer, Map<Integer,Integer>> x : damagedBombs.entrySet())
{
int px = x.getKey();
for(Map.Entry<Integer,Integer> y : x.getValue().entrySet())
{
//System.out.println("Removing Bomb at("+px+","+y.getKey()+")");
if(threeSecondBombs.get(px) != null)
{
threeSecondBombs.get(px).remove(y.getKey());
//System.out.println("Removing 3s Bomb");
}
if(twoSecondBombs.get(px) != null)
{
twoSecondBombs.get(px).remove(y.getKey());
//System.out.println("Removing 2s Bomb");
}
if(oneSecondBombs.get(px) != null)
{
oneSecondBombs.get(px).remove(y.getKey());
//System.out.println("Removing 1s Bomb");
}
}
}
damagedBombs = new HashMap<>();//Remove the bombs now that we have removed all damage
}
//Replaces all surrounding O with . and adds surrounding to a list of damaged bombs
static void removeDamage(int x, int y, char[][] grid)
{
grid[x][y] = '.';
removeBomb(x, y);
//Left
if(y-1 >= 0)
{
grid[x][y-1] = '.';
removeBomb(x, y-1);
}
//Right
if(y+1 < grid[0].length)
{
grid[x][y+1] = '.';
removeBomb(x, y+1);
}
//Up
if(x-1 >= 0)
{
grid[x-1][y] = '.';
removeBomb(x-1, y);
}
//Down
if(x+1 < grid.length)
{
grid[x+1][y] = '.';
removeBomb(x+1, y);
}
}
//Adds a bomb to the Map of damaged bombs
static void removeBomb(int x, int y)
{
if(damagedBombs.get(x) == null)
{
Map<Integer,Integer> map = new HashMap<Integer, Integer>();
damagedBombs.put(x, map);
damagedBombs.get(x).put(y,0);
}
else
{
damagedBombs.get(x).put(y,0);
}
}
static void printBombSet(Map<Integer,Map<Integer,Integer>> bombSet)
{
for(Map.Entry<Integer, Map<Integer,Integer>> x : bombSet.entrySet())
{
int px = x.getKey();
for(Map.Entry<Integer,Integer> y : x.getValue().entrySet())
{
System.out.println("("+px+","+y.getKey()+")");
}
}
}
static void printGrid(char[][] grid)
{
for(char[] l : grid)
{
for(char m : l)
{
System.out.print(m);
}
System.out.println("");
}
//System.out.println(""); //Uncomment if you are printing iteratively
}
}