zoukankan      html  css  js  c++  java
  • ZOJ 3964 Yet Another Game of Stones(Nim博弈 待整理)

    Yet Another Game of Stones

    Time Limit: 1 Second      Memory Limit: 65536 KB

    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 bi of that pile.
      • If bi = 0, there are no constraints.
      • If bi = 1, Alice can only remove some odd number of stones from that pile.
      • If bi = 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?

    Input

    There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

    The first line contains an integer n (1 ≤ n ≤ 105), indicating the number of piles.

    The second line contains n integers a1a2, ..., an (1 ≤ ai ≤ 109), indicating the number of stones in each pile.

    The third line of each test case contains n integers b1b2, ..., bn (0 ≤ bi ≤ 2), indicating the special constraint of each pile.

    It is guaranteed that the sum of n over all test cases does not exceed 106.

    We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.

    Output

    For each test case, output "Alice" (without the quotes) if Alice will win the game. Otherwise, output "Bob" (without the quotes).

    Sample Input

    3
    2
    4 1
    1 0
    1
    3
    2
    1
    1
    2
    

    Sample Output

    Alice
    Bob
    Bob
    

    Hint

    For the first test case, Alice can remove 3 stones from the first pile, and then she will win the game.

    For the second test case, as Alice can only remove some even number of stones, she is unable to remove all the stones in the first move. So Bob can remove all the remaining stones in his move and win the game.

    For the third test case, Alice is unable to remove any number of stones at the beginning of the game, so Bob wins.


    here

  • 相关阅读:
    矩阵补全(Matrix Completion)和缺失值预处理
    【机器学习基础】对 softmax 和 cross-entropy 求导
    Mendeley使用小技巧
    [Active Learning] Multi-Criteria-based Active Learning
    回归树(Regression Tree)
    Typora + Mathpix Snip,相见恨晚的神器
    【机器学习之数学】02 梯度下降法、最速下降法、牛顿法、共轭方向法、拟牛顿法
    【机器学习之数学】01 导数、偏导数、方向导数、梯度
    “卷积神经网络(Convolutional Neural Network,CNN)”之问
    一篇带你完全掌握线程的博客
  • 原文地址:https://www.cnblogs.com/zswbky/p/6792884.html
Copyright © 2011-2022 走看看