zoukankan      html  css  js  c++  java
  • [POJ3009]Curling 2.0

    题目描述 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 Description

    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 Description

    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

    1
    4
    -1
    4
    10
    -1

    数据范围及提示 Data Size & Hint

     

    之前的一些废话:是时候准备会考了。。

    题解:完全的无脑大暴搜

    代码:

    #include<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<queue>
    #include<cmath>
    #include<cstring>
    using namespace std;
    typedef long long LL;
    typedef pair<int,int> PII;
    #define mem(a,b) memset(a,b,sizeof(a))
    inline int read()
    {
        int x=0,f=1;char c=getchar();
        while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
        while(isdigit(c)){x=x*10+c-'0';c=getchar();}
        return x*f;
    }
    int n,m,pic[25][25],ans=20,dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
    PII s,t;
    bool judge(int x,int y){return x>=1 && x<=n && y>=1 && y<=m;}
    void dfs(PII now,int step)
    {
        if(step>=10)return;
        if(now==t){ans=min(ans,step);return;}
        for(int i=0;i<4;i++)
        {
            int x=now.first,y=now.second;
            while(judge(x+dx[i],y+dy[i]) && make_pair(x+dx[i],y+dy[i])!=t && pic[x+dx[i]][y+dy[i]]!=1)x+=dx[i],y+=dy[i];
            if(make_pair(x+dx[i],y+dy[i])==t){ans=min(ans,step+1);return;}
            if(x==now.first && y==now.second)continue;
            if(!judge(x+dx[i],y+dy[i]))continue;
            pic[x+dx[i]][y+dy[i]]=0;dfs(make_pair(x,y),step+1);pic[x+dx[i]][y+dy[i]]=1;
        }
        return;
    }
    int main()
    {
        while(scanf("%d%d",&m,&n)!=EOF && n && m)
        {
            ans=20;mem(pic,0);
            for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)
            {
                pic[i][j]=read();
                if(pic[i][j]==2)s=make_pair(i,j);
                else if(pic[i][j]==3)t=make_pair(i,j);
            }
            dfs(s,0);
            printf("%d
    ",ans>10 ? -1 : ans);
        }
        return 0;
    }
    View Code

    总结:我已经分不清暴搜和状压的区别了,谁能救救我。。

  • 相关阅读:
    noip模拟赛 集合
    noip模拟赛 旅行
    noip模拟赛 终末
    noip模拟赛 少女
    noip模拟赛 无题
    Java基础知识强化73:正则表达式之分割功能
    Java基础知识强化72:正则表达式之判断功能(手机号码判断 和 校验邮箱)
    Java基础知识强化71:正则表达式之基本规则 和 常用正则表达式
    Java基础知识强化70:正则表达式之引入案例(QQ号码校验)
    Java基础知识强化69:基本类型包装类之Character案例(统计字符串中大写小写以及数字的次数)
  • 原文地址:https://www.cnblogs.com/FYH-SSGSS/p/7060938.html
Copyright © 2011-2022 走看看