hdu 4101

Ali and Baba

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

Problem Description

There is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following:
1. Empty area, represented by an integer 0.
2. A Stone, represented by an integer x (x > 0) which denote the HP of this stone.
3. Treasure, represented by an integer -1.
Now, Ali and Baba get the map of this mysterious area, and play the following game:
Ali and Baba play alternately, with Ali starting. In each turn, the player will choose a stone that he can touch and hit it. After this operation, the HP of the stone that been hit will decrease by 1. If some stone’s HP is decreased to 0, it will become an empty area. Here, a player can touch a stone means
there is path consist of empty area from the outside to the stone. Note that two grids are adjacent if and only if they share an edge.
The player who hits the treasure first wins the game.

 

Input

The input consists several testcases.
The first line contains two integer N and M (0 < N,M <= 300), the size of the maze.
The following N lines each contains M integers (less than 100), describes the maze, where a positive integer represents the HP of a stone, 0 reperents an empty area, and -1 reperents the treasure.
There is only one grid contains the treasure in the maze.

 

Output

“Ali Win” or “Baba Win” indicates the winner of the game.

 

Sample Input

3 3

1 1 1

1 -1 1

1 1 1

 

Sample Output

 

Baba Win

 

Source

2011 Alibaba-Cup Campus Contest

 

7 7
0 2 1 1 1 1 1
1 0 0 0 0 0 1
1 0 2 2 1 1 1
1 0 0 0 0 0 1
1 0 -1 5 3 4 1
1 0 0 0 0 0 1
1 1 1 1 1 1 1

此时ans = 9   Ali Win.

写得很挫，其实思路对的话，写起来很简单的

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<queue>
#include<cstdlib>
using namespace std;

int n,m;
int a[302][302];
bool use[302][302];
bool hash[302][302];

int map1[4][2]={ {1,0},{0,1},{-1,0},{0,-1}};
struct node
{
    int x,y;
};
queue<node>Q;
bool pd()
{
    int i;
    for(i=1;i<=m;i++)
        if(use[1][i]==true) return true;
    for(i=1;i<=m;i++)
        if(use[n][i]==true) return true;

    for(i=1;i<=n;i++)
        if(use[i][1]==true) return true;
    for(i=1;i<=n;i++)
        if(use[i][m]==true) return true;
    return false;
}
void bfs(int x,int y)
{
    int i;
    node t,cur;
    t.x=x;
    t.y=y;
    Q.push(t);
    use[x][y]=true;

    while(!Q.empty())
    {
        cur=Q.front();
        Q.pop();

        for(i=0;i<4;i++)
        {
            t=cur;
            t.x=t.x+map1[i][0];
            t.y=t.y+map1[i][1];
            if(t.x>=1&&t.x<=n && t.y>=1&&t.y<=m)
            {
                if(use[t.x][t.y]==false && a[t.x][t.y]==0)
                {
                    use[t.x][t.y]=true;
                    Q.push(t);
                }
            }
        }
    }
}
void dbfs(int x,int y)//second serch
{
    int i;
    node t,cur;
    bool flag;
    t.x=x;
    t.y=y;
    hash[x][y]=true;
    Q.push(t);

    while(!Q.empty())
    {
        cur=Q.front();
        Q.pop();
        flag=false;
        for(i=0;i<4;i++)
        {
            t=cur;
            t.x=t.x+map1[i][0];
            t.y=t.y+map1[i][1];
            if(t.x>=1&&t.x<=n && t.y>=1&&t.y<=m)
            {
               if(use[t.x][t.y]==true)
               {
                   flag=true;
                   break;
               }
            }
        }
        if(flag==true) continue;
        for(i=0;i<4;i++)
        {
            t=cur;
            t.x=t.x+map1[i][0];
            t.y=t.y+map1[i][1];
            if(t.x>=1&&t.x<=n && t.y>=1&&t.y<=m)
            {
                if(hash[t.x][t.y]==false && use[t.x][t.y]==false)
                {
                    hash[t.x][t.y]=true;
                    Q.push(t);
                }
            }
        }
    }
}
void s_serch()
{
    int i;
    while(!Q.empty())
    {
        Q.pop();
    }
    for(i=1;i<=m;i++)
        if(hash[1][i]==false && use[1][i]==false)
            dbfs(1,i);
    for(i=1;i<=m;i++)
        if(hash[n][i]==false && use[n][i]==false)
            dbfs(n,i);

    for(i=1;i<=n;i++)
        if(hash[i][1]==false && use[i][1]==false)
            dbfs(i,1);
    for(i=1;i<=n;i++)
        if(hash[i][m]==false && use[i][m]==false)
            dbfs(i,m);
}
int main()
{
    int i,j,x,y,cur,k;
    bool flag;
    while(scanf("%d%d",&n,&m)>0)
    {
        memset(hash,false,sizeof(hash));
        memset(use,false,sizeof(use));
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        while(!Q.empty())
        {
            Q.pop();
        }
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                if(a[i][j]==-1 && use[i][j]==false)
                    bfs(i,j);//first serch.
            }
        if(pd()==true){
            printf("Ali Win
");
            continue;
        }
        s_serch();
        for(i=1,cur=0;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                if(hash[i][j]==true && a[i][j]>0)
                {
                    flag=false;
                    for(k=0;k<4;k++)
                    {
                        x=i+map1[k][0];
                        y=j+map1[k][1];
                        if(x>=1&&x<=n &&y>=1&&y<=m  && use[x][y]==true)
                        {
                            flag=true;
                            break;
                        }
                    }
                    if(flag==true) cur=cur+a[i][j]-1;
                    else cur=cur+a[i][j];
                }
            }
    //    printf("%d
",cur);
        cur=cur%2;
        if(cur==1) printf("Ali Win
");
        else printf("Baba Win
");
    }
    return 0;
}