杭电OJ1010
Problem Description
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.
The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.
Input
The input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:
‘X’: a block of wall, which the doggie cannot enter;
‘S’: the start point of the doggie;
‘D’: the Door; or
‘.’: an empty block.
The input is terminated with three 0’s. This test case is not to be processed.
Output
For each test case, print in one line “YES” if the doggie can survive, or “NO” otherwise.
Sample Input
4 4 5
S.X.
…X.
…XD
…
3 4 5
S.X.
…X.
…D
0 0 0
Sample Output
NO
YES
思路:这道题主要是搜索剪枝加回溯,其中剪枝用到的是奇偶剪枝,因为dog到达的时间必须的固定的,就根据这个特性,可以推出这个特性来剪枝
具体代码
#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<cmath>
using namespace std;
int book[8][8];
int vis[8][8];
int ex, ey, bx, by;
int t, n, m;
int flag = 0;
int dx[4]{ 1,0,-1,0 }, dy[4]{ 0,1,0,-1 };
void dfs(int x, int y, int time)
{
int i;
if (time > t || 1 == flag) return;
else if (time == t && x==ex&&y==ey)
{
flag = 1;
return;
}
else
{
for (i = 0; i < 4; i++)
{
int tx = x + dx[i], ty = y + dy[i];
if (tx < 0 || ty < 0 || tx >= n || ty >= m || vis[tx][ty] || book[tx][ty])
continue;
int temp = t - time - abs(ex - x) - abs(ey - y);
if (temp < 0 || temp & 1)
continue;
vis[tx][ty] = 1;
dfs(tx, ty, time + 1);
vis[tx][ty] = 0;
}
}
}
int main() {
memset(vis, 0, sizeof(vis));
while (cin >> n >> m >> t && (n != 0 && m != 0 && t != 0)) {
memset(vis, 0,sizeof(vis));
flag = 0;
for(int i=0;i<n;i++)
for (int j = 0; j < m; j++) {
char s;
cin >> s;
if (s == 'S') {
book[i][j] = 1;
bx = i; by = j;
}
else if (s == 'D') {
book[i][j] = 0;
ex = i; ey = j;
}
else if (s == 'X')
book[i][j] = 1;
else if (s == '.')
book[i][j] = 0;
}
dfs( bx, by,0);
if (flag)
cout << "YES\n";
else
cout << "NO\n";
}
return 0;
}