poj 3009( 搜索 )
来源:互联网 发布:全业务数据质量管控 编辑:程序博客网 时间:2024/05/08 00:41
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.
- The stone hits a block (Fig. 2(b), (c)).
- 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.
0vacant square1block2start position3goal 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 13 26 61 0 0 2 1 01 1 0 0 0 00 0 0 0 0 30 0 0 0 0 01 0 0 0 0 10 1 1 1 1 16 11 1 2 1 1 36 11 0 2 1 1 312 12 0 1 1 1 1 1 1 1 1 1 313 12 0 1 1 1 1 1 1 1 1 1 1 30 0
Sample Output
14-1410-1
Source
#include <stdio.h>#include <string.h>#define N 20#define IMAX 0x7fffffffint map[N][N];int result;int row,column;int dx[4] = {-1,0,1,0};int dy[4] = {0,1,0,-1};void dfs(int x,int y,int step){ int nx,ny,i,flag; if( step == 10 || step >= result) { return; } for( i = 0; i < 4; i++){ flag = 0; nx = x + dx[i]; ny = y + dy[i]; if( nx >= 0 && nx < row && ny >= 0 && ny < column && map[nx][ny] != 1){ while(1){ if( nx < 0 || nx >= row || ny < 0 || ny >= column ){ flag = 1; break; } else if( map[nx][ny] == 3){ flag = 1; if(step + 1 < result) { result = step + 1; } break; } else if( map[nx][ny] == 1){ break; } nx += dx[i]; ny += dy[i]; } if(flag == 0){ map[nx][ny] = 0; dfs(nx-dx[i],ny-dy[i],step+1); map[nx][ny] = 1; } } } return;}int main(){ while(scanf("%d%d",&column,&row), column || row){ result = IMAX ; int i,j,stx,sty; for( i = 0; i < row; i++){ for( j = 0; j < column; j++){ scanf("%d",&map[i][j]); if( map[i][j] == 2){ stx = i; sty = j; } } } dfs(stx,sty,0); if(result == IMAX){ printf("-1\n"); } else { printf("%d\n",result); } } return 0;}
- poj 3009( 搜索 )
- poj 3009(深度搜索)
- poj 3009 搜索
- 深度优先搜索【POJ 3009】
- POJ-3009 深度优先搜索
- POJ 3009 Curling 2.0【深度优先搜索】
- poj 3009 Curling2.0 回溯搜索
- POJ 3009 Curling 2.0 {深度优先搜索}
- poj 3009(Curling 2.0 暴力搜索)
- POJ 3009 基础搜索 DFS 四
- poj 3009 冰壶游戏隐式图搜索
- Curling 2.0 (POJ 3009, 深度优先搜索)
- POJ搜索题目总结
- POJ 2976 参数搜索
- 简单搜索1979@POJ
- 广度搜索-POJ 1753
- POJ搜索题目
- POJ - 1011 搜索剪枝
- 游戏开发笔记之一——API函数、DirectX的关键系统
- JQuery 模糊与精确匹配 文本
- models of Object Detection with Discriminatively Trained Part Based Models中star-cascade级联检测
- hibernate jar包介绍
- Ubuntu_Ubuntu硬盘格式化
- poj 3009( 搜索 )
- 01.部署NopCommerce时遇到的问题
- JSP生产静态页面
- 程序员必知8大排序3大查找(一)
- 网络知识
- 编程珠玑 11章 排序
- 黑马程序员_学习日记21_ASP.Net中级
- 高质量编程C/C++
- 虚拟机安装和设置