MUDDY - Muddy Fields
Rain has pummeled on the cows' field, a rectangular grid of R rows and C columns (1 <= R <= 50, 1 <= C <= 50). While good for the grass, the rain makes some patches of bare earth quite muddy. The cows, being meticulous grazers, don't want to get their hooves dirty while they eat.
To prevent those muddy hooves, Farmer John will place a number of wooden boards over the muddy parts of the cows' field. Each of the boards is 1 unit wide, and can be any length long. Each board must be aligned parallel to one of the sides of the field.
Farmer John wishes to minimize the number of boards needed to cover the muddy spots, some of which might require more than one board to cover. The boards may not cover any grass and deprive the cows of grazing area but they can overlap each other.
Compute the minimum number of boards FJ requires to cover all the mud in the field.
t – the number of test cases, then t test cases follows.
Each test case is of the following form:
Two space-separated integers: R and C, then R lines follows
Each line contains a string of C characters, with '*' representing a muddy patch, and '.' representing a grassy patch. No spaces are present.
For each test case output a single integer representing the number of boards FJ needs.
Input: 1 4 4 *.*. .*** ***. ..*. Output: 4 Output details: Boards 1, 2, 3 and 4 are placed as follows: 1.2. .333 444. ..2. Board 2 overlaps boards 3 and 4.
took me a long time to solve this problem only cause i had many issues constructing the graph >:d, great problem! although i found some solutions accepted that are SO WRONG, they do the algorithm with nodes that do self loops and they got ACed not good at all
Altamir Gomes Bispo Junior [UFSCar]:
It's 2 because the boards aren't allowed to cover any of the grass.
Lewin Gan , it must be 1 !
Don't put problems at spoj if you cannot make your test data tough. Your problem accepts a wrong solution also.
Give some test cases more!