hdu4642之博弈

Fliping game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 916    Accepted Submission(s): 653

Problem Description

Alice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board with one in each grid and every coin may be upward or downward freely. Then they take turns to choose a rectangle (x ₁, y ₁)-(n, m) (1 ≤ x ₁≤n, 1≤y ₁≤m) and flips all the coins (upward to downward, downward to upward) in it (i.e. flip all positions (x, y) where x ₁≤x≤n, y ₁≤y≤m)). The only restriction is that the top-left corner (i.e. (x ₁, y ₁)) must be changing from upward to downward. The game ends when all coins are downward, and the one who cannot play in his (her) turns loses the game. Here's the problem: Who will win the game if both use the best strategy? You can assume that Alice always goes first.

 

Input

The first line of the date is an integer T, which is the number of the text cases.
Then T cases follow, each case starts with two integers N and M indicate the size of the board. Then goes N line, each line with M integers shows the state of each coin, 1<=N,M<=100. 0 means that this coin is downward in the initial, 1 means that this coin is upward in the initial.

 

Output

For each case, output the winner’s name, either Alice or Bob.

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   Alice
Bob
  
  

 

分析：假如Alice面对必败局势，若s[n][n]为1，则可以只选择这个点改变使另一个人面对必败局势且s[n][n]已变成0，若s[n][n]是0则Alice只能面对必败局势，所以s[n][n]=1能改变面对的局势，谁面对s[n][n]=1谁就胜利

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#define INF 99999999
using namespace std;

const int MAX=10;

int main(){
	int t,n,m,a;
	scanf("%d",&t);;
	while(t--){
		scanf("%d%d",&n,&m);
		for(int i=0;i<n;++i){
			for(int j=0;j<m;++j)scanf("%d",&a);
		}
		if(a == 1)printf("Alice\n");
		else printf("Bob\n");
	}
	return 0;
}