ZOJ 3964 Yet Another Game of Stones(Nim博弈 待整理)
来源:互联网 发布:在家的网络兼职 编辑:程序博客网 时间:2024/06/06 18:41
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.
- 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 a1, a2, ..., an (1 ≤ ai ≤ 109), indicating the number of stones in each pile.
The third line of each test case contains n integers b1, b2, ..., 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
324 11 0132112
Sample Output
AliceBobBob
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
- ZOJ 3964 Yet Another Game of Stones(Nim博弈 待整理)
- ZOj 3964Yet Another Game of Stones(nim博弈)
- ZOJ 3964 Yet Another Game of Stones (博弈)
- ZOJ 3964 Yet Another Game of Stones (博弈)
- ZOJ 3964 Yet Another Game of Stones(博弈论)
- Yet Another Game of Stones---ZOJ Problem 3964
- Yet Another Game of Stones
- 768E Game of Stones[Nim游戏][博弈]
- CodeForces 768E Game of Stones (Nim博弈)
- 2017浙江省赛:Yet Another Game of Stones(尼姆变形)
- Game of Taking Stones(威佐夫博奕 待整理)
- ZOJ 3505 Yet Another Set of Numbers
- Codeforces 768E Game of Stones 博弈
- SPOJ GAME3 9842. Yet Another Fancy Game 博弈
- zoj 3610 Yet Another Story of Rock-paper-scissors
- ZOJ 3610 Yet Another Story of Rock-paper-scissors
- ZOJ 3610 Yet Another Story of Rock-paper-scissors
- ZOJ 3505 Yet Another Set of Numbers(DP+构造)
- 1758: [Wc2010]重建计划(TLE)
- Unity3D 自动添加Fbx Animation Event
- 欢迎使用CSDN-markdown编辑器
- 一个java页游服务器框架
- 常用排序算法
- ZOJ 3964 Yet Another Game of Stones(Nim博弈 待整理)
- 基于SP(SharedPreferences)的基本使用以及实际应用介绍
- Uncaught SyntaxError: Unexpected token o
- 再学python类(终结篇)
- linux下网页服务器移植
- JAVA集合三Map—— 01 HashMap详解
- solrCloud修改单个配置文件操作(基于zookeeper)
- h264 nal 结构总结
- Python Django基础教程(四)(admin站点管理)