HDU 3368 Reversi

Reversi

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1364    Accepted Submission(s): 540

Problem Description

Reversi, also called Othello, is a two-sided game.
Each of the two sides corresponds to one player; they are referred to here as light and dark after the sides of Othello pieces, but "heads" and "tails" would identify them equally as well, so long as each marker has sufficiently distinctive sides.
Originally, Reversi did not have a defined starting position. Later it adopted Othello's rules, which state that the game begins with four markers placed in a square in the middle of the grid, two facing light-up, two pieces with the dark side up. The dark player makes the first move.


Dark must place a piece with the dark side up on the board, in such a position that there exists at least one straight (horizontal, vertical, or diagonal) occupied line between the new piece and another dark piece, with one or more contiguous light pieces between them. In the below situation, dark has the following options indicated by transparent pieces:


After placing the piece, dark turns over (flips, captures) all light pieces lying on a straight line between the new piece and any anchoring dark pieces. All reversed pieces now show the dark side, and dark can use them in later moves—unless light has reversed them back in the meantime. In other words, a valid move is one where at least one piece is reversed.
If dark decided to put a piece in the topmost location (all choices are strategically equivalent at this time), one piece gets turned over, so that the board appears thus:


Now light plays. This player operates under the same rules, with the roles reversed: light lays down a light piece, causing a dark piece to flip. Possibilities at this time appear thus (indicated by transparent pieces):


Light takes the bottom left option and reverses one piece:


Players take alternate turns. If one player cannot make a valid move, play passes back to the other player. When neither player can move, the game ends. This occurs when the grid has filled up, or when one player has no more pieces on the board, or when neither player can legally place a piece in any of the remaining squares. The player with the most pieces on the board at the end of the game wins.
Now after several rounds, it’s dark’s turn. Can you figure out the largest number of light pieces he can turn over?

 

Input

The first line contains one integer T representing the number of test cases.
For each test case, there’re 8 lines. Each line contains 8 characters (D represents dark, L represents light, * represents nothing here).
Every two adjacent cases are separated by a blank line.

 

Output

For each test case, in one line print the case number and the largest number of light pieces the dark player can turn over. If he can’t put one piece in any position, then print 0.
Please follow the format of the sample output.

 

Sample Input

3 ******** ******** ******** ***LD*** ***DL*** ******** ******** ******** ******** ******** **DLL*** **DLLL** **DLD*** ******** ******** ******** ******** ******** *D****** *DLLD*** ***LL*** **D*D*** ******** ********

 

Sample Output

Case 1: 1 Case 2: 3 Case 3: 0

 

Source

“光庭杯”第五届华中北区程序设计邀请赛 暨 WHU第八届程序设计竞赛

 

Recommend

 

lcy   |   We have carefully selected several similar problems for you:  1010 1045 1258 1426 1175

 

开始做错的原因就是因为没考虑这种情况，
*****D**

*****L**

*****L**

*****L**

DLLLL***

********

********

********

后来稍微修改了一下就a了

#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 12

int dx[]={1,-1, 0, 0,1, 1,-1,-1};
int dy[]={0, 0, 1,-1,1,-1,-1, 1};


int n;
char mat[N][N];
int v[N][N];
int dfs1(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs(%d,%d,%d)
",x,y,t+1);
    dfs1(x+1,y,t+1);
}
int dfs2(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs2(%d,%d,%d)
",x,y,t+1);
    dfs2(x-1,y,t+1);
}
int dfs3(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs3(%d,%d,%d)
",x,y,t+1);
    dfs3(x,y+1,t+1);
}
int dfs4(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs4(%d,%d,%d)
",x,y,t+1);
    dfs4(x,y-1,t+1);
}
int dfs5(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs4(%d,%d,%d)
",x,y,t+1);
    dfs5(x+1,y+1,t+1);
}
int dfs6(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs4(%d,%d,%d)
",x,y,t+1);
    dfs6(x-1,y-1,t+1);
}
int dfs7(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs4(%d,%d,%d)
",x,y,t+1);
    dfs7(x-1,y+1,t+1);
}
int dfs8(int x,int y,int t)
{
    if(mat[x][y]=='D')return t;
    if(mat[x][y]=='*')return 0;
//    printf("dfs4(%d,%d,%d)
",x,y,t+1);
    dfs8(x+1,y-1,t+1);
}
int dfs(int x,int y,int t)
{
    int mm=0;

    mm+=dfs1(x+1,y,t);
    mm+=dfs2(x-1,y,t);
    mm+=dfs3(x,y+1,t);
    mm+=dfs4(x,y-1,t);

    mm+=dfs5(x+1,y+1,t);
    mm+=dfs6(x-1,y-1,t);
    mm+=dfs7(x-1,y+1,t);
    mm+=dfs8(x+1,y-1,t);

    return mm;
}


int main()
{
    int t;cin>>t;getchar();
    int tt=1;
    for(int i=0;i<=9;i++)
    {
        mat[0][i]='*';
        mat[9][i]='*';
    }
    for(int i=0;i<=9;i++)
    {
        mat[i][0]='*';
        mat[i][9]='*';
    }

    while(t--)
    {
        memset(v,0,sizeof(v));
        int ma=0;
        for(int i=1;i<=8;i++)
        for(int j=1;j<=8;j++)
        {
            scanf(" %c",&mat[i][j]);
        }

        for(int i=1;i<=8;i++)
        {
            for(int j=1;j<=8;j++)
            {
                if(mat[i][j]=='*')
                {
//                    printf("%d,%d
",i,j);
                    ma=max(ma, dfs(i,j,0) );
//                    printf("%d,%d ma = %d
",i,j,ma);
                }
            }
        }
        printf("Case %d: ",tt++);
        cout<<ma<<endl;
    }
    return 0;
}

/*
33
********
********
********
***LD***
***DL***
********
********
********

********
********
**DLL***
**DLLL**
**DLD***
********
********
********

********
********
*D******
*DLLD***
***LL***
**D*D***
********
********

********
********
*D******
*DLLD***
***LL***
**D*L***
*****L**
********

******D*
*****L**
*D**L***
*DLLLLL*
**LLL***
*LD*L***
*****L**
********



*/