POJ 3009-Curling 2.0(DFS-滑动撞击)
来源:互联网 发布:淘宝童装图片轮播 编辑:程序博客网 时间:2024/04/30 22:57
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<cstdio>#include<cstring>#include<cmath>#include<set>#include<cstdlib>#include<iostream>#include<algorithm>using namespace std;#define MAXN 30#define INF 0x3f3f3f3fstruct Node{ int x,y;} s;int ma[MAXN][MAXN];int dir[4][2]= {{-1,0},{0,1},{1,0},{0,-1}};//搜索方向int st;//步数int w,h;//列行bool mflag;//移动是否合法int ans=INF;//最小步数void DFS(int x,int y){ if(st>=10) return; for(int i=0; i<4; ++i)//各个方向依次滑动 { int tx=x; int ty=y; mflag=false; while(1) { tx+=dir[i][0]; ty+=dir[i][1]; if(ma[tx][ty]==0||ma[tx][ty]==2||ma[tx][ty]==3)//判断移动是否合法 mflag=true; if(tx<0||ty<0||tx>=h||ty>=w)//越界 { mflag=false; break; } else if(ma[tx][ty]==3)//到达终点 { ++st; if(st<ans) ans=st;//更新最小值 --st; return; } else if(ma[tx][ty]==1)//撞击障碍1 { if(mflag)//合法移动 { mflag=false; ma[tx][ty]=0; ++st; //tx-=dir[i][0]; //ty-=dir[i][1]; DFS(tx-dir[i][0],ty-dir[i][1]); mflag=false; ma[tx][ty]=1;//被撞击的地方恢复原样 --st; } break; } } }}int main(){#ifdef ONLINE_JUDGE#else freopen("G:/cbx/read.txt","r",stdin); //freopen("G:/cbx/out.txt","w",stdout);#endif ios::sync_with_stdio(false); cin.tie(0); while(cin>>w>>h) { if(w==0&&h==0) break; st=0; ans=INF; flag=mflag=false; memset(ma,0,sizeof(ma)); for(int i=0; i<h; ++i) for(int j=0; j<w; ++j) { cin>>ma[i][j]; if(ma[i][j]==2) s.x=i,s.y=j;//起点 } DFS(s.x,s.y); if(ans==INF) cout<<"-1"<<endl; else cout<<ans<<endl; } return 0;}
测试数据:
1 171 0 0 0 0 1 0 1 0 1 1 1 0 0 3 2 0 3 60 0 1 1 1 1 2 3 1 1 1 0 0 1 0 0 0 1 18 141 0 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 3 0 1 0 1 0 1 1 0 0 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 1 0 0 1 1 0 0 2 1 1 1 1 1 1 0 1 0 1 1 0 0 0 0 0 1 1 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 1 0 0 1 1 1 0 1 1 1 0 0 1 0 1 0 0 0 0 0 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 0 1 0 0 1 1 1 0 0 1 0 1 0 1 1 1 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 0 0 0 1 1 1 0 1 0 0 0 1 1 1 0 1 1 1 1 1 0 1 0 0 0 0 0 1 1 0 1 0 0 0 0 1 1 1 1 0 0 1 0 14 120 1 0 0 1 1 0 1 0 1 0 1 2 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 1 0 1 0 3 1 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 0 1 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 0 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 0 0 0 0 1 0 0 1 1 1 0 1 0 1 0 9 131 0 1 1 0 0 1 0 0 0 0 1 1 1 1 1 0 1 1 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 0 1 1 0 1 1 1 1 1 1 0 1 0 1 0 1 1 0 0 0 1 0 3 1 1 0 0 1 0 1 0 1 1 0 0 0 1 2 1 1 0 0 1 0 0 1 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 1 1 1 0 2 73 0 1 1 0 0 1 0 1 0 0 1 2 0 4 131 0 1 0 1 0 0 1 1 0 1 1 3 1 0 0 1 0 1 1 0 1 1 0 0 0 0 0 2 1 0 1 1 1 0 0 1 1 1 1 1 0 0 0 0 0 1 0 1 0 0 1 14 190 1 0 1 1 0 0 1 1 1 1 1 0 0 1 0 0 0 3 0 0 1 1 1 2 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 1 0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 1 0 0 1 0 1 1 1 1 0 0 1 1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 0 1 1 0 0 1 1 1 1 0 1 1 0 1 1 0 0 0 1 0 1 0 1 1 1 0 0 1 0 1 1 0 0 0 1 0 0 5 41 0 0 1 0 3 1 1 1 2 1 0 0 1 1 1 1 0 0 0 18 60 1 1 0 0 1 0 0 0 0 0 1 0 1 1 1 0 0 1 0 1 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 1 1 1 1 0 0 0 1 0 0 0 1 1 0 1 0 1 2 0 0 1 0 3 1 1 1 0 0 0 0 1 1 0 0 0 0 1 1 1 1 0 1 1 0 1 0 1 1 0 1 0 0 1 1 1 0 19 171 1 1 1 0 1 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 1 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 0 0 0 0 1 1 3 1 1 0 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 1 1 0 0 1 0 1 1 0 0 1 1 0 0 0 1 0 1 1 1 1 0 1 0 0 0 2 1 1 1 1 0 1 1 0 1 0 0 1 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 0 1 0 0 0 0 0 0 1 1 1 0 0 1 1 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 0 1 1 1 0 0 1 1 1 1 0 1 0 0 1 0 1 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 1 1 1 1 0 1 1 1 0 0 0 18 21 1 0 1 0 1 1 0 1 0 0 3 0 0 1 0 1 0 0 0 0 1 0 1 0 1 1 2 1 1 0 1 0 0 1 0 7 101 0 0 0 1 1 0 1 0 1 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0 0 1 0 1 1 0 1 2 1 0 0 3 0 0 1 0 0 0 1 1 1 0 0 0 1 0 1 0 1 0 0 1 1 1 1 1 1 0 14 60 0 1 0 0 0 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 0 2 1 1 0 0 1 0 0 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 0 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 3 4 80 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 3 0 1 0 1 0 1 0 1 0 0 2
Output
11-1-19425-176-110-1-1
- 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)
- 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)
- poj 3009 Curling 2.0 (DFS)
- POJ 3009 Curling 2.0(dfs)
- POJ - 3009 Curling 2.0(DFS,模拟)
- POJ 题目3009 Curling 2.0(DFS)
- 常用MessageQueue及特点
- 智慧农业的发展离不开网联网技术
- Java 知识结构
- mysql主从复制(超简单)
- bean装配基于注解
- POJ 3009-Curling 2.0(DFS-滑动撞击)
- 使用WinDBG生成dump文件 WinDBG分析dump文件
- 石子合并问题 (区间dp)
- Fragment的getActivity()为null
- MySQL数据类型--日期时间
- 摇身一变成PM的程序员很煎熬!怎么办?
- EXISTS字句
- kafka 版本迭代递进
- Android中Serializable和Parcelable序列化对象详解