ZOJ Problem Set - 3048
Continuous Same Game is a simple game played on a grid of colored blocks. Groups of two or more connected (orthogonally, not diagonally) blocks that are the same color may be removed from the board. When a group of blocks is removed, the blocks above those removed ones fall down into the empty space. When an entire column of blocks is removed, all the columns to the right of that column shift to the left to fill the empty columns. Points are scored whenever a group of blocks is removed. The number of points per block increases as the group becomes bigger. When N blocks are removed, N*(N-1) points are scored.
LL was interested in this game at one time, but he found it is so difficult to find the optimal scheme. So he always play the game with a greedy strategy: choose the largest group to remove and if there are more than one largest group with equal number of blocks, choose the one which contains the most preceding block ( (x1,y1) is in front of (x2,y2) if and only if (x1<x2 || x1==x2 && y1<y2), where x stands for the rows from top to bottom and y stands for the columns from left to right). Now, he want to know how many points he will get. Can you help him?
Each test case begins with two integers n,m ( 5<= n, m <=20 ), which is the size of the board. Then n lines follow, each contains m digits ranging from 1 to 5, indicating the color of the block.
For each test case, output a single line containing the total point he will get with the greedy strategy, use '0' to represent empty blocks.
5 5 35552 31154 33222 21134 12314Sample Output
35552 00552 00002 00002 00000 00000 31154 05154 05104 00004 00002 00000 33222 -> 01222 -> 01222 -> 00122 -> 00104 -> 00100 21134 21134 21134 25234 25234 25230 12314 12314 12314 12314 12314 12312 The total point is 12+6+6+2+6=32.
Author: LAI, Li
Source: ZOJ Monthly, October 2008