zoj 2012 The Proper Key

zoj 2012 The Proper Key,第1张

zoj 2012 The Proper Key
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;bool key[109][109],s[11009][1009],visit[11009][1009];int n,m;int nm,mm;bool in(int y){if(y>=0&&y<mm)return true;return false;}bool door(int x,int y){int i,j;for(i=0; i<n; i++){for(j=0; j<m; j++)if(key[i][j]&&s[i+x][j+y])return false;}return true;}int main(){int cas,i,j,flag;char str[1009];scanf("%d",&cas);while(cas--){memset(key,false,sizeof(key));memset(s,false,sizeof(s));memset(visit,false,sizeof(visit));scanf("%d%d",&n,&m);for(i=0; i<n; i++){scanf("%s",str);for(j=0; j<m; j++){if(str[j]=='#')key[i][j]=true;}}scanf("%d%d",&nm,&mm);nm+=n;for(i=n; i<nm; i++){scanf("%s",str);for(j=0; j<mm; j++){if(str[j]=='#')s[i][j]=true;}}for(i=0; i<mm; i++)visit[0][i]=true;for(i=1; i<nm; i++){flag=false;for(j=0; j<=mm-m; j++){if(!visit[i][j]&&(visit[i-1][j]||(in(j-1)&&visit[i][j-1])||(in(j+1)&&visit[i][j+1]))){if(door(i,j)){flag=true;visit[i][j]=true;if(j>0&&!visit[i][j-1])j-=2;}}}if(!flag)break;}if(i>=nm)printf("The key can fall through.n");elseprintf("The key falls to depth %d.n",i-1);}return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址: http://outofmemory.cn/zaji/4897968.html

(0)
打赏 微信扫一扫 微信扫一扫 支付宝扫一扫 支付宝扫一扫
上一篇 2022-11-12
下一篇 2022-11-12

发表评论

登录后才能评论

评论列表(0条)

保存