hdu3404 Switch lights-----NIM积

Switch lights

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 215    Accepted Submission(s): 115

Problem Description

lxhgww is playing a game with his computer Deep Blue.
The game is played on a matrix containing lights. At first, some lights are on, while others are off. lxhgww and Deep Blue take turns to switch the lights. For each step, the player should choose a rectangle in the matrix: (x1 , y1) , (x1 , y2) , (x2 , y1) , (x2 , y2) , (x1<=x2,y1<=y2, the light at (x2, y2) should be on) and change the lights’ status on the four vertex of the rectangle, namely on to off, and off to on. The player turns all the lights off wins the game. Notice the rectangle is possibly degenerated to line or even a single cell so that the player may also switch two or one besides four lights in a move.
Deep Blue's strategy is perfect, if it has a chance to win, never will it lose. Does lxhgww have a chance to win if he takes the first step?

 

Input

The first line is an integer T(T<=100) indicating the case number.
Each case has one integers n (n<= 1000 ), the number of on-lights at the beginning of the game.
Then come n lines, each line has two integers, xi , yi, (1<=xi<=10000, 1<=yi<=10000) , so light at (xi, yi) is on at first. (No two lights at the same position)

 

Output

If lxhgww still has a chance to win, output "Have a try, lxhgww.", otherwise tell lxhgww "Don't waste your time."

 

Sample Input

   
   
   
   

    
    
    
    2
2
1 2
2 1
2
1 1
2 2
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    Don't waste your time.
Have a try, lxhgww.
   
   
   
   

 

Author

lxhgww

 

Source

HDOJ Monthly Contest – 2010.05.01

 

Recommend

lcy

这题让我想起了看过的一位acmer写的一道博弈题的题解，貌似是这样写的，坑死爹的尼玛题，给5个小时做这一道也做不出，打死你，打死你，打死你~~~~~~~~~~

做这题的时候我也是这么感觉的。

先借别人的代码记这了，看国家队论文，看好久也没看懂~~~

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int sg[20][20];
int f(int,int);//声明一下，因为f与g互相嵌套调用
int g(int x, int y)//计算2^x与2^y的nim积
{
   if(sg[x][y] != -1)//查备忘录
   {
      return sg[x][y];
   }
   if(!x)//x==0也就是1与2^y的nim积，等于2^y
   {
      return sg[x][y] = 1<<y;
   }
   if(!y)//同上
   {
      return sg[x][y] = 1<<x;
   }
   int ans=1,k=1,t;
   int x1=x,y1=y;
   while(x||y)//再将x和y分为二进制，这里计算那些普通乘积的（即对应二进制位不同的）
   {
      t = 1<<k;//从此位得到的最终的数2^k
      if((x&1||y&1) && !((x&1)&&(y&1)))//该位不同
      {
         ans *= t;
      }
      x >>= 1;
      y >>= 1;
      k <<= 1;//从此位得到的指数(本身也是2的幂)
   }
   k = 1;
   x = x1;
   y = y1;
   while(x||y)//计算那些相同的fermat 2-power 数，与已得出的数的nim积
   {
      t = 1<<k;
      if((x&1)&&(y&1))//该位相同
      {
         ans = f(ans,t/2*3);
      }
      x >>= 1;
      y >>= 1;
      k <<= 1;//从此位得到的指数(本身也是2的幂)
   }
   return (sg[x1][y1] = ans);
}
int f(int x, int y)//计算二维的nim积
{
   if(!x || !y)return 0;
   if(x == 1)return y;
   if(y == 1)return x;
   int ans = 0;
   for(int i = x,a = 0; i; i>>=1,a++)//完成（将x和y分解后）按分配律计算其积
   {
      if((i&1)==0)continue;//该位（bit）是1才计算，否则跳过
      for(int j = y,b = 0; j; j>>=1,b++)
      {
         if((j&1)==0)continue;
         ans ^= g(a,b);
      }
   }
   return ans;
}
int main()
{
   int x,y,t;
   int n,ans;
   scanf("%d",&t);
   while(t--)
   {
      memset(sg,-1,sizeof(sg));
      scanf("%d",&n);
      ans = 0;
      while(n--)
      {
         scanf("%d%d",&x,&y);
         ans ^= f(x,y);

      }
      puts(ans ? "Have a try, lxhgww." : "Don't waste your time.");
   }
   return 0;
}