hdoj3085 / acwing177 Nightmare

双向dfs 男孩女孩每到一个地方标记最小时间第一次来到对方标记的地方的时间就是答案

代码

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>using namespace std;
int n,m;
char s[805][805];
int gh[3][2];
int dis[2][805][805];
queue<pair<int,int> >bq,gq;
int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
bool check(int x,int y,int t)
{return x>=1&&x<=n&&y>=1&&y<=m&&s[x][y]=='.'&&abs(gh[1][0]-x)+abs(gh[1][1]-y)>2*t&&abs(gh[2][0]-x)+abs(gh[2][1]-y)>2*t;
}
int bfs()
{int t=0;while(!bq.empty()&&!gq.empty()){++t;for(int i=1;i<=3;++i)for(int j=1,len=bq.size();j<=len;++j){int x=bq.front().first,y=bq.front().second;bq.pop();if(!check(x,y,t))continue;for(int k=0;k<4;++k){int tx=x+dx[k],ty=y+dy[k];if(!check(tx,ty,t)||dis[0][tx][ty]!=-1)continue;dis[0][tx][ty]=y;if(dis[1][tx][ty]!=-1)return t;bq.push(make_pair(tx,ty));}}for(int i=1,len=gq.size();i<=len;++i){ int x=gq.front().first,y=gq.front().second;gq.pop();if(!check(x,y,t))continue;for(int j=0;j<4;++j){int tx=x+dx[j],ty=y+dy[j];if(!check(tx,ty,t)||dis[1][tx][ty]!=-1)continue;dis[1][tx][ty]=t;if(dis[0][tx][ty]!=-1)return t;gq.push(make_pair(tx,ty));}}}return -1;
}
int main()
{int T;scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);int cnt=0;int bx,by,gx,gy;for(int i=1;i<=n;++i){scanf("%s",s[i]+1);for(int j=1;j<=m;++j){if(s[i][j]=='M')bx=i,by=j,s[i][j]='.';else if(s[i][j]=='G')gx=i,gy=j,s[i][j]='.';else if(s[i][j]=='Z'){++cnt;gh[cnt][0]=i,gh[cnt][1]=j;}}}memset(dis,-1,sizeof(dis));while(!bq.empty())bq.pop();while(!gq.empty())gq.pop();bq.push(make_pair(bx,by));gq.push(make_pair(gx,gy));dis[0][bx][by]=dis[1][gx][gy]=0;printf("%d\n",bfs());}return 0;
}

hdoj3085 / acwing177 Nightmare相关推荐

HDU Problem - 3085 Nightmare Ⅱ（双向BFS）
题目链接 Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and ...
node nightmare 网页自动化测试 sample
安装nightmare 编写1.js 运行 node 1.js var Nightmare = require('nightmare'); var nightmare = Nightmare({ sh ...
Nightmare Ⅱ(BFS)
题目连接: Nightmare Ⅱ 题目: Last night, little erriyue had a horrible nightmare. He dreamed that he and hi ...
G - Nightmare Ⅱ (双向BFS)
题目链接:SDTBU-ACM集训队暑期集训---第一讲 - Virtual Judge Last night, little erriyue had a horrible nightmare. He ...
专题训练二搜索进阶 HDU - 3085 Nightmare Ⅱ （双向BFS + 曼哈顿距离)
HDU - 3085 Nightmare Ⅱ (双向BFS + 曼哈顿距离) Problem Description Last night, little erriyue had a horrible ...
HDU 3085 Nightmare Ⅱ【BFS +曼哈顿距离+综合性较强】
Nightmare Ⅱ Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total S ...
HDU3085 Nightmare Ⅱ —— 双向BFS + 曼哈顿距离
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3085 Nightmare Ⅱ Time Limit: 2000/1000 MS (Java/Other ...
POJ1984 Navigation Nightmare —— 种类并查集
题目链接:http://poj.org/problem?id=1984 Navigation Nightmare Time Limit: 2000MS Memory Limit: 30000K T ...
POJ 1984 Navigation Nightmare 【经典带权并查集】
任意门:http://poj.org/problem?id=1984 Navigation Nightmare Time Limit: 2000MS Memory Limit: 30000K To ...
HDU3085 Nightmare Ⅱ
题目: Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were ...

hdoj3085 / acwing177 Nightmare

hdoj3085 / acwing177 Nightmare相关推荐

最新文章

热门文章