奇偶剪枝问题 深搜搜到满足条件的路径时，不再搜其他路径

Tempter of the Bone

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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

不利用奇偶剪枝的话一直TLE，现在对于奇偶剪枝不理解，暂时记住公式，写一点自己奇偶剪枝的小理解，t-cnt为目前剩余的时间，abs(x-dx)+abs(y-dy)为从当前改点到终点（门)所需要的最短步数，剩余时间为偶数（奇数），就需要走偶数步（奇数步），
奇数-偶数 = 奇数
而奇数-奇数= 偶数，偶数-偶数=偶数
所以只有当剩余的时间与目前位置到终点的最短步数奇偶性相同时，才有可能恰好在t时刻到大门的地方（因为中间会有墙，需根据题目条件继续判定，奇偶剪枝只是把范围缩小了）

此题一开始还有个纠结的问题，就是深搜如何搜到符合条件的路径后就直接退出，一开始不知道怎么解决，因为觉得深搜利用了递归，无法return一下，就直接结束，此时用一个ans来解决就OK了，当搜索多条路径时，记得要还原

#include<iostream>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>


using namespace std;
char maze[7][7];
int book[7][7];
int d[4][2]={{0,-1},{-1,0},{0,1},{1,0}};
int n,m,t,ans,dx,dy;
void dfs(int x, int y, int cnt)
{
	if(ans)
		return;
	if(maze[x][y]=='D' && cnt==t)
	{
		ans=1;
		return;
	}
	int temp=t-cnt-abs(x-dx)-abs(y-dy);//奇偶剪枝核心代码
	if(temp<0 || temp&1)
		return;
	
	for(int i=0;i<4;i++)
	{
		
		int nx=x+d[i][0];
		int ny=y+d[i][1];
		
		if(nx<0 || nx>=n || ny<0 || ny>=m)
			continue;
		if(maze[nx][ny]!='X' && book[nx][ny]==0)
		{
			book[nx][ny]=1;
			dfs(nx,ny,cnt+1);
			if(ans)
				return;
			book[nx][ny]=0;;
		}
		
	}
	return;
}




int main()
{
	int x,y,num_wall;
	while(cin>>n>>m>>t && n && m && t)
	{
		
		num_wall=0;
		ans=0;
		memset(book,0,sizeof(book));
		for(int i=0;i<n;i++)
			scanf("%s",maze[i]);
		
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				if(maze[i][j]=='S')
					x=i,y=j;
				else if(maze[i][j]=='D')
					dx=i,dy=j;	
				else if(maze[i][j]=='X')
					num_wall++;
			}
		}
		if(n*m-num_wall-1<t)//这个地方一定要有，可以降低很多时间，做题的时候一定要记得考虑这种情况
		{                   //不要做无谓的运算
			printf("NO\n");
			continue;
		}
		book[x][y]=1;
		dfs(x,y,0);
		if(ans==1)
			printf("YES\n");
		else printf("NO\n");
	}
	
	return 0;
}