Matrix Game（尼姆博弈）

最新推荐文章于 2023-06-04 16:57:03 发布

ITAK

最新推荐文章于 2023-06-04 16:57:03 发布

阅读量4.2k

点赞数 1

分类专栏： ACM_博弈 ITAK的ACM之路

本文链接：https://blog.csdn.net/qingshui23/article/details/51159888

版权

ITAK的ACM之路同时被 2 个专栏收录

295 篇文章 25 订阅

订阅专栏

ACM_博弈

23 篇文章 0 订阅

订阅专栏

A - Matrix Game

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Submit Status

Description

Given an m x n matrix, where m denotes the number of rows and n denotes the number of columns and in each cell a pile of stones is given. For example, let there be a 2 x 3 matrix, and the piles are

2 3 8

5 2 7

That means that in cell(1, 1) there is a pile with 2 stones, in cell(1, 2) there is a pile with 3 stones and so on.

Now Alice and Bob are playing a strange game in this matrix. Alice starts first and they alternate turns. In each turn a player selects a row, and can draw any number of stones from any number of cells in that row. But he/she must draw at least one stone. For example, if Alice chooses the 2^nd row in the given matrix, she can pick 2 stones from cell(2, 1), 0 stones from cell (2, 2), 7 stones from cell(2, 3). Or she can pick 5 stones from cell(2, 1), 1 stone from cell(2, 2), 4 stones from cell(2, 3). There are many other ways but she must pick at least one stone from all piles. The player who can't take any stones loses.

Now if both play optimally who will win?

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing two integers: m and n (1 ≤ m, n ≤ 50). Each of the next m lines contains nspace separated integers that form the matrix. All the integers will be between 0 and 10⁹ (inclusive).

Output

For each case, print the case number and 'Alice' if Alice wins, or 'Bob' otherwise.

Sample Input

2 3

2 3 8

5 2 7

2 3

1 2 3

3 2 1

Sample Output

Case 1: Alice

Case 2: Bob

题目大意：

给定一个矩阵，然后两个人进行博弈（还是那两个人 Alice 和Bob），Alice 先手，每次只能取每一行中的任意数量（必须是>=1的），最后取完的获胜。

解题思路：
这是一个简单的尼姆博弈，虽然加上了矩阵，但是也是没有什么难度，只要掌握了简单的尼姆博博弈这个题还是简单的，首先，我们这样想一下，将每一行当成尼姆博弈中的每一堆，这样就构造出来一个尼姆博弈的模型了就可以做了，只需要将每一行的元素加和，然后进行异或就行了。如果异或等于 0 那么后手赢，否则先手赢。

My Code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    ///get_sg();
    int T;
    scanf("%d",&T);
    for(int cas=1; cas<=T; cas++)
    {
        int m, n, x, ans=0;
        scanf("%d%d",&m,&n);
        for(int i=0; i<m; i++)
        {
            int sum = 0;
            for(int j=0; j<n; j++)
            {
                scanf("%d",&x);
                sum += x;
            }
            ans ^= sum;
        }
        if(!ans)
            printf("Case %d: Bob\n",cas);
        else
            printf("Case %d: Alice\n",cas);
    }
    return 0;
}