HDU 5754 Life Winner Bo（博弈）

最新推荐文章于 2017-05-03 13:06:37 发布

CerberuX

最新推荐文章于 2017-05-03 13:06:37 发布

阅读量540

点赞数

分类专栏： =====博弈=====

本文链接：https://blog.csdn.net/CerberuX/article/details/52039382

版权

=====博弈===== 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Problem Description
Bo is a “Life Winner”.He likes playing chessboard games with his girlfriend G.

The size of the chessboard is N×M.The top left corner is numbered(1,1) and the lower right corner is numberd (N,M).

For each game,Bo and G take turns moving a chesspiece(Bo first).At first,the chesspiece is located at (1,1).And the winner is the person who first moves the chesspiece to (N,M).At one point,if the chess can’t be moved and it isn’t located at (N,M),they end in a draw.

In general,the chesspiece can only be moved right or down.Formally,suppose it is located at (x,y),it can be moved to the next point (x′,y′) only if x′≥x and y′≥y.Also it can’t be moved to the outside of chessboard.

Besides,There are four kinds of chess(They have movement rules respectively).

1.king.

2.rook(castle).

3.knight.

4.queen.

(The movement rule is as same as the chess.)

For each type of chess,you should find out that who will win the game if they both play in an optimal strategy.

Print the winner’s name(“B” or “G”) or “D” if nobody wins the game.

Input
In the first line,there is a number T as a case number.

In the next T lines,there are three numbers type,N and M.

“type” means the kind of the chess.

T≤1000,2≤N,M≤1000,1≤type≤4

Output
For each question,print the answer.

Sample Input
4
1 5 5
2 5 5
3 5 5
4 5 5

Sample Output
G
G
D
B

挺坑的博弈题，可以强行平局；

下面分析四种棋子的情况：

King：n和m只要有一个偶数就Bo就能赢，画个棋盘反推一下就行；

Cook：n==m时G赢，否则B赢，巴什博弈画个图图反推一下就能发现只有对角线是P状态，剩下全是N状态；

Knight：这个可以强行平手，比赛时没做出来就是因为没想到这个，好气啊。。我真的坑。。。      
画个图可以发现P状态都是在正方形对角线上，
G想稳赢就必需n==m并且n模3余1（画图推一推就知道）；
在剩下的情况中，B要想稳赢就要满足 abs（n-m） == 1并且n和m模3都不能为1；
（这个只要画个图吧N状态和P状态画出来就明白了，只有围绕在正方形对角线的N位置和P位置才能确保谁赢，
别的情况下劣势的一方都可以强行平手）

Queue：根据规则或画个图模拟一下都能发现，n--，m--后，G能赢的位置都是威佐夫博弈的奇异态，算下是否满足威佐夫博弈即可

ac代码：

#include <bits/stdc++.h>
#define clr(arr,val) memset(arr,val,sizeof(arr))
#define rep(i,j,k) for(int i = j; i <= k; i++)
using namespace std;
int n, m, t, ty;
int main(){
    cin >> t;
    while(t--){
        bool f = false;
        bool d = true;
        scanf("%d%d%d",&ty,&n,&m);
        if(ty == 1){
            if(n%2==0||m%2==0) f = true;
        }
        if(ty == 2){
            if(n!=m) f = true;
        }
        if(ty == 3){
            if(n == m&&n%3==1) f = false;
            else {
                if(abs(n-m) == 1 && n%3 != 1 && m%3 != 1){
                    f = true;
                }
                else d = false;
            }
        }
        if(ty == 4){
            n--,m--;
            double k = (sqrt(5)-1.0)/2.0;
            if(n > m) swap(n,m);
            int j = n*k;
            if(n!=(int)(j*(k+1)))j++;
            if(n+j!=m) f = true;
        }
        if(!d) puts("D");
        else puts(f?"B":"G");
    }
    return 0;
}