zoukankan      html  css  js  c++  java
  • 【POJ】3009 Curling 2.0 ——DFS Prime

    Curling 2.0
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11432   Accepted: 4831

    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

    1
    4
    -1
    4
    10
    -1

    Source

     
    题解:题目看起来很复杂,其实很简单,我就不翻译了。由于深度较小,直接上DFS就可以了。
     
    AC代码:
     
     1 #include <cstdio>
     2 #include <cstring>
     3 #define MAX(a, b) (a>b?a:b)
     4 
     5 const int LEN = 22;
     6 
     7 const int vec[2][5] = { {0, -1, 0, 1, 0}, {0, 0, -1, 0, 1}}; //方向向量
     8 
     9 int map[LEN][LEN];
    10 int ans;
    11 int r, c;
    12 
    13 void dfs(int x, int y, int dir, int res)
    14 {
    15     if (res > 10){ //超过十步 return
    16         return;
    17     }
    18     int rx = 0;
    19     int ry = 0;
    20     if (dir != 0){
    21         for(int i = 0; i < MAX(r, c); i++){
    22             x += vec[0][dir];
    23             y += vec[1][dir];
    24             if (x < 1 || x > c || y < 1 || y > r){
    25                 return;
    26             }
    27             if (map[y][x] == 3){ //到达终点,与ans比较大小
    28                 if (res < ans)
    29                     ans = res;
    30                 return;
    31             }
    32             if (map[y][x] == 1){
    33                 map[y][x] = 0;
    34                 rx = x;
    35                 ry = y;
    36                 x -= vec[0][dir];
    37                 y -= vec[1][dir];
    38                 break;
    39             }
    40         }
    41     }
    42     if (x-1 >= 1 && map[y][x-1] != 1)
    43         dfs(x, y, 1, res+1);
    44     if (x+1 <= c && map[y][x+1] != 1)
    45         dfs(x, y, 3, res+1);
    46     if (y-1 >= 1 && map[y-1][x] != 1)
    47         dfs(x, y, 2, res+1);
    48     if (y+1 <= r && map[y+1][x] != 1)
    49         dfs(x, y, 4, res+1);
    50     map[ry][rx] = 1;
    51 }
    52 
    53 int main()
    54 {
    55     //freopen("in.txt", "r", stdin);
    56     while(scanf("%d %d", &c, &r) != EOF && r+c){
    57         int x, y;
    58         for(int i = 1; i <= r; i++){
    59             for(int j = 1; j <= c; j++){
    60                 scanf("%d", &map[i][j]);
    61                 if (map[i][j] == 2){
    62                     y = i;
    63                     x = j;
    64                 }
    65             }
    66         }
    67         ans = 0x7fffffff;
    68         dfs(x, y, 0, 0);
    69         if (ans != 0x7fffffff)
    70             printf("%d\n", ans);
    71         else
    72             printf("-1\n");
    73     }
    74     return 0;
    75 }
  • 相关阅读:
    一个存储过程
    Visual Studio 2013无法打开IIS Express Web的解决办法
    文字沟通工具使用SignalR,跨域例子源代码
    js图片旋转
    LINQ to Entities does not recognize the method , and this method cannot be translated into a store expression 解决办法
    ASP.NET MVC利用ActionLink实现动态组合查询
    wusir FTP与HTTP文件传输之TCP Packet解析
    在Windows Server 2008 R2(x64)上安装.NET Framework 4.5 兼谈.NET Framework 4.0 “在服务器核心角色上不受支持”含义
    人机交互 由美的空调柜机不一致的面板设计 谈递增与递减设计原则
    ToolkitScriptManager vs. ScriptManager 关于“只能向页面中添加 ScriptManager 的一个实例”讨论
  • 原文地址:https://www.cnblogs.com/kevince/p/3890859.html
Copyright © 2011-2022 走看看