HDU 4678 Mine （2013多校8 1003题 博弈）

Mine

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

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

然后bfs解决就可以了

/* ***********************************************
Author        :kuangbin
Created Time  :2013/8/15 13:25:56
File Name     :F:2013ACM练习2013多校81003.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int MAXN = 1010;
bool g[MAXN][MAXN];
int move[][2] = {{0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
bool used[MAXN][MAXN];
int n,m;
bool check(int x,int y)
{
    if(x > 0 && g[x-1][y])return true;
    if(x < n-1 && g[x+1][y])return true;
    if(y > 0 && g[x][y-1])return true;
    if(y < m-1 && g[x][y+1])return true;
    if(x > 0 && y > 0 && g[x-1][y-1])return true;
    if(x > 0 && y < m-1 && g[x-1][y+1])return true;
    if(x < n-1 && y > 0 && g[x+1][y-1])return true;
    if(x < n-1 && y < m-1 && g[x+1][y+1])return true;
    return false;
}
int dfs(int x,int y)
{
    queue<pair<int,int> >q;
    q.push(make_pair(x,y));
    int cnt = 0;
    used[x][y] = true;
    while(!q.empty())
    {
        pair<int,int> tmp = q.front();
        q.pop();
        int nx = tmp.first;
        int ny = tmp.second;
        if(check(nx,ny))
        {
            cnt++;
            continue;
        }
        for(int i = 0;i < 8;i++)
        {
            int tx = nx + move[i][0];
            int ty = ny + move[i][1];
            if(tx < 0 || tx >= n || ty < 0|| ty >= m)continue;
            if(used[tx][ty])continue;
            if(g[tx][ty])continue;
            q.push(make_pair(tx,ty));
            used[tx][ty] = true;
        }
    }
    return cnt;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    scanf("%d",&T);
    int iCase = 0;
    while(T--)
    {
        iCase ++;
        int k;
        scanf("%d%d%d",&n,&m,&k);
        memset(g,false,sizeof(g));
        int x,y;
        while(k--)
        {
            scanf("%d%d",&x,&y);
            g[x][y] = true;
        }
        memset(used,false,sizeof(used));
        int ans = 0;
        for(int i = 0;i < n;i++)
            for(int j = 0 ;j < m;j++)
                if(!g[i][j] && !used[i][j] && !check(i,j))
                {
                    int tmp = dfs(i,j);
                    ans ^=  (tmp%2+1);
                }
        for(int i = 0;i < n;i++)
            for(int j = 0;j < m;j++)
                if(!g[i][j] && !used[i][j] && check(i,j))
                    ans ^= 1;
        if(ans == 0)printf("Case #%d: Fanglaoshi
",iCase);
        else printf("Case #%d: Xiemao
",iCase);
    }
    
    return 0;
}