POJ 3009Curling 2.0(DFS)
来源:互联网 发布:网络女神思瑞被粉丝 编辑:程序博客网 时间:2024/06/05 02:17
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
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<string>using namespace std;int mp[25][25];int enx,eny;int res,m,n;int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};void dfs(int x,int y,int step){ if(step>10) return; if(x==enx&&y==eny) { res=min(res,step); return; } int cx,cy; for(int i=0;i<4;i++) { cx=x+dir[i][0],cy=y+dir[i][1]; if(cx<0||cx>=m||cy<0||cy>=n) continue; if(mp[cx][cy]==3) dfs(cx,cy,step+1); //直接到终点 if(mp[cx][cy]==1) continue; //挨着的点撞不了 while(1) { cx+=dir[i][0],cy+=dir[i][1]; if(cx>=0&&cx<m&&cy>=0&&cy<n) { if(mp[cx][cy]==3) dfs(cx,cy,step+1); else if(mp[cx][cy]==1) { mp[cx][cy]=0; dfs(cx-dir[i][0],cy-dir[i][1],step+1); mp[cx][cy]=1; break; } } else break; } }}int main(){ int stax,stay; int i,j; while(cin>>n>>m) { if(m==0&&n==0) break; for(i=0;i<m;i++) for(j=0;j<n;j++) { scanf("%d",&mp[i][j]); if(mp[i][j]==2) stax=i,stay=j; else if(mp[i][j]==3) enx=i,eny=j; } res=20; dfs(stax,stay,0); if(res==20) puts("-1"); else printf("%d\n",res); } return 0;}/*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*/
- POJ 3009 Curling 2.0 DFS
- poj-3009-Curling 2.0-dfs
- poj 3009 Curling 2.0 DFS
- poj 3009 Curling 2.0 DFS
- POJ 3009Curling 2.0(DFS)
- POJ 3009 Curling 2.0 (DFS)
- poj-3009-Curling 2.0-dfs
- poj 3009 Curling 2.0 DFS
- POJ 3009 Curling 2.0 (DFS)
- poj 3009 Curling 2.0 【DFS】
- POJ 3009 Curling 2.0 DFS
- poj 3009 Curling 2.0 (dfs)
- Curling 2.0 (poj 3009 dfs)
- POJ 3009--Curling 2.0【DFS】
- POJ 3009 Curling 2.0(DFS)
- poj-3009 Curling 2.0-DFS
- POJ-3009-Curling 2.0- DFS
- POJ 3009 Curling 2.0 (DFS)
- Effective stl 第1章 容器 第5条
- Today is boring... I register a new account in stackoverflow
- JavaScript模拟C输入
- 主流浏览器内核
- Objective-C语法之代码块(block)的使用
- POJ 3009Curling 2.0(DFS)
- DeDe CMS v5.5 图片集上传图片出错的解决办法
- C++创建动态二维数组
- 20140109早读课:设计还没完成就被吐槽指手划脚,怎么办?
- 让小公司事半功倍的15款应用
- John Keats
- Unique Binary Search Trees——唯一的二叉搜索树
- 致命错误: zlib.h:没有那个文件或目录
- 基于Linux的TCP网络编程