POJ 题目3009 Curling 2.0(DFS)
2015-12-20 16:34
621 查看
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.
![](http://poj.org/images/3009_1.gif)
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.
![](http://poj.org/images/3009_2.gif)
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).
![](http://poj.org/images/3009_3.gif)
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.
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
Sample Output
Source
Japan 2006 Domestic
看上去吓人实际上很水的搜索
ac代码
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 15536 | Accepted: 6421 |
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.
![](http://poj.org/images/3009_1.gif)
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.
![](http://poj.org/images/3009_2.gif)
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).
![](http://poj.org/images/3009_3.gif)
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 |
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
Japan 2006 Domestic
看上去吓人实际上很水的搜索
ac代码
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<iostream> #include<algorithm> #include<math.h> #define LL long long #define INF 0x3f3f3f3f using namespace std; int dirx[4]={0,1,0,-1}; int diry[4]={1,0,-1,0}; int map[22][22]; int vis[22][22][4]; int ans; int n,m; void dfs(int x,int y,int dir,int step) { int i; if(step>10) return; if(map[x][y]==3) { ans=min(ans,step); return; } int tx=x+dirx[dir]; int ty=y+diry[dir]; if(tx<1||tx>n) return; if(ty<1||ty>m) return; if(map[tx][ty]==1) { map[tx][ty]=0; for(i=0;i<4;i++) { //if(!vis[x][y][i]) //{ // vis[x][y][i]=1; int tcx=x+dirx[i]; int tcy=y+diry[i]; if(map[tcx][tcy]==1) continue; dfs(x,y,i,step+1); // vis[x][y][i]=0; //} } map[tx][ty]=1; } else { // if(!vis[tx][ty][dir]) //{ // vis[tx][ty][dir]=1; dfs(tx,ty,dir,step); // vis[tx][ty][dir]=0; //} } } int x,y; void GET() { int i,j; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { scanf("%d",&map[i][j]); if(map[i][j]==2) { x=i; y=j; } } } } int main() { //int n,m; while(scanf("%d%d",&m,&n)!=EOF,n||m) { int i,j; GET(); ans=INF; for(i=0;i<4;i++) { //memset(vis,0,sizeof(vis)); int tcx=x+dirx[i]; int tcy=y+diry[i]; if(map[tcx][tcy]==1) continue; dfs(x,y,i,1); } if(ans==INF) ans=-1; printf("%d\n",ans); } }
相关文章推荐
- 总结C++中三种关于"new"的使用方法
- 计算机书单
- 实现拖放的步骤,有关的事件,方法
- HTML5新标签的用法和HTML4的区别
- React用JS 模拟动画介绍
- WordPress禁止版本修订历史、自动保存和自动草稿最新方法汇总
- 重构代码
- javascript 绑定事件 阻止冒泡和默认事件
- JAVA里面的 静态绑定与动态绑定 杂谈
- mysql5.6二进制安装
- 【android】Cursor记录集游标、ListView和SimpleCursorAdapter、ListView数据动态更新
- MAC OS 常用快捷键
- html5新增的语义化标签
- 一个简单的安卓小应用,开发步骤以及遇到的各种问题总结
- linux给一些常用的指令起别名
- Android api23中删除HttpClient的相关类的解决方法
- HTML 排版与标签(二)
- ajax传递多个参数
- 读书笔记之ado.net entity framework
- API 3个 js对象