hdu 4771 13 杭州 现场 B - Stealing Harry Potter's Precious 暴力bfs 难度:0
Description
Some rooms are indestructible and some rooms are vulnerable. Goblins always care more about their own safety than their customers' properties, so they live in the indestructible rooms and put customers' properties in vulnerable rooms. Harry Potter's precious are also put in some vulnerable rooms. Dudely wants to steal Harry's things this holiday. He gets the most advanced drilling machine from his father, uncle Vernon, and drills into the bank. But he can only pass though the vulnerable rooms. He can't access the indestructible rooms. He starts from a certain vulnerable room, and then moves in four directions: north, east, south and west. Dudely knows where Harry's precious are. He wants to collect all Harry's precious by as less steps as possible. Moving from one room to another adjacent room is called a 'step'. Dudely doesn't want to get out of the bank before he collects all Harry's things. Dudely is stupid.He pay you $1,000,000 to figure out at least how many steps he must take to get all Harry's precious.
Input
In each test cases:
The first line are two integers N and M, meaning that the bank is a N × M grid(0<N,M <= 100).
Then a N×M matrix follows. Each element is a letter standing for a room. '#' means a indestructible room, '.' means a vulnerable room, and the only '@' means the vulnerable room from which Dudely starts to move.
The next line is an integer K ( 0 < K <= 4), indicating there are K Harry Potter's precious in the bank.
In next K lines, each line describes the position of a Harry Potter's precious by two integers X and Y, meaning that there is a precious in room (X,Y).
The input ends with N = 0 and M = 0
Output
Sample Input
##@
#.#
1
2 2
4 4
#@##
....
####
....
2
2 1
2 4
0 0
Sample Output
5
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
const int inf=0x7ffffff;
int n,m,k;
int px[],py[];//记录珍宝坐标,德拉克坐标设为第0个
int d[][];//记录珍宝间最短距离
char maz[][];//记录迷宫状态
int ind[][];//记录珍宝编号
bool vis[][];//bfs用
int dis[][];//bfs用,最短距
const int dx[]={,-,,};const int dy[]={,,-,};
bool ok(int x,int y){
return x>=&&x<n&&y>=&&y<m&&maz[x][y]!='#';
}
void bfs(int index){
int sx=px[index],sy=py[index];
for(int i=;i<n;i++)for(int j=;j<m;j++)dis[i][j]=inf;
memset(vis,,sizeof(vis));
vis[sx][sy]=true;
d[index][index]=;
dis[sx][sy]=;
queue<P>que;
que.push(P(sx,sy));
while(!que.empty()){
sx=que.front().first;sy=que.front().second;que.pop();
for(int i=;i<;i++){
int tx=sx+dx[i],ty=sy+dy[i];
if(ok(tx,ty)&&!vis[tx][ty]){
vis[tx][ty]=true;dis[tx][ty]=dis[sx][sy]+;
if(ind[tx][ty]!=||maz[tx][ty]=='@'){
d[index][ind[tx][ty]]=dis[tx][ty];}
que.push(P(tx,ty));
}
}
}
}
int getlength(int a[]){
int ans=;
for(int i=;i<k;i++)ans+=d[a[i]][a[i+]];
return ans;
}
int pre(){
int a[];//暴力枚举所有可能排列
for(int i=;i<=k;i++)a[i]=i;//需注意第一个排列
int ans=getlength(a);
while(next_permutation(a+,a+k+)){//注意不要直接排列k
ans=min(ans,getlength(a));
}
return ans;
}
int main(){
while(scanf("%d%d",&n,&m)){
if(n==&&m==)break;
for(int i=;i<n;i++){
scanf("%s",maz[i]);
}
scanf("%d",&k);
memset(ind,,sizeof(ind));
for(int i=;i<=k;i++){scanf("%d%d",px+i,py+i);px[i]--;py[i]--;ind[px[i]][py[i]]=i;}
for(int i=;i<n;i++){
for(int j=;j<m;j++){
if(maz[i][j]=='@'){
px[]=i;
py[]=j;
ind[i][j]=;
break;
}
}
}
for(int i=;i<;i++)for(int j=;j<;j++)d[i][j]=inf;
for(int i=;i<=k;i++)bfs(i);
int ans=pre();
printf("%d\n",ans==inf?-:ans);
}
return ;
}
hdu 4771 13 杭州 现场 B - Stealing Harry Potter's Precious 暴力bfs 难度:0的更多相关文章
- hdu 3682 10 杭州 现场 C To Be an Dream Architect 容斥 难度:0
C - To Be an Dream Architect Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d &a ...
- HDU 4771 Stealing Harry Potter's Precious dfs+bfs
Stealing Harry Potter's Precious Problem Description Harry Potter has some precious. For example, hi ...
- hdu 4770 13 杭州 现场 A - Lights Against Dudely 暴力 bfs 状态压缩DP 难度:1
Description Harry: "But Hagrid. How am I going to pay for all of this? I haven't any money.&quo ...
- 【HDU 4771 Stealing Harry Potter's Precious】BFS+状压
2013杭州区域赛现场赛二水... 类似“胜利大逃亡”的搜索问题,有若干个宝藏分布在不同位置,问从起点遍历过所有k个宝藏的最短时间. 思路就是,从起点出发,搜索到最近的一个宝藏,然后以这个位置为起点, ...
- hdu4771 Stealing Harry Potter's Precious(DFS,BFS)
练习dfs和bfs的好题. #include<iostream> #include<cstdio> #include<cstdlib> #include<cs ...
- HDU 4771 Stealing Harry Potter's Precious (2013杭州赛区1002题,bfs,状态压缩)
Stealing Harry Potter's Precious Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 ...
- HDU 4771 Stealing Harry Potter's Precious
Stealing Harry Potter's Precious Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 ...
- hdu 4771 Stealing Harry Potter's Precious (2013亚洲区杭州现场赛)(搜索 bfs + dfs) 带权值的路径
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4771 题目意思:'@' 表示的是起点,'#' 表示的是障碍物不能通过,'.' 表示的是路能通过的: ...
- hdu 3685 10 杭州 现场 F - Rotational Painting 重心 计算几何 难度:1
F - Rotational Painting Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & % ...
随机推荐
- [HZNUOJ] 博
Description 定义一个数字序列为“非下降序列”: 此处我们约定用$n\;表示数字序列的长度,下面定义在n \in [1, \infty]时有效$ $if \;\; n = 1:$ $\;\; ...
- Android4.0 Surface机制分析
1. java层面的Surface 对于Surface我们的认识主要是android的类Surface, android的文档描述Surface是"Handle onto a raw ...
- Hadoop2.0环境搭建
需准备的前提条件: 1. 安装JDK(自行安装) 2. 关闭防火墙(centos): systemctl stop firewalld.service systemctl disable firewa ...
- 播放48KHZ有1S的停顿
两个音频文件: /usr/lib/gstreamer-0.10/libgstflump3dec.so /usr/lib/gstreamer-0.10/libgstflumpegdemux.so
- message from server: "Host '192.168.6.68' is blocked because of many connection errors; unblock with 'mysqladmin flush-hosts
系统或者程序连接数据报错 null, message from server: "Host '192.168.6.68' is blocked because of many connect ...
- 【.Net基础一】 类型、对象、线程栈、托管堆运行时的相互关系
目前在看CLR via C#,把总结的记下来,索性就把他写成一个系列吧. 1.[.Net基础一] 类型.对象.线程栈.托管堆运行时的相互关系 2.[.Net基础二]浅谈引用类型.值类型和装箱.拆箱 J ...
- Atom中设置你的Snippet,atom技巧(二)
我们经常需要对二维数组进行迭代,比如这样: for(int x = 0; x < width; x++){ for(int y = 0; y < height; y++){ screen[ ...
- Docker入门简明教程
Docker简介 概念 Docker是基于Go语言实现的云开源项目,是基于Linux的多项开源技术提供高效.敏捷和轻量级的容器方案.创建于2013年初.自从开源后就受到了广泛的关注,从长远的眼光来看, ...
- elasticsearch搜索集群基础架构
1. elasticsearch cluster搭建 http://www.cnblogs.com/kisf/p/7326980.html 为了配套spring boot,elasticsear ...
- golang test 单元测试
golang自家的单元测试做的很好了,自需要"文件名_test.go" 就可以在里面写单元测试,而且go test命令也很强大,可以只运行单个测试函数,在goland 可以点击单元 ...