Canadian Computing Competition: 2003 Stage 1, Junior #5, Senior #3

The floor plan of a house shows rooms separated by walls. This floor plan can be transferred to a grid using the character I for walls and . for room space. Doorways are not shown. Each I or . character occupies one square metre.

In this diagram, there are six rooms.

You have been given the floor plan of a house and a supply of hardwood flooring. You are to determine how many rooms will have the flooring installed if you start installing the floor in the largest room first and move to the next largest room, and so on. You may not skip over any room, and you must stop when you do not have enough wood for the next room. Output the number of rooms that can have hardwood installed, and how many square metres of flooring are left over. No room will be larger than \(64\) square metres. Note that if there is exactly one room, please output room instead of rooms .

The first line contains the number of square metres of flooring you have. The second line contains an integer \(r\) in range \(1 \dots 25\) that represents the number of rows in the grid. The third line contains an integer \(c\) in \(1 \dots 25\) that represents the number of columns in the grid. The remaining \(r\) lines contain \(c\) characters of grid data.

Sample Input 1

105
14
16
IIIIIIIIIIIIIIII
I......I.......I
I......III.....I
I........I.....I
I........IIIIIII
IIIIIIIIII.....I
I.I......I.....I
III..III.I.....I
I....I.IIIII...I
I....I.....III.I
I....I.......I.I
I....I.....III.I
I....I.....I...I
IIIIIIIIIIIIIIII

Output for Sample Input 1

4 rooms, 1 square metre(s) left over

Sample Input 2

13
2
3
.I.
.I.

Output for Sample Input 2

2 rooms, 9 square metre(s) left over