CCO Preparation Test 5 P1 - City Game - DMOJ: Modern Online Judge

CCO Preparation Test 5 P1 - City Game

View as PDF

Submit solution

All submissions

Best submissions

Points: 15

Time limit: 0.1s

Java 0.3s

Memory limit: 32M

Problem type

Allowed languages

C, C++, Java, Pascal

Bruce is a strategy game programming specialist. In his new city building game, the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildings. There is still some space in the area that is unoccupied. The strategic task of his game is to win as much rent money from these free spaces. To win rent money you must erect buildings, that can only be rectangular, as long and wide as you can. Bruce is trying to find a way to erect the biggest possible building in each area. But he comes across some problems – he is not allowed to destroy already existing buildings, trees, factories and streets in the area he is building in.

Each area has its width and length. The area is divided into a grid of equal square units. The rent paid for each unit on which your building stands is $$3$ ~$3~.

Your task is to help Bruce solve this problem. The whole city is divided into $K$ ~K~ areas. Each one of the areas is rectangular and has a different grid size with its own length $M$ ~M~ and width $N$ ~N~. The existing occupied units are marked with the symbol R. The unoccupied units are marked with the symbol F.

Input Specification

The first line of the input contains an integer $K$ ~K~ – determining the number of datasets. Next lines contain the area descriptions. One description is defined in the following way: The first line contains two integers – length $M \le 1000$ ~M \le 1000~ and width $N \le 1000$ ~N \le 1000~, separated by a blank space. The next $M$ ~M~ lines contain $N$ ~N~ symbols that mark the reserved or free grid units, separated by a blank space. The symbols used are:
R – reserved unit
F – free unit
At the end of each area description, there is a separating line.

Output Specification

For each data set in the input print on a separate line, on the standard output, the integer that represents the profit obtained by erecting the largest building in the area encoded by the data set.

Sample Input

2
5 6
R F F F F F
F F F F F F
R R R F F F
F F F F F F
F F F F F F

5 5
R R R R R
R R R R R
R R R R R
R R R R R
R R R R R

Sample Output

45
0

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation.

Comments

1

1yangdan commented on Jan. 6, 2018, 12:34 a.m. ← edited →

Is it promised that there will be only one largest building?

2

aeternalis1 commented on Jan. 6, 2018, 3:47 p.m. ← edited →

If there happens to be more than one 'largest' building, the profits will be the same and thus the answer will be the same regardless. The problem statement does not specify that the largest building will be unique, so don't assume it is.

6

ImbaCalvin commented on Dec. 16, 2016, 12:14 a.m. ← edited →

How is this a dynamic programming problem?

7

bobhob314 commented on March 20, 2016, 6:33 p.m. ← edit 2 →

Hey Bruce, what are the restrictions on $K$ ~K~?

3

bruce commented on March 23, 2016, 1:16 a.m. ← edited →

$K$ ~K~ is less than 20

6

fifiman commented on March 22, 2016, 9:09 p.m. ← edited →

Aim for $NM$ ~NM~ per testcase