Tetris2

来源：互联网发布：阿里移动推荐算法大赛编辑：程序博客网时间：2024/06/05 14:39

int get_holes()
{
int height_col=20,holes=0;
for (int x=0;x<=9;x++)
{
  height_col = 20;
  for (int y=2;y<=20;y++)
  {
   if(pool_image[x][y] == 0 && pool_image[x][y-1] == 1)
   {
    holes++;
   }
  }
}
return holes;
}

int get_well()
{
int deep=0,y;
for (int x=1;x<=8;x++)
{
  for (y=1;y<=20;y++)
  {
   if( ((pool_image[x-1][y] & pool_image[x+1][y])!=0) && pool_image[x][y]==0)
   {
    deep ++;
    for (int k=y+1;k<=21;k++)
    {
     if (pool_image[x][k]==0)
      deep++;
     else
      break;
    }

   }
  }
}

for (y=1;y<=20;y++)
{
  if( (pool_image[0][y] == 0) & (pool_image[1][y] == 1))
  {
   deep ++;
   for (int k=y+1;k<=21;k++)
   {
    if (pool_image[x][k]==0)
     deep++;
    else
     break;
   }

  }
}

for (y=1;y<=20;y++)
{
  if((pool_image[9][y] == 0) & (pool_image[8][y] == 1))
  {
   deep ++;
   for (int k=y+1;k<=21;k++)
   {
    if (pool_image[x][k]==0)
     deep++;
    else
     break;
   }

  }
}
return deep;
}