Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10574 Accepted Submission(s): 2504
#include<stdio.h> #include<queue> #include<string.h> using namespace std; struct haha { int x; int y; int k; }q,temp; int n,m,kk,x1,y1,x2,y2,vis[111][111]; int dir[4][2]={0,1,0,-1,1,0,-1,0}; char map[111][111]; int can(int x,int y) { if(x>=1&&x<=n&&y>=1&&y<=m&&map[x][y]!='*'&&!vis[x][y]) return 1; return 0; } void BFS() { int i; queue<struct haha>que; memset(vis,0,sizeof(vis)); q.x=x1;q.y=y1;q.k=-1; que.push(q); while(!que.empty()) { temp=que.front(); que.pop(); if(temp.k>kk) {printf("no\n");return ;} if(temp.x==x2&&temp.y==y2 ) {printf("yes\n");return;} vis[temp.x][temp.y]=1; for(i=0;i<4;i++) { q.x=temp.x+dir[i][0];q.y=temp.y+dir[i][1]; while(can(q.x,q.y)) { q.k=temp.k+1; que.push(q); q.x=q.x+dir[i][0]; q.y=q.y+dir[i][1]; } } } printf("no\n"); } int main() { int cas,i; scanf("%d",&cas); while(cas--) { scanf("%d %d",&n,&m); for(i=1;i<=n;i++) scanf("%s",map[i]+1); scanf("%d %d %d %d %d",&kk,&y1,&x1,&y2,&x2); if(x1==x2&&y1==y2) { printf("yes\n"); continue; } BFS(); } return 0; }