Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 34211 Accepted Submission(s):
8412
http://acm.hdu.edu.cn/showproblem.php?pid=2102
#include<cstdio> #include<queue> #include<cstring> using namespace std; const int maxn=10+3; char map[2][maxn][maxn]; int book[2][maxn][maxn]; int n,m,c,t,stc,stx,sty,dec,dex,dey,flag; int nex[][2]={{1,0},{0,1},{-1,0},{0,-1}}; void dfs(int c,int x,int y,int time){ if(c==dec&&x==dex&&y==dey){ if(time<=t){ flag=1; } return; } if(time>t||flag==1){ return; } for(int i=0;i<4;i++){ int tx=x+nex[i][0]; int ty=y+nex[i][1]; if(tx<1||tx>n||ty<1||ty>m){ continue; }else if(book[c][tx][ty]==2){ if( (c==0&&(book[1][tx][ty]==1||book[1][tx][ty]==2)) || (c==1&&(book[0][tx][ty]==1||book[0][tx][ty]==2)) ){ continue; }else{ if(c==0){ book[1][tx][ty]=1; dfs(1,tx,ty,time+1); book[1][tx][ty]=0; }else{ book[0][tx][ty]=1; dfs(0,tx,ty,time+1); book[0][tx][ty]=0; } } }else if(book[c][tx][ty]==0){ book[c][tx][ty]=1; dfs(c,tx,ty,time+1); book[c][tx][ty]=0; } } } int main(){ scanf("%d",&c); while(c--){ scanf("%d%d%d",&n,&m,&t); memset(book,0,sizeof(book)); for(int i=0;i<=1;i++){ for(int j=1;j<=n;j++){ getchar(); for(int k=1;k<=m;k++){ scanf("%c",&map[i][j][k]); if(map[i][j][k]==‘P‘){ dec=i,dex=j,dey=k; }else if(map[i][j][k]==‘*‘){ book[i][j][k]=1; }else if(map[i][j][k]==‘#‘){ book[i][j][k]=2; }else if(map[i][j][k]==‘S‘){ stc=i,stx=j,sty=k; } } } getchar(); } flag=0; book[stc][stx][sty]=1; dfs(stc,stx,sty,0); if(flag==1){ printf("YES\n"); }else{ printf("NO\n"); } } return 0; }
原文:https://www.cnblogs.com/qqshiacm/p/10702890.html