POJ 3009 Curling 2.0 (dfs剪枝)
来源:互联网 发布:vscode nodejs 调试 编辑:程序博客网 时间:2024/05/18 00:49
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
dfs(x,y,seg) x,y为当前坐标 seg为线段数 if(seg > 10 || seg >= ans) return; 剪枝很重要 不然会TLE
AC代码如下:
//// POJ 3009 Curling 2.0//// Created by TaoSama on 2015-02-19// Copyright (c) 2014 TaoSama. All rights reserved.//#include <algorithm>#include <cctype>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <string>#include <set>#include <vector>#define CLR(x,y) memset(x, y, sizeof(x))using namespace std;const int INF = 0x3f3f3f3f;const int MOD = 1e9 + 7;const int N = 1e5 + 10;int n, m, d[4][2] = { -1, 0, 1, 0, 0, 1, 0, -1};;char a[105][105];int sx, sy, ans;void dfs(int x, int y, int seg) {if(seg > 10 || seg >= ans) return;for(int i = 0; i < 4; ++i) {for(int j = 1;; ++j) {int nx = x + j * d[i][0], ny = y + j * d[i][1];if(nx < 1 || nx > n || ny < 1 || ny > m) break;if(a[nx][ny] == '3') {ans = min(ans, seg + 1);//cout << "seg: " << seg + 1 << endl;return;}if(a[nx][ny] == '1') {if(j == 1) break; //直接撞上的情况a[nx][ny] = '0';nx -= d[i][0], ny -= d[i][1];dfs(nx, ny, seg + 1);nx += d[i][0], ny += d[i][1];a[nx][ny] = '1';break;}}}}int main() {#ifdef LOCALfreopen("in.txt", "r", stdin);//freopen("out.txt","w",stdout);#endifios_base::sync_with_stdio(0);while(cin >> m >> n && n != 0 && m != 0) {for(int i = 1; i <= n; ++i) {for(int j = 1; j <= m; ++j) {cin >> a[i][j];if(a[i][j] == '2')sx = i, sy = j;}}ans = INF;dfs(sx, sy, 0);if(ans > 10) ans = -1;cout << ans << endl;}return 0;}
- POJ 3009 Curling 2.0 (dfs剪枝)
- POJ 3009-Curling 2.0(dfs+剪枝)
- pku 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,模拟)
- 二十四周项目一--哈希法存储与查找
- AOJ 0033 Ball (dfs)
- NYOJ--199 无线网络覆盖【水题】
- C# StringBuilder分析
- PHP+HTML实现登出界面倒计时效果
- POJ 3009 Curling 2.0 (dfs剪枝)
- [算法系列之二十]字典树(Trie)
- 第3章 使用批量数据
- 各类C语言排序算法汇总--插入排序、快速排序
- 二十四周项目二--回溯法之走迷宫
- 寒假小练习——破译密码
- AOJ 0558 Cheese (bfs)
- Emoji表情 过滤 c#
- 【转】Python Numpy数组保存