Continuous Same Game (1) 简单的模拟dfs() 很好过

Problem Description

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) ). Now, he want to know how many points he will get. Can you help him?

 

Input

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 characters, indicating the color of the block. There are 5 colors, and each with equal probability.

 

Output

For each test case, output a single line containing the total point he will get with the greedy strategy. 

 

Sample Input

5 5
35552
31154
33222
21134
12314

 

Sample Output

32

Hint

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.

***************************************************************************************************************************

***************************************************************************************************************************

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;

char g[24][24] = {0};
bool use[24][24] = {0};
int dx, dy, n, m;
int zx[] = {-1, 0, 1, 0}, zy[] = {0, 1, 0, -1};

int find(int x, int y, char c)//找最大的区域
{
 int sum;
 int k;
 use[x][y] = true;
 sum = 1;
 for (k = 0; k < 4; ++k)
 {
  if(g[x + zx[k]][y + zy[k]] == c && !use[x + zx[k]][y + zy[k]])
  {
   sum += find(x + zx[k], y + zy[k], c);
  }
 }
 return sum;
}

void del(int x, int y, char c)//删除最大的块
{
 int k;
 g[x][y] = '0';
 for (k = 0; k < 4; ++k)
 {
  if(g[x + zx[k]][y + zy[k]] == c)
  {
   del(x + zx[k], y + zy[k], c);
  }
 }
}
void out();
void move()//矩阵之间元素的移动
{
 int i, j, k, last = m;;
// out();
 int x1, x2;
 for (j = 1; j <= last; ++j)
 {
  for (x1 = 1; x1 <= n && g[x1][j] == '0'; ++x1);
  if (x1 > n)
  {
   for (k = j; k < last; ++k)
   {
    for (i = 1; i <= n; ++i)
    {
     g[i][k] = g[i][k + 1];
    }
   }
   for (i = 1; i <= n; ++i)
   {
    g[i][last] = '0';
   }
   last--;
   j--;
   continue;
  }
  x2 = x1 + 1;
  while(x2 <= n)
  {
   if (g[x2][j] == '0')
   {
    for (i = x2; i > x1; --i)
    {
     g[i][j] = g[i - 1][j];
    }
    g[x1][j] = '0';
    x1++;
   }
   ++x2;
  }
 }

}
void solve()
{
 int i, j, ans = 0;
 int maxArea = 0;
 while(true)
 {
  memset(use, false, sizeof(use));
  maxArea = 0;
  for (i = 1; i <= n; ++i)
  {
   for (j = 1; j <= m; ++j)
   {
    if (!use[i][j] && g[i][j] != '0')
    {
     int t = find(i, j, g[i][j]);
     if (t > maxArea)
     {
      maxArea = t;
      dx = i;
      dy = j;
     }
    }
   }
  }
  if (maxArea <= 1)
   break;
  ans += maxArea * (maxArea - 1);
 // printf("%d
", maxArea * (maxArea - 1));
  del(dx, dy, g[dx][dy]);
  move();
 }
 printf("%d
", ans);
}

bool input()
{
 if (scanf("%d%d", &n, &m) == EOF)
  return false;
 memset(g, '0', sizeof(g));
 int i;
 for (i = 1; i <= n; ++i)
  scanf("%s", g[i] + 1);
 return true;
}

int main()
{
 while(input())
 {
  solve();
 }
 return 0;
}