Problem D
Mini Battleship

Battleship is a game played by two players. Each player has their own grid, which is hidden from their opponent. Each player secretly places some ships on their grid. Each ship covers a horizontal or vertical straight line of one or more contiguous squares. Ships cannot overlap. All ships are considered distinct, even if they have the same size. The orientation of each ship is not important to the game, only the squares they occupy.

After placing their ships, the players then take turns taking shots at their opponent’s ships by calling out a coordinate of their opponent’s grid. The opponent must honestly say whether the shot was a hit or a miss. When all of a ship’s squares are hit, that ship sinks (“You sunk my battleship!!”). A player loses when all of their ships are sunk.

Bob is playing a game of Mini Battleship against Alice. Regular Battleship is played on a $10 \! \times \! 10$ grid with $5$ ships. Mini Battleship is much smaller, with a grid no larger than $5 \! \times \! 5$ and possibly fewer than $5$ ships.

Bob wonders how many ship placements are possible on Alice’s board given what he knows so far. The answer will be $0$ if Alice is cheating! (Or, if the game setup isn’t possible.)


The first line of input contains two space-separated integers $n$ ($1 \le n \le 5$) and $k$ ($1 \le k \le 5$), which represent a game of Mini Battleship played on an $n \! \times \! n$ grid with $k$ ships.

Each of the next $n$ lines contains a string $s$ ($|s|=n$). This is what Bob sees of Alice’s grid so far.

  • A character ‘X’ represents one of Bob’s shots that missed.

  • A character ‘O’ (Letter O, not zero) represents one of Bob’s shots that hit.

  • A dot (‘.’) represents a square where Bob has not yet taken a shot.

Each of the next $k$ lines contains a single integer $x$ ($1 \le x \le n$). These are the sizes of the ships.


Output a single integer, which is the number of ways the $k$ distinct ships could be placed on Alice’s grid and be consistent with what Bob sees.

Sample Input 1 Sample Output 1
4 3
Sample Input 2 Sample Output 2
4 4
Sample Input 3 Sample Output 3
2 2
CPU Time limit 6 seconds
Memory limit 1024 MB
Statistics Show
License Creative Commons License (cc by-sa)

Please log in to submit a solution to this problem

Log in