HDU-1010 dfs＋剪枝

这个题一开始直接暴力回溯，一直超时，后来加上距离判断也不对，最后想到了最短路，就是到达重点的最短路，减去那个时间能够取余2才可以。

现在来说一下这个题目的意思吧，就是从起点走到终点，然后不能在原地停留，还有一个就是必须在那个时间到达，这个时候就需要我们去判断路径问题。

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <math.h>
#include <stack>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
const int maxn = 10;
int vis[maxn][maxn];
char g[maxn][maxn];
int ex,ey;
int sx,sy;
int m,n,t;
int cur;
bool judge(int a,int b)
{
    if(a >= 0 && a <= n&&b >= 0 && b<=m)
        return true;
    return false;
}
bool dfs(int x,int y,int k)
{
   if(k == t)
   {
       if(g[x][y] == 'D')
        return true;
       else
        return false;
   }

       for(int i = 0;i < 4;i++)
       {
           int dx = x + dir[i][0];
           int dy = y + dir[i][1];
           if(judge(dx,dy)&&(g[dx][dy] == '.'||(g[dx][dy] == 'D' && k + 1 == t))  && !vis[dx][dy])
           {
               vis[dx][dy] = 1;
               if(dfs(dx,dy,k+1))
                return true;
               vis[dx][dy] = 0;
           }
       }

   return false;

}
int main()
{
    while( cin>>n>>m>>t)
    {

        if(n == 0&&m ==0&& t == 0)
            break;
        memset(vis,0,sizeof(vis));
        cur = 0;
        getchar();
        for(int i = 0; i < n; i++)
        {
            scanf("%s",&g[i]);
        }
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < m; j++)
            {
                if(g[i][j] == 'S')
                {
                    sx = i;
                    sy = j;
                    vis[sx][sy] = 1;
                }
                if(g[i][j] == 'D')
                {
                    ex = i;
                    ey = j;
                }
            }
        }
        if(abs(sx - ex) + abs(sy-ey) > t || abs(abs(sx - ex) + abs(sy-ey) - t) % 2)
        {
            //cout<<"*"<<endl;
            printf("NO\n");
            continue;
        }
        if(dfs(sx,sy,0))
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

 

 

 

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