Curling 2.0

Problem Description

On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked. They use only a single stone. The purpose of the game is to lead the stone from the start to the goal with the minimum number of moves.

Fig. 1 shows an example of a game board. Some squares may be occupied with blocks. There are two special squares namely the start and the goal, which are not occupied with blocks. (These two squares are distinct.) Once the stone begins to move, it will proceed until it hits a block. In order to bring the stone to the goal, you may have to stop the stone by hitting it against a block, and throw again.

Fig. 1: Example of board (S: start, G: goal)

The movement of the stone obeys the following rules:

• At the beginning, the stone stands still at the start square.
• The movements of the stone are restricted to x and y directions. Diagonal moves are prohibited.
• When the stone stands still, you can make it moving by throwing it. You may throw it to any direction unless it is blocked immediately(Fig. 2(a)).
• Once thrown, the stone keeps moving to the same direction until one of the following occurs:
  • The stone hits a block (Fig. 2(b), (c)).
    • The stone stops at the square next to the block it hit.
    • The block disappears.
  • The stone gets out of the board.
    • The game ends in failure.
  • The stone reaches the goal square.
    • The stone stops there and the game ends in success.
• You cannot throw the stone more than 10 times in a game. If the stone does not reach the goal in 10 moves, the game ends in failure.

Fig. 2: Stone movements

Under the rules, we would like to know whether the stone at the start can reach the goal and, if yes, the minimum number of moves required.

With the initial configuration shown in Fig. 1, 4 moves are required to bring the stone from the start to the goal. The route is shown in Fig. 3(a). Notice when the stone reaches the goal, the board configuration has changed as in Fig. 3(b).

Fig. 3: The solution for Fig. D-1 and the final board configuration

 

Input

<p>The input is a sequence of datasets. The end of the input is indicated by a line containing two zeros separated by a space. The number of datasets never exceeds 100.</p><p>Each dataset is formatted as follows.</p><blockquote><p><i>the width(=w) and the height(=h) of the board</i> <br><i>First row of the board</i> <br>... <br><i>h-th row of the board</i></p></blockquote><p>The width and the height of the board satisfy: 2 <= <i>w</i> <= 20, 1 <= <i>h</i> <= 20.</p><p>Each line consists of <i>w</i> decimal numbers delimited by a space. The number describes the status of the corresponding square.</p><blockquote><table id="table1"><tr><td>0 </td><td>vacant square</td></tr><tr><td>1 </td><td>block</td></tr><tr><td>2 </td><td>start position</td></tr><tr><td>3 </td><td>goal position</td></tr></table></blockquote><p>The dataset for Fig. D-1 is as follows:</p><blockquote><p>6 6 <br>1 0 0 2 1 0 <br>1 1 0 0 0 0 <br>0 0 0 0 0 3 <br>0 0 0 0 0 0 <br>1 0 0 0 0 1 <br>0 1 1 1 1 1</p></blockquote>

 

Output

<p>For each dataset, print a line having a decimal integer indicating the minimum number of moves along a route from the start to the goal. If there are no such routes, print -1 instead. Each line should not have any character other than this number.</p>

 

Sample Input

  
  

   
   2 1
3 2
6 6
1 0 0 2 1 0
1 1 0 0 0 0
0 0 0 0 0 3
0 0 0 0 0 0
1 0 0 0 0 1
0 1 1 1 1 1
6 1
1 1 2 1 1 3
6 1
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0
  
  

 

Sample Output

  
  

   
   1
4
-1
4
10
-1
  
  

 

题意：

球沿直线走，遇到阻碍停在其前方，且阻碍随之消失，然后重新选择方向，看能否到终点并求最小步数

解题思路：

稍微有点不同的深搜，注意怎么递归就好

这个题我做了一下午，从dfs超时又bfs，bfs不超时吧，又wa一下午没弄对，刚一看才发现，其实开始的dfs已经对了，就差一句if（step>10） return;   bfs样例过了，我也真的是找不出错误了

代码dfs：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
using namespace std;
int sx,sy,w,h,cnt,a[21][21];
void dfs(int x,int y,int step)
{
    if(step>10) return;      //如果超过10步就返回，很重要的一句话
    int xx=x-1;         //往上走
    int yy=y;
    if(xx>=1&&xx<=h&&yy>=1&&yy<=w)
    {
        if(a[xx][yy]!=1)        //是1的话不能朝这个方向
        {
            for(int k=xx;k>=1;k--)  //往前推进
            {
                if(a[k][yy]==3) {if(cnt>step) cnt=step; return;}    //遇到终点
                else
                {
                    if(a[k][yy]==1) //遇到1，变为0，递归下面一个
                    {
                        a[k][yy]=0;
                        dfs(k+1,yy,step+1);
                        a[k][yy]=1;  //改为1，表示没走过这条路径
                        break;
                    }
                }
            }
        }
    }
    xx=x+1; yy=y;           //往下走
    if(xx>=1&&xx<=h&&yy>=1&&yy<=w)
    {
        if(a[xx][yy]!=1)
        {
            for(int k=xx;k<=h;k++)
            {
                if(a[k][yy]==3) {if(cnt>step) cnt=step; return;}
                else
                {
                    if(a[k][yy]==1)
                    {
                        a[k][yy]=0;
                        dfs(k-1,yy,step+1);
                        a[k][yy]=1;
                        break;
                    }
                }
            }
        }
    }
    xx=x; yy=y-1;           //往左走
    if(xx>=1&&xx<=h&&yy>=1&&yy<=w)
    {
        if(a[xx][yy]!=1)
        {
            for(int k=yy;k>=1;k--)
            {
                if(a[xx][k]==3) {if(cnt>step) cnt=step; return;}
                else
                {
                    if(a[xx][k]==1)
                    {
                        a[xx][k]=0;
                        dfs(xx,k+1,step+1);
                        a[xx][k]=1;
                        break;
                    }
                }
            }
        }
    }
    xx=x; yy=y+1;           //往右走
    if(xx>=1&&xx<=h&&yy>=1&&yy<=w)
    {
        if(a[xx][yy]!=1)
        {
            for(int k=yy;k<=w;k++)
            {
                if(a[xx][k]==3) {if(cnt>step) cnt=step; return;}
                else
                {
                    if(a[xx][k]==1)
                    {
                        a[xx][k]=0;
                        dfs(xx,k-1,step+1);
                        a[xx][k]=1;
                        break;
                    }
                }
            }
        }
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d",&w,&h)&&(w+h))
    {
        for(i=1;i<=h;i++)
            for(j=1;j<=w;j++)
        {
            scanf("%d",&a[i][j]);
            if(a[i][j]==2)
            {sx=i; sy=j;}
        }
        cnt=1000000000;
        dfs(sx,sy,1);
        if(cnt<=10) printf("%d\n",cnt);
        else printf("-1\n");
    }
    return 0;
}

错误的bfs代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
using namespace std;
int sx,sy,w,h,cnt,a[25][25];
struct node{
    int x,y,s;
};
bool flag;
void bfs()
{
    queue<node> Q;
    node t1,t2;
    t1.x=sx; t1.y=sy; t1.s=1;
    Q.push(t1);
    while(!Q.empty())
    {
        t1=Q.front();
        Q.pop();
        t2.x=t1.x-1;
        t2.y=t1.y;
        t2.s=t1.s;
        if(t2.x>=1&&t2.x<=h&&t2.y>=1&&t2.y<=w)
        {
            if(a[t2.x][t2.y]!=1)
            {
                for(int k=t2.x;k>=1;k--)
                {
                    if(a[k][t2.y]==3) {cnt=t1.s; return;}
                    else
                    {
                        if(a[k][t2.y]==1)
                        {
                            a[k][t2.y]=0;
                            t2.x=k+1; t2.s=t1.s+1;
                            Q.push(t2);
                            break;
                        }
                    }
                }
            }
        }
        t2.x=t1.x+1; t2.y=t1.y;
        if(t2.x>=1&&t2.x<=h&&t2.y>=1&&t2.y<=w)
        {
            if(a[t2.x][t2.y]!=1)
            {
                for(int k=t2.x;k<=h;k++)
                {
                    if(a[k][t2.y]==3) {cnt=t1.s; return;}
                    else
                    {
                        if(a[k][t2.y]==1)
                        {
                            a[k][t2.y]=0;
                            t2.x=k-1; t2.s=t1.s+1;
                            Q.push(t2);
                            break;
                        }
                    }
                }
            }
        }
        t2.x=t1.x; t2.y=t1.y-1;
        if(t2.x>=1&&t2.x<=h&&t2.y>=1&&t2.y<=w)
        {
            if(a[t2.x][t2.y]!=1)
            {
                for(int k=t2.y;k>=1;k--)
                {
                    if(a[t2.x][k]==3) {cnt=t1.s; return;}
                    else
                    {
                        if(a[t2.x][k]==1)
                        {
                            a[t2.x][k]=0;
                            t2.y=k+1; t2.s=t1.s+1;
                            Q.push(t2);
                            break;
                        }
                    }
                }
            }
        }
        t2.x=t1.x; t2.y=t1.y+1;
        if(t2.x>=1&&t2.x<=h&&t2.y>=1&&t2.y<=w)
        {
            if(a[t2.x][t2.y]!=1)
            {
                for(int k=t2.y;k<=w;k++)
                {
                    if(a[t2.x][k]==3) {cnt=t1.s; return;}
                    else
                    {
                        if(a[t2.x][k]==1)
                        {
                            a[t2.x][k]=0;
                            t2.y=k-1; t2.s=t1.s+1;
                            Q.push(t2);
                            break;
                        }
                    }
                }
            }
        }
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d",&w,&h)&&(w+h))
    {
        memset(a,0,sizeof(a));
        for(i=1;i<=h;i++)
            for(j=1;j<=w;j++)
        {
            scanf("%d",&a[i][j]);
            if(a[i][j]==2)
            {sx=i; sy=j;}
        }
        flag=false;
        cnt=1000000000;
        bfs();
        if(cnt<=10) printf("%d\n",cnt);
        else printf("-1\n");
    }
    return 0;
}