hdu 3500 DFS(限定)

Fling

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 455    Accepted Submission(s): 190

Problem Description

Fling is a kind of puzzle games available on phone.
This game is played on a board with 7 rows and 8 columns. Each puzzle consists of a set of furballs placed on the board. To solved a puzzle, you need to remove the furballs from board until there is no more than one furball on the board. You do this by ´flinging´ furballs into other furballs, to knock them off the board. You can fling any furballs in four directions (up, left, right, down). The flung furball stops at the front grid of another one as soon as knocking it. And the knocked furball continues to rolling in the same direction until the last knocked one goes off the board. For instance, A furball at (0, 0) rolls right to the furball at (0, 5), then it will stop at (0, 4). Moreover, the latter will roll to right. You cannot fling a furball into a neighbouring furball, the one next to in any of four directions. However, it is permitted for a rolling ball knocks into a ball with a neighbour in that direction.

 

Input

The input contains multiple test cases.
For each case, the 7 lines with 8 characters describe the board. ´X´ represents a empty grid and ´O´ represents a grid with a furball in it. There are no more than 12 furballs in any board.
Each case separated by a blank line.

 

Output

For each case, print a line formatted as "CASE #NUM:", where NUM is the number of current case.
Then every ´fling´ prints a line. Each line contains two integers X, Y and a character Z. The flung furball is located at grid (X, Y), the top-left grid is (0, 0). And Z represents the direction this furball towards: U (Up), L (Left), R (Right) and D (Down);
Print a blank line between two cases.
You can assume that every puzzle could be solved.
If there are multiple solve sequences, print the smallest one. That is, Two sequences A (A1, A2, A3 ... An) and B (B1, B2, B3 ... Bn). Let k be the smallest number that Ak != Bk.
Define A < B :
(1) X in Ak < X in Bk;
(2) Y in Ak < Y in Bk and X in Ak = X in Bk;
(3) Z in Ak < Z in Bk and (X,Y) in Ak = (X,Y) in Bk;
The order of Z: U < L < R < D.

 

Sample Input

XXXXXXXX XXOXXXXX XXXXXXXX XXXXXXXX XOXXXXOX XXXXXXXX XXXXXXXX XXXXXXXX XOXOXOOX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX

Sample Output

CASE #1:

4 6 L

1 2 D

CASE #2:

1 1 R

1 4 L

1 3 R

 

给出在一个7*8方块上的很多毛球，允许的操作只有用一个毛球取弹另一个毛球，最终的状态是只剩下一个球

其中：

不能直接把毛球弹出去

假如相邻也是一个毛球，则不能往这个方向弹（可理解为无法蓄力）。

使用dfs（）进行搜索，对一个球弹或者不弹进行搜索，记住要使用一个空地图来存储决策前的地图，以便在搜索方向出错是进行回退

 

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
struct node
{
    int x,y,z;
}ans[];
char mat[][];
char direc[]={'U','L','R','D'};
int nx[]={-, ,  , };
int ny[]={ ,-,  , };
void fling(int x,int y,int k)
{
    int flag=;
    int nxtx=x+nx[k],nxty=y+ny[k];
    if(nxtx<||nxtx>=||nxty<||nxty>=) {mat[x][y]='X';return;}
    while(mat[nxtx][nxty]=='X')
    {
        nxtx+=nx[k];nxty+=ny[k];
        if(nxtx<||nxtx>=||nxty<||nxty>=) {flag=;break;}
    }
    if(flag) {mat[x][y]='X';return;}
    mat[x][y]='X';
    mat[nxtx-nx[k]][nxty-ny[k]]='O';
    fling(nxtx,nxty,k);
}

bool dfs(int sum,int cnt)
{
    if(sum==)
    {
        return ;
    }
    int nxtx,nxty;
    char t_mat[][];
    memcpy(t_mat,mat,sizeof(mat));
    for(int i=;i<;i++)
    {
        for(int j=;j<;j++)
        {
            if(mat[i][j]!='O') continue;
            for(int k=;k<;k++)
            {
                nxtx=i+nx[k];nxty=j+ny[k];
                if(nxtx<||nxtx>=||nxty<||nxty>=) continue;
                if(mat[nxtx][nxty]=='O') continue;
                int flag=;
                while(mat[nxtx][nxty]=='X')
                {
                    nxtx+=nx[k];nxty+=ny[k];
                    if(nxtx<||nxtx>=||nxty<||nxty>=)
                    {
                        flag=;break;
                    }
                }
                if(flag) continue;
                mat[i][j]='X';
                mat[nxtx-nx[k]][nxty-ny[k]]='O';
                fling(nxtx,nxty,k);
                ans[cnt].x=i;
                ans[cnt].y=j;
                ans[cnt].z=k;
                if(dfs(sum-,cnt+)) return ;
                memcpy(mat,t_mat,sizeof(t_mat));
            }
        }
    }
    return ;

}
int main()
{
    int ca=;
    while(scanf("%s",mat[])!=EOF)
    {
        int sum=;
        for(int i=;i<;i++) scanf("%s",mat[i]);
        for(int i=;i<;i++)
        {
            for(int j=;j<;j++)
            {
                if(mat[i][j]=='O')
                {
                    sum++;
                }
            }
        }
        memset(ans,-,sizeof(ans));
        dfs(sum,);
        if(ca!=) puts("");
        printf("CASE #%d:\n",ca++);
        for(int i=;ans[i].x!=-;i++)
        {
            printf("%d %d %c\n",ans[i].x,ans[i].y,direc[ans[i].z]);
        }
    }
    return ;
}