POJ 1704 Georgia and Bob （阶梯博弈变式）

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 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.
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

题意

  在一个 1x∞ 的方格里，放置着n个棋子，他们的位置分别是 a_i，两人轮流把棋子向左移动，不可以跨棋子移动，最左边最多移动到1位置，谁不能移动谁输

思路

  现已样例二来说明一下：1 5 6 7 9 12 14 17，我们把（1，5）（6，7）（9，12）（14，17）看作一对，在同一对棋子中，如果对手移动前一个，你总能对后一个移动相同的步数，所以一对棋子的前一个和前一对棋子的后一个之间有多少个空位置对最终的结果是没有影响的。这是n为偶数情况，当n时奇数：1 2 3 ，（0，1）（2，3）看作一对；
  这样看的话，我们只需要考虑同一对的两个棋子之间有多少空位。我们把每一对两颗棋子的距离(空位数)视作一堆石子，在对手移动每对两颗棋子中靠右的那一颗时，移动几位就相当于取几个石子，与取石子游戏对应上了，各堆的石子取尽，就相当再也不能移动棋子了。

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<ctime>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
typedef pair<int,int> P;
const int inf = 0x3f3f3f3f;
const int maxn = 200100;
const int mod = 1e9+7;
int a[maxn];
int main(void)
{
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        a[0] = 0;
        int p = 0;
        for(int i=n;i>0;i-=2)
            p ^= (a[i]-a[i-1]-1);
        if(p)   printf("Georgia will win\n");
        else    printf("Bob will win\n");
    }
    return 0;
}