The Same Game(模拟)

http://poj.org/problem?id=1027

题意：给一个10*15的地图，里面填充R,G,B三种颜色，每次找到当前地图的同色最大区域M，并将其删除，删除M后，上面的小球自然下落，当有空列时，空列右边的小球同时向左移动一列，

        当最后地图上同色最大区域的小球个数是1或0时，循环结束；注意输出格式，最后输出一个空行。

思路：

while(true)

{

　　找到同色最大区域，包括其面积Maxsize，坐标，颜色（BFS，手写队列）;

　　if (Maxsize == 1 || Maxsize == 0) break;

　　删除该最大区域，即将map[i][j] 置为0，（BFS,手写队列）；

　　重置地图；

　　输出；

} 

 

#include<stdio.h>
#include<string.h>
char map[20][20];
bool vis[20][20];
int MaxR,MaxC;//分别存同色最大区域左下角坐标
int Maxsize;//Maxsize存最大面积
char Maxcolor;//最大同色区域的颜色；

int Area(int i,int j)//搜索当前同色区域面积
{
    struct node
    {
        int x,y;
    }que[160];

    int head,tail;
    head = tail = 0;

    que[tail].x = i;
    que[tail++].y = j;
    vis[i][j] = true;

    char color = map[i][j];
    int size = 0;
    while(head < tail)
    {
        int x = que[head].x;
        int y = que[head++].y;
        size++;

        if((x+1)<10 && !vis[x+1][y] && map[x+1][y] == color)
        {
            que[tail].x = x+1;
            que[tail++].y = y;
            vis[x+1][y] = true;
        }
        if((x-1)>=0 && !vis[x-1][y] && map[x-1][y] == color)
        {
            que[tail].x = x-1;
            que[tail++].y = y;
            vis[x-1][y] = true;
        }
        if((y-1)>=0 && !vis[x][y-1] && map[x][y-1] == color)
        {
            que[tail].x = x;
            que[tail++].y = y-1;
            vis[x][y-1] = true;
        }
        if((y+1)<15 && !vis[x][y+1] && map[x][y+1] == color)
        {
            que[tail].x = x;
            que[tail++].y = y+1;
            vis[x][y+1] = true;
        }
    }
    return size;
}

void SearchArea()//搜索同色最大区域；
{
    int i,j;
    memset(vis,false,sizeof(vis));
    Maxsize = 0;
    for(j = 0; j < 15; j++)
    {
        for(i = 0; i < 10; i++)
        {
            int size = -1;
            if(!vis[i][j] && map[i][j])
            {
                size = Area(i,j);
                if(size > Maxsize)
                {
                    Maxsize = size;
                    MaxR = i;
                    MaxC = j;
                    Maxcolor = map[MaxR][MaxC];
                }
            }
        }
    }
}


void DelArea()//删除最大区域
{
    struct node
    {
        int x,y;
    }que[160];
    int head,tail;
    head = tail = 0;
    que[tail].x = MaxR;
    que[tail++].y = MaxC;

    Maxcolor = map[MaxR][MaxC];
    map[MaxR][MaxC] = 0;

    while(head < tail)
    {
        int x = que[head].x;
        int y = que[head++].y;
        map[x][y] = 0;

        if(x+1 < 10 && map[x+1][y] == Maxcolor)
        {
            map[x+1][y] = 0;
            que[tail].x = x+1;
            que[tail++].y = y;
        }
        if(x-1 >= 0 && map[x-1][y] == Maxcolor)
        {
            map[x-1][y] = 0;
            que[tail].x = x-1;
            que[tail++].y = y;
        }
        if(y-1 >= 0 && map[x][y-1] == Maxcolor)
        {
            map[x][y-1] = 0;
            que[tail].x = x;
            que[tail++].y = y-1;
        }
        if(y+1 < 15 && map[x][y+1] == Maxcolor)
        {
            map[x][y+1] = 0;
            que[tail].x = x;
            que[tail++].y = y+1;
        }
    }
}

void NewMap()//重置
{
    bool empty[15] = {false};//记录哪一列是空列
    int i,j;
    for(j = 0; j < 15; j++)//重置行
    {
        int ti = -1;//表示第ti行是空的，ti = -1 表示现在没有空行；
        bool flag = false;
        for(i = 0; i < 10; i++)
        {
            if(map[i][j])
            {
                flag = true;
                if(ti != -1)
                {
                    map[ti][j] = map[i][j];//将第i行移至第ti行
                    map[i][j] = 0;//将第i行置0；
                    i = ti;//从ti行开始再一次枚举；
                    ti = -1;
                }
            }
            else
            {
                ti = i;
                while(i+1 < 10 && !map[i+1][j])
                    i++;
            }
        }
        if(!flag)
            empty[j] = true;
    }
    int tj = -1;//表示第tj列是空的，tj = -1说明现在好没有空列
    for(j = 0; j < 15; j++)//重置列
    {
        if(!empty[j])//如果第j列是不空的
        {
            if(tj != -1)
            {
                for(i = 0; i < 10; i++)
                {
                    map[i][tj] = map[i][j];
                    map[i][j] = 0;
                }
                empty[j] = true;
                j = tj;
                tj = -1;
            }
        }
        else
        {
            tj = j;
            while(j+1<15 && empty[j+1])
                j++;
        }
    }
}

int main()
{
    int test;
    scanf("%d",&test);
    for(int item = 1; item <= test; item++)
    {
        for(int i = 9; i >= 0; i--)
            scanf("%s",map[i]);

        printf("Game %d:\n\n",item);

        int Balls = 150;
        int step = 0;
        int sumscore = 0;
        while(true)
        {
            Maxsize = -1;
            SearchArea();//寻找同色最大区域；
            if(Maxsize == 0 || Maxsize == 1)
                break;

            DelArea();//删除当前最大区域
            NewMap();//重置

            int score = (Maxsize-2)*(Maxsize-2);
            printf("Move %d at (%d,%d): removed %d balls of color %c, got %d points.\n",++step,MaxR+1,MaxC+1,Maxsize,Maxcolor,score);
            Balls = Balls - Maxsize;
            sumscore += score;
        }
        if(Balls == 0)
            sumscore += 1000;
        printf("Final score: %d, with %d balls remaining.\n\n",sumscore,Balls);
    }
    return 0;
}