POJ 3009解题报告

最新推荐文章于 2022-04-11 09:26:15 发布

jhljx

最新推荐文章于 2022-04-11 09:26:15 发布

阅读量464

点赞数

分类专栏：搜索

本文链接：https://blog.csdn.net/u012294939/article/details/39644935

版权

搜索专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Curling 2.0

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11839		Accepted: 5016

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

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.

Each dataset is formatted as follows.

the width(=w) and the height(=h) of the board
First row of the board
...
h-th row of the board

The width and the height of the board satisfy: 2 <=w <= 20, 1 <=h <= 20.

Each line consists of w decimal numbers delimited by a space. The number describes the status of the corresponding square.

0 vacant square
1 block
2 start position
3 goal position

The dataset for Fig. D-1 is as follows:

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

Output

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.

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

Source

Japan 2006 Domestic

解题注意

这道题属于搜索的经典题，需要注意在搜索中的剪枝，从而降低搜索的时间复杂度。首先要避免一个格子一个格子的搜索，这样会超时。搜索尽可能减少递归的深度。所以利用循环减少不必要的递归。要分清只有在遇到障碍物和终点的时候才会停止，所以只需要搜索到这些位置即可。还有不需要判断下一个要走的位置是不是障碍物，直接让它走到障碍物上，然后再退回原来位置即可。在搜索可行位置时一定要保证该位置不为1，如果为1，则continue.而且当路径长度大于10的时候要停止递归。

最重要的一点是在什么时候对路径长度加1，不要在一开始就加1，只有在遇到障碍物，或者遇到终点的时候。要注意这个原因。可以考虑折线段，当遇到障碍物或者终点时，折线段的长度加1。

在搜索类题目中注意搜索的姿势，一定要尽可能减少递归的次数，减少递归深度。注意在剪枝方面下功夫。

参考代码

（AC代码）

<span style="font-size:14px;">#include<cstdio>
#include<iostream>
using namespace std;
int n,m,ans=(1<<30);
int a[30][30];
int dx[4]= {-1,0,0,1},dy[4]={0,1,-1,0};
bool flag=0;
void solve(int x,int y,int num)
{
    if(num>10)
        return;
    for(int i=0; i<4; i++)
    {
        int x1=x+dx[i],y1=y+dy[i];
        if(x1>=1&&x1<=m&&y1>=1&&y1<=n&&a[x1][y1]==1)
            continue;
        while(x1>=1&&x1<=m&&y1>=1&&y1<=n&&!a[x1][y1])
            x1+=dx[i],y1+=dy[i];
        if(x1>=1&&x1<=m&&y1>=1&&y1<=n)
        {
            if(a[x1][y1]==3)
            {
                num++;flag=1;
                ans=min(ans,num);
                return;
            }
            if(a[x1][y1]==1)
            {
                if(x1-dx[i]>=1&&x1-dx[i]<=m&&y1-dy[i]>=1&&y1-dy[i]<=n)
                {
                    a[x1][y1]=0;
                    solve(x1-dx[i],y1-dy[i],num+1);
                    a[x1][y1]=1;
                }
            }
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m)&&n+m)
    {
        int x0=0,y0=0;
        flag=0;ans=(1<<30);
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++)
            {
                scanf("%d",&a[i][j]);
                if(a[i][j]==2)
                    x0=i,y0=j,a[i][j]=0;
            }
        solve(x0,y0,0);
        if(flag)
        {
            if(ans<=10) printf("%d\n",ans);
            else printf("-1\n");
        }
        else printf("-1\n");
    }
}

（方法正确，TLE代码）

<span style="font-size:14px;">#include<cstdio>
#include<iostream>
using namespace std;
int n,m,ans=(1<<30);
int a[30][30];
int dx[4]= {-1,0,0,1},dy[4]= {0,1,-1,0};
bool flag=0;
void solve(int x,int y,int num,int dir)
{
    if(num>10)
        return;
    if(a[x][y]==2)
    {
        int shu=0;
        for(int i=0; i<4; i++)
            if(x+dx[i]>=1&&x+dx[i]<=m&&y+dy[i]>=1&&y+dy[i]<=n)
                if(a[x+dx[i]][y+dy[i]]==0||a[x+dx[i]][y+dy[i]]==3)
                    shu++;
        if(shu==0)
            return;
        for(int i=0; i<4; i++)
        {
            if(x+dx[i]>=1&&x+dx[i]<=m&&y+dy[i]>=1&&y+dy[i]<=n)
            {
                if(a[x+dx[i]][y+dy[i]]==1)
                {
                    for(int j=0; j<4; j++)
                    {
                        if(j!=i&&x+dx[j]>=1&&x+dx[j]<=m&&y+dy[j]>=1&&y+dy[j]<=n)
                        {
                            a[x+dx[i]][y+dy[i]]=0;
                            solve(x+dx[j],y+dy[j],num+1,j);
                            a[x+dx[i]][y+dy[i]]=1;
                        }
                    }
                }
                else
                    solve(x+dx[i],y+dy[i],num,i);
            }
        }
    }
    else if(a[x][y]==0)
    {
        if(x+dx[dir]>=1&&x+dx[dir]<=m&&y+dy[dir]>=1&&y+dy[dir]<=n)
        {
            if(a[x+dx[dir]][y+dy[dir]]==1)
            {
                for(int j=0; j<4; j++)
                {
                    if(j!=dir&&x+dx[j]>=1&&x+dx[j]<=m&&y+dy[j]>=1&&y+dy[j]<=n)
                    {
                        a[x+dx[dir]][y+dy[dir]]=0;
                        solve(x+dx[j],y+dy[j],num+1,j);
                        a[x+dx[dir]][y+dy[dir]]=1;
                    }
                }
            }
            else
                solve(x+dx[dir],y+dy[dir],num,dir);
        }
    }
    else if(a[x][y]==3)
    {
        num++;
        flag=1;
        ans=min(ans,num);
        return;
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m)&&n+m)
    {
        int x0=0,y0=0;
        flag=0;
        ans=(1<<30);
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++)
            {
                scanf("%d",&a[i][j]);
                if(a[i][j]==2)
                    x0=i,y0=j,a[i][j]=0;
            }
        solve(x0,y0,0,0);
        if(flag)
        {
            if(ans<=10) printf("%d\n",ans);
            else printf("-1\n");
        }
        else printf("-1\n");
    }
}