Tempter of the Bone

来源:互联网 发布:16奥运会中国男篮数据 编辑:程序博客网 时间:2024/06/14 18:32

这道题目如果只用深搜,而不用奇偶剪枝会超时


这道题目时间限制是1000ms,上面那个是我用了奇偶剪枝的,时间刚刚够用(可能其它剪枝的判断条件位置不太好)

题解(别家博主写的,耗费时间717ms):

点击打开链接http://blog.csdn.net/nvliba/article/details/48532593

奇偶剪枝:

点击打开链接http://blog.csdn.net/nvliba/article/details/48532709

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 5S.X...X...XD....3 4 5S.X...X....D0 0 0
Sample Output
NOYES


原创粉丝点击