HDU 4678 Mine(博弈)

Mine

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 658    Accepted Submission(s): 186

Problem Description

Have you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there are mines (represent by a red flag). There are numbers ‘A(i,j)’ on some grids means there’re A(i,j) mines on the 8 grids which shares a corner or a line with gird(i,j). Some grids are blank means there’re no mines on the 8 grids which shares a corner or a line with them. At the beginning, all grids are back upward. In each turn, Player should choose a back upward grid to click. If he clicks a mine, Game over. If he clicks a grid with a number on it , the grid turns over. If he clicks a blank grid, the grid turns over, then check grids in its 8 directions.If the new grid is a blank gird or a grid with a number,it will be clicked too. So If we click the grid with a red point in Pic(1), grids in the area be encompassed with green line will turn over. Now Xiemao and Fanglaoshi invent a new mode of playing Mine. They have found out coordinates of all grids with mine in a game. They also find that in a game there is no grid will turn over twice when click 2 different connected components.(In the Pic(2), grid at (1,1) will turn over twice when player clicks (0,0) and (2,2) , test data will not contain these cases). Then, starting from Xiemao, they click the grid in turns. They both use the best strategy. Both of them will not click any grids with mine, and the one who have no grid to click is the loser. Now give you the size of board N, M, number of mines K, and positions of every mine X_i,Y_i. Please output who will win.

 

Input

Multicase The first line of the date is an integer T, which is the number of the text cases. (T<=50) Then T cases follow, each case starts with 3 integers N, M, K indicates the size of the board and the number of mines.Then goes K lines, the ith line with 2 integer X_i,Y_i means the position of the ith mine. 1<=N,M<=1000 0<=K<=N*M 0<=X_i<N 0<=Y_i<M

 

Output

For each case, first you should print "Case #x: ", where x indicates the case number between 1 and T . Then output the winner of the game, either ”Xiemao” or “Fanglaoshi”. (without quotes)

 

Sample Input

2
3 3 0
3 3 1
1 1

 

Sample Output

Case #1: Xiemao
Case #2: Fanglaoshi

 

Source

2013 Multi-University Training Contest 8

 

Recommend

zhuyuanchen520

 博弈题；用SG值做：
 连通的空白块和相连的数字块是一起的，一个单独的数字块是一类。
 单独一个的数组块，SG是1.
 空白块+若干个数字块，数字块个数为n的话，SG是n% + (自己手动算几个就知道了！！)

 做法：地雷标记为2；数字标记为1；空白的为0；

 然后开始扫一遍，当遇到空白的就dfs空白的一块并把它标记掉（可以标记为2）。如此就把含空白的快分离出来了！

 最后只要数一下含1的个数即可；

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;

 int n,m,lei,ans,num;
 int maz[][];

 void dfs(int x,int y)
 {
     if(x<||x>n||y<||y>m) return ;
     if(maz[x][y]==)
     {
         maz[x][y]=;
         dfs(x,y-);
         dfs(x,y+);
         dfs(x-,y-);
         dfs(x-,y);
         dfs(x-,y+);
         dfs(x+,y-);
         dfs(x+,y);
         dfs(x+,y+);
     }
     else if(maz[x][y]==)
     {
         num++;
         maz[x][y]=;
     }
 }

 int main()
 {
     int t,cas,i,j,tx,ty,res;
     scanf("%d",&t);
     cas=;
     while(t--)
     {
         memset(maz,,sizeof(maz));
         scanf("%d%d%d",&n,&m,&lei);
         for(i=;i<=lei;i++)
         {
             scanf("%d%d",&tx,&ty);
             tx++;
             ty++;
             maz[tx][ty]=;
             if(maz[tx][ty-]==) maz[tx][ty-]=;
             if(maz[tx][ty+]==) maz[tx][ty+]=;
             if(maz[tx+][ty-]==) maz[tx+][ty-]=;
             if(maz[tx+][ty]==) maz[tx+][ty]=;
             if(maz[tx+][ty+]==) maz[tx+][ty+]=;
             if(maz[tx-][ty-]==) maz[tx-][ty-]=;
             if(maz[tx-][ty]==) maz[tx-][ty]=;
             if(maz[tx-][ty+]==) maz[tx-][ty+]=;
         }
         ans=;
         for(i=;i<=n;i++)
         {
             for(j=;j<=m;j++)
             {
                 if(!maz[i][j])//遇见空格，就开始dfs这一块！！
                 {
                     num=;//num为这一块总共有几个格子（attention！连在一起的所有的空白格子算一大格！）
                     dfs(i,j);
                     if(num%==) ans^=;
                     else ans^=;
                 }
             }
         }
         res=;
         for(i=;i<=n;i++)
         {
             for(j=;j<=m;j++)
             {
                 if(maz[i][j]==) res++;
             }
         }
         if(res%==) ans^=;
         if(ans==) printf("Case #%d: Fanglaoshi\n",cas++);
         else printf("Case #%d: Xiemao\n",cas++);
     }
     return ;
 }