ZOJ 3964 Yet Another Game of Stones （博弈）

Alice and Bob are playing yet another game of stones. The rules of this game are as follow:

• The game starts with n piles of stones indexed from 1 to n. The i-th pile contains ai stones and a special constraint indicated as bi.

• The players make their moves alternatively. The allowable moves for the two players are different.

• An allowable move of Bob is considered as removal of some positive number of stones from a pile.

• An allowable move of Alice is also considered as removal of some positive number of stones from a pile, but is limited by the constraint $b_i$ of that pile.

  • If $b_i$ = 0, there are no constraints.
  • If $b_i$ = 1, Alice can only remove some odd number of stones from that pile.
  • If $b_i$ = 2, Alice can only remove some even number of stones from that pile.

  Please note that there are no constraints on Bob.

• The player who is unable to make an allowable move loses.

Alice is always the first to make a move. Do you know who will win the game if they both play optimally?

解题思路

此题的题意比较容易理解，可以简单的看着 Nim 博弈的变种。但问题在于 Alice 对第 i 堆石子的取法必须根据 $b_i$ 确定。所以如果这个问题能够归结到正常的 Nim 博弈（取石子问题），则很容易解决。

考虑特判存在 $b_i = 1 \text{ 或 } b_i = 2$ 的情况：

• 如果存在第 i 堆石子，其 $a_i$ 为奇数且 $b_i=2$ ，则 Bob 必胜（Alice 在最优策略下无法取完该堆，但 Bob 可以）。
• 如果存在 2 个及以上 $b_i=2$ 或 $b_i=1 \ \text{且}\ a_i > 1$ 的情况，则 Bob 必胜。
• 如果只有一个 $b_i=2$ （其余都为 $b_x = 0$ ） 的情况，则 Alice 为了胜利，必须先将该堆石子取完（否则 Bob 只需取掉该堆 1 个石子， Bob 必胜）。此时问题等同于 n-1 堆石子，Bob 先手的 Nim 博弈。
• 如果只有一个 $b_i = 1\ \text{且}\ a_i>1$ （其余都为 $b_x=0$ ）的情况，Alice 同样需先将该堆石子取完（或只剩一个）。此时问题等同于 n-1（n） 堆石子，Bob 先手的 Nim 博弈。

对于只有 $b_i=0$ 的情况，Nim 博弈全部 $a_i$ 异或即可。

代码

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N], n;
bool jug()
{
    int cnt[3] = {0, 0, 0}, tot = 0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]%2 && b[i] == 2) return false;
        if(b[i] == 2)   cnt[2]++,   cnt[0]++;
        if(a[i] > 1 && b[i] == 1)   cnt[1]++,   cnt[0]++;
    }
    if(cnt[0]>1)    return false;
    if(cnt[1] == 1) {
        for(int i=1;i<=n;i++)
            if(b[i] == 1 && a[i] > 1)   tot ^= (a[i]%2?0:1);
            else    tot ^= a[i];
        return !(tot?1:0);
    }
    else if(cnt[2] == 1) {
        for(int i=1;i<=n;i++)
            if(b[i] != 2)
                tot ^= a[i];
        return !(tot?1:0);
    }
    else {
        for(int i=1;i<=n;i++)
            tot ^= a[i];
        return tot;
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&b[i]);
        printf("%s\n", jug() ? "Alice" : "Bob");
    }
}