啊……怎么说好呢……就这样吧……
*题目大意： * 一个1*M的棋盘上有N个棋子，初始位置一定，两人轮流操作， * 每次移动一枚棋子，要求只能向左移且至少移动一格，而且不 * 能到达或经过以前有棋子的格子，谁无法移动棋子就算输。 *解题思路： * 先考虑两个棋子靠在一起的时候，这两对棋子就构成了一个 * 奇异局势（P点）。所以可以把题目中的棋子分解为两对两对， * 两对两对之间是不需要考虑什么的。在同一对棋子中，如果对 * 手移动前一个，你总能对后一个移动相同的步数，所以一对 * 棋子的前一个和前一对棋子的后一个之间有多少个空位置对 * 最终的结果是没有影响的。每两对构成一组，而这两对之间就 * 是一堆石子。然后就可以Nim博弈了。注意如果是奇数个棋子， * 首个棋子要跟棋盘首构成一对。 */
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int a[1010];
int main()
{
int T,n,i,ans;
cin>>T;
while(T--)
{
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ans=0;
for(i=n-1;i>-1;i-=2)
{
if(i==0)
ans^=a[i]-1;
else
ans^=a[i]-a[i-1]-1;
}
if(ans)
cout<<"Georgia will win"<<endl;
else
cout<<"Bob will win"<<endl;
}
return 0;
}
Georgia and Bob
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 7875 | Accepted: 2435 |
Description
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the following figure for example:
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint
that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint
that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the
number of chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial positions of the n chessmen.
number of chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial positions of the n chessmen.
Output
For each test case, prints a single line, "Georgia will win", if Georgia will win the game; "Bob will win", if Bob will win the game; otherwise 'Not sure'.
Sample Input
2 3 1 2 3 8 1 5 6 7 9 12 14 17
Sample Output
Bob will win Georgia will win
Source