hdu1010

一道极易超时的DFS题目；

优化其实较难想到，关键在于绕道优化的情况；

#include<stdio.h>
#include<string.h>
const int ar[5]={0,-1,0,1,0},pr[5]={0,0,1,0,-1};    
int q[8][8],tox,toy,n,m;
inline int abs(int x){return x>0?x:-x;}
inline bool dfs(int l,int r,int t)
{
         if(!t)
          if(l==tox&&r==toy)return true;
               else return false;
        if(abs(tox-l)+abs(toy-r)>t||(t-abs(tox-l)+abs(toy-r))%2)return false;//优化；
        for(int i=1;i<=4;i++)
         {
                int u=l+ar[i],y=r+pr[i];
                if(u<=n&&u>0&&y>0&&y<=m)
                 if(!q[u][y]){
                        q[u][y]=1;
                         if(dfs(u,y,t-1))return true;
                        q[u][y]=0;
                 }
         }
        return false;
}
inline void getin(int &x)
{
    char ch=getchar();x=0;
    while(ch==' '||ch=='\n')ch=getchar();
    while(ch!=' '&&ch!='\n')x=x*10+(int)ch-48,ch=getchar();
}
int main()
{
    int xx,yy,t;
    char ch;
    getin(n);getin(m);getin(t);
    while(n+m+t!=0)
    {
        memset(q,0,sizeof(q));
        for(int i=1;i<=n;i++)
         for(int j=1;j<=m;j++)
          {
                while(ch=getchar(),ch=='\n');
                if(ch=='S')xx=i,yy=j;
                 else if(ch=='X')q[i][j]=1;
                  else if(ch=='D')tox=i,toy=j;
          }
        //printf("%d %d\n",tox,toy);
        q[xx][yy]=1;
        if(dfs(xx,yy,t))printf("YES\n");
         else printf("NO\n");
        getin(n);getin(m);getin(t);
    }
    return 0;
}