HDUOJ 1010 Tempter of the Bone (深搜+奇偶减枝）

solution：原本以为是简单的迷宫上深搜，但是将各种常规减枝都剪除了之后仍然超时，很是恼火，百度了一下发现还有奇偶减枝这个东西，果然加了奇偶减枝就过了，不明白奇偶减枝的看这个链接

#include <bits/stdc++.h>
using namespace std;

int n, m, door, ex, ey;
bool flag;
char maze[7][7];
bool book[7][7];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

void dfs(int x, int y, int cnt)
{
	if (flag || cnt > door || book[x][y] || x < 0 || y < 0 || x >= n || y >= m || maze[x][y] == 'X')return;
	if (maze[x][y] == 'D'){
		if (cnt == door)flag = true;
		return;
	}
	int temp = abs(x - ex) + abs(y - ey);
	temp = door - temp - cnt;
	if(temp & 1)return;//奇偶减枝
	book[x][y] = true;
	for (int i = 0; i < 4; ++i)dfs(x + dx[i], y + dy[i], cnt + 1);
	book[x][y] = false;
}

int main()
{
	int sx, sy;
	while (cin >> n >> m >> door)
	{
		if (!n && !m && !door)return 0;
		flag = false;
		fill(book[0], book[0] + n * m, false);
		for (int i = 0; i < n; ++i){
			for (int j = 0; j < m; ++j){
				cin >> maze[i][j];
				if (maze[i][j] == 'S'){
					sx = i;
					sy = j;
				}else if (maze[i][j] == 'D'){
					ex = i;
					ey = j;
				}
			}
		}
		dfs(sx, sy, 0);
        if (flag)cout << "YES" << endl;
        else cout << "NO" << endl;
	}
}