Game of Diamond

短命女 2022-08-01 02:57 167阅读 0赞

## Problem J: Game of Diamond ##

Time Limit: 1 Sec   Memory Limit: 32 MB  
Submit: 8   Solved: 3  
\[ [Submit][]\]\[ [Status][]\]\[ [Web Board][]\]

## Description ##

Diamond mine is a mini-game which is played on an 8 \* 8 board as you can see below.

![1667.gif][]

The board is filled with different colors of diamonds. The player can make one move at a time. A move is

legal if it swaps two adjacent diamonds(not diagonally) and after that, there are three or more adjacent

diamonds in a row or column with the same color. Those diamonds will be taken away and new

diamonds will be put in their positions. The game continues until no legal moves exist.

Given the board description. You are going to determine whether a move is legal.

## Input ##

The input contains several cases. Each case has exactly 9 lines. The first 8 lines each contains a string

of 8 characters. The characters are 'R'(Red), 'O'(Orange), 'G'(Green), 'P'(Purple), 'W'(White), 'Y'(Yellow)

or 'B'(Blue). All characters are uppercase. No 3 diamonds of the same color are initially in adjacent

positions in a row or column. The last line has 4 integers in the form " row1 column1 row2 column2"

describing the postions of the 2 diamonds that the player wants to swap. Rows are marked 1 to 8

increasingly from top to bottom while columns from left to right. Input is terminated by EOF.

## Output ##

For each case, output "Ok!" if the move is legal or "Illegal move!" if it is not.

## Sample Input ##

PBPOWBGW
    RRPRYWWP
    YGBYYGPP
    OWYGGRWB
    GBBGBGGR
    GBWPPORG
    PPGORWOG
    WYWGYWBY
    4 3 3 3
    PBPOWBGW
    RRPRYWWP
    YGBYYGPP
    OWYGGRWB
    GBBGBGGR
    GBWPPORG
    PPGORWOG
    WYWGYWBY
    5 5 6 5

## Sample Output ##

Ok!
    Illegal move!

HINT

#include<cstdio>
    #include<cmath>
    #include<iostream>
    #include <string.h>
    
    using namespace std;
    char s[20][20];
    int iegal(int x1,int y1,int x2,int y2 )
    {
        if(abs(x1-x2)+abs(y1-y2)==1)
       // if(abs(x1+y1-x2-y2)==1)
        {
            return 1;
        }
        else
        {
            return 0;
        }
    }
    int success(int x,int y)
    {
      //  cout<<"char "<<s[x][y]<<" "<<x<<" "<<y<<endl;
        char c;
        c=s[x][y];
        int x1=x-2,i,flag=0,y1=y-2,j;
        if(x1<0)
        {
            x1=0;
        }
        if(y1<0)
        {
            y1=0;
        }
       // cout<<x<<" "<<y<<" "<<x1<<" "<<y1<<endl;
        for(i=x1;i<=x;i++)
        {
           // cout<<"cols  :"<<s[i][y]<<s[i+1][y]<<s[i+2][y]<<endl;
            if(s[i][y]==c&&s[i+1][y]==c&&s[i+2][y]==c)
            {
                flag=1;
                break;
            }
        }
        for(j=y1;j<=y;j++)
        {
          //  cout<<"rows :"<<s[x][j]<<s[x][j+1]<<s[x][j+2]<<endl;
            if(s[x][j]==c&&s[x][j+1]==c&&s[x][j+2]==c)
            {
                flag=1;
                break;
            }
        }
        return flag;
    }
    int main()
    {
        int i,j,sx,sy,ex,ey,flag;
        char c;
        memset(s, 0, sizeof(s));
        while(scanf("%s",s[0])!=EOF)
        {
            flag=0;
            for(i=1;i<8;i++)
            {
                scanf("%s",&s[i]);
            }
          /*  for(i=0;i<8;i++)
            {
                for(j=0;j<8;j++)
                {
                    printf("%c",s[i][j]);
                }
                printf("\n");
            }*/
            cin>>sx>>sy>>ex>>ey;
          //  cout<<sx<<" "<<sy<<" "<<s[sx-1][sy-1]<<" "<<ex<<" "<<ey<<" "<<s[ex-1][ey-1]<<endl;
            if(sx<0||sx>=8||sy<0||sy>=8||ex<0||ey>=8||ey<0||ey>=8)
            {
                cout<<"Illegal move!"<<endl;
                continue;
            }
            if(iegal(sx,sy,ex,ey))
            {
                c=s[sx-1][sy-1];
                s[sx-1][sy-1]=s[ex-1][ey-1];
                s[ex-1][ey-1]=c;
              /*  for(i=0;i<8;i++)
                {
                    for(j=0;j<8;j++)
                    {
                        printf("%c",s[i][j]);
                    }
                    printf("\n");
                }*/
                if(success(sx-1,sy-1))
                {
                    flag=1;
                }
                 if(success(ex-1,ey-1))
                {
                    flag=1;
                }
    
    
            }
            if(flag==0)
            {
                cout<<"Illegal move!"<<endl;
            }
            else
            {
                cout<<"OK!"<<endl;
            }
        }
    }
    /*
      #E#EE
      #E#E#
      E#E#E
      ##E#E
      */
    
    #E#EE123
    #E#E#312
    E#E#E456
    ##E#8789
    #E#EE123
    9E#E#312
    E#E#E456
    ##E#E789
    1 5 2 3

[Submit]: http://cst2.jlnu.edu.cn/acm/submitpage.php?cid=1007&pid=9&langmask=32756
[Status]: http://cst2.jlnu.edu.cn/acm/problemstatus.php?id=1667
[Web Board]: http://cst2.jlnu.edu.cn/acm/bbs.php?pid=1667&cid=1007
[1667.gif]: http://cst2.jlnu.edu.cn/acm/image/1667.gif