SJSU Weekly Practice Problems 1/2

#### Start

2022-01-02 20:00 AKST

## SJSU Weekly Practice Problems 1/2

#### End

2022-01-09 20:00 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -139 days 20:56:31

168:00:00

0:00:00

# Problem OBoom!

Photo by whatleydude on flickr.
Luntas Pangkraschek wants to clear some old tree stumps from his backyard and attacks the problem like any other; with explosives.

Blowing things up usually requires careful planning, something Luntas is not especially good at. He has randomly thrown a number of bombs on his backyard, which can be seen as a grid of width and height $N$. Now he only has one bomb left, which he intends to use to start the explosion and the resulting chain reactions.

A bomb explodes in a cross along the axes of the grid, with a blast radius of $R$. If a bomb comes in the way of an explosion, that bomb will explode as well. Explosions can not pass through the many rocks in Luntas backyard though. If an explosion reaches a tree stump, it will blow the stump up and continue through the stump. A blast radius of $R$ means that the blast will affect all the squares with distance at most $R$, which have either the same $x$-coordinate or the same $y$-coordinate as the bomb itself.

He now needs your help to find out at how many locations he can place his last bomb, such that if it explodes, all the stumps on the field will blow up. He may only place the last bomb on an empty square.

## Input

The first line consists of two integers: the backyard size $1 \le N \le 1\, 000$ and the blast radius $1 \le R \le 20$. Then follow $N$ lines with $N$ characters each, describing the backyard as an $N \times N$ grid. Each character is one of:

. – an empty square.

# – an obstacle.

* – a bomb.

S – a tree stump.

## Output

Output should consist of a single integer; the number of locations Luntas can place the last bomb on to blow all the stumps up.

Sample Input 1 Sample Output 1
5 3
.*S#.
.....
....#
.*...
.S...

7

Sample Input 2 Sample Output 2
5 2
..S..
..#..
S#.#S
..#..
..S..

0