Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4867    Accepted Submission(s): 1329

Problem Description
Rompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by human and thus became a tyrant. All those who are against him were put into jail, including our clever Micheal#1. Now it’s time to escape, but Micheal#1 needs an optimal plan and he contacts you, one of his human friends, for help.
The jail area is a rectangle contains n×m little grids, each grid might be one of the following: 
1) Empty area, represented by a capital letter ‘S’. 
2) The starting position of Micheal#1, represented by a capital letter ‘F’. 
3) Energy pool, represented by a capital letter ‘G’. When entering an energy pool, Micheal#1 can use it to charge his battery ONLY ONCE. After the charging, Micheal#1’s battery will become FULL and the energy pool will become an empty area. Of course, passing an energy pool without using it is allowed.
4) Laser sensor, represented by a capital letter ‘D’. Since it is extremely sensitive, Micheal#1 cannot step into a grid with a laser sensor. 
5) Power switch, represented by a capital letter ‘Y’. Once Micheal#1 steps into a grid with a Power switch, he will certainly turn it off.

In order to escape from the jail, Micheal#1 need to turn off all the power switches to stop the electric web on the roof—then he can just fly away. Moving to an adjacent grid (directly up, down, left or right) will cost 1 unit of energy and only moving operation costs energy. Of course, Micheal#1 cannot move when his battery contains no energy.

The larger the battery is, the more energy it can save. But larger battery means more weight and higher probability of being found by the weight sensor. So Micheal#1 needs to make his battery as small as possible, and still large enough to hold all energy he need. Assuming that the size of the battery equals to maximum units of energy that can be saved in the battery, and Micheal#1 is fully charged at the beginning, Please tell him the minimum size of the battery needed for his Prison break.

 
Input
Input contains multiple test cases, ended by 0 0. For each test case, the first line contains two integer numbers n and m showing the size of the jail. Next n lines consist of m capital letters each, which stands for the description of the jail.You can assume that 1<=n,m<=15, and the sum of energy pools and power switches is less than 15.
 
Output
For each test case, output one integer in a line, representing the minimum size of the battery Micheal#1 needs. If Micheal#1 can’t escape, output -1.
 
Sample Input
5 5
GDDSS
SSSFS
SYGYS
SGSYS
SSYSS
0 0
 
Sample Output
4
 
Source
 
Recommend
lcy&zhengfeng

动态规划 状压DP 二分

停在普通点的状态肯定不需要保留,只记录每个特殊点(起点 开关 能量点)的位置,预处理出它们之间的距离。

压缩状态,f[bit][ter]表示当前到达过的点集为bit,停留在ter号点的最大剩余能量。

假定所有的点都只能停留一次(预处理时按可以多次经过来计算距离,而表示状态时多停留并没有用)

二分答案,判定是否可行

顺带一提,由于这份代码中用了大量STL,并且HDU貌似没有-O2,耗时成功垫底233

题目不算难,但状压dp细节好麻烦,位运算时候总是一眼花就写错变量,看好半天才能发现,就很气。

 /*by SilverN*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int mxn=;
const int mx[]={,,,,-};
const int my[]={,,,-,};
int f[][<<];
char mp[][];
int n,m;
int sx,sy;
int yx[],yy[],yct=;
int b[],bct=;int tar;
int dis[][][][];
bool vis[][];
void init(){
memset(dis,0x3f,sizeof dis);
memset(f,-,sizeof f);
return;
}
void BFS(int sx,int sy){
dis[sx][sy][sx][sy]=;
memset(vis,,sizeof vis);
queue<pair<int,int> >q;
q.push(make_pair(sx,sy));
vis[sx][sy]=;
while(!q.empty()){
int x=q.front().first,y=q.front().second;q.pop();
for(int i=;i<=;i++){
int nx=x+mx[i],ny=y+my[i];
if(nx< || nx>n || ny< || ny>m)continue;
if(vis[nx][ny] || mp[nx][ny]=='D')continue;
vis[nx][ny]=;
dis[sx][sy][nx][ny]=dis[sx][sy][x][y]+;
q.push(make_pair(nx,ny));
}
}
return;
}
bool solve(int lim){
memset(f,-,sizeof f);
f[][]=lim;
int i,j,k,ed=(<<(yct+))-;
for(i=;i<=ed;i++){
for(j=;j<=yct;j++){
if(!(i&b[j]))continue;
if((i&tar)==tar && f[j][i]!=-)return ;
if(f[j][i]==-)continue;
for(k=;k<=yct;k++){
if(j==k || (i&b[k]))continue;
int dist=f[j][i]-dis[yx[j]][yy[j]][yx[k]][yy[k]];
if(dist<)continue;
f[k][i|b[k]]=max(f[k][i|b[k]],dist);
if(mp[yx[k]][yy[k]]=='G'){f[k][i|b[k]]=lim;}
}
}
}
return ;
}
int main(){
int i,j;
while(scanf("%d%d",&n,&m) && n && m){
init();bct=yct=;
tar=;
for(i=;i<=n;i++)scanf("%s",mp[i]+);
for(i=;i<=n;i++)
for(j=;j<=m;j++){
if(mp[i][j]=='F'){yx[]=i,yy[]=j;}
else if(mp[i][j]=='Y'){yx[++yct]=i;yy[yct]=j;b[yct]=<<(++bct);tar|=b[yct];}
else if(mp[i][j]=='G'){yx[++yct]=i;yy[yct]=j;b[yct]=<<(++bct);}
}
b[]=;
/* for(i=0;i<=yct;i++){
printf("%d %d",yx[i],yy[i]);
printf(" type:%c\n",mp[yx[i]][yy[i]]);
printf("b:%d\n",b[i]);
}
printf("tat:%d\n",tar);*/
for(i=;i<=yct;i++)BFS(yx[i],yy[i]);
/* for(i=0;i<=yct;i++)
for(j=0;j<=yct;j++){
printf("(%d %d) to (%d %d):",yx[i],yy[i],yx[j],yy[j]);
printf("%d\n",dis[yx[i]][yy[i]][yx[j]][yy[j]]);
}
*/
int l=,r=n*m*,ans=1e8;
while(l<=r){
int mid=(l+r)>>;
if(solve(mid)){
ans=mid;
r=mid-;
}
else l=mid+;
}
if(ans<=n*m*)printf("%d\n",ans);
else printf("-1\n");
}
return ;
}

HDU3681 Prison Break的更多相关文章

  1. HDU 3681 Prison Break(BFS+二分+状态压缩DP)

    Problem Description Rompire is a robot kingdom and a lot of robots live there peacefully. But one da ...

  2. hdu 3681 Prison Break (TSP问题)

    Prison Break Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot ...

  3. hdu 3681 Prison Break(状态压缩+bfs)

    Problem Description Rompire . Now it’s time to escape, but Micheal# needs an optimal plan and he con ...

  4. Prison Break

    Prison Break 时间限制: 1 Sec  内存限制: 128 MB提交: 105  解决: 16[提交][状态][讨论版] 题目描述 Scofild又要策划一次越狱行动,和上次一样,他已经掌 ...

  5. hdu3511 Prison Break 圆的扫描线

    地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=3511 题目: Prison Break Time Limit: 10000/5000 MS ( ...

  6. 1254 - Prison Break

    1254 - Prison Break   PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Mic ...

  7. HDU 3681 Prison Break(状态压缩dp + BFS)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3681 前些天花时间看到的题目,但写出不来,弱弱的放弃了.没想到现在学弟居然写出这种代码来,大吃一惊附加 ...

  8. hdu 3681 Prison Break

    http://acm.hdu.edu.cn/showproblem.php?pid=3681 题意:一个n*m的矩阵,'F'是起点.机器人从F出发,走到G可以充电,走到Y关掉开关,D不能走进,要求把所 ...

  9. light oj 1254 - Prison Break 最短路

    题目大意:n个点m条边的有向图,q次询问c,s,t,表示汽车邮箱容量为c,求从起点s到终点t的最小费用.汽车在每个点可以加任意的油,每个点的单位油价为a[i]. 题目思路:利用最小费优先队列优化最短路 ...

随机推荐

  1. haproxy调度算法

    调度算法详解 用balance指令指明调度算法, 例如:balance roundrobin   1:roundrobin :动态轮询算法,基于后端服务器的总权重做轮询,后端的服务器数量限制在4095 ...

  2. java 基础 --Collection(Set)

    注意: 如果hashSet存储自定义对象,一定要重写hashCode()&&equals() 如果TreeSet存储自定义对象,让元素所属的类实现自然排序接口Comparable,并重 ...

  3. elasticsearch6 学习之批量操作

    环境:elasticsearch6.1.2        kibana6.1.2  一.mget批量查询 mget可以将多个请求才能获的数据,合并到一个请求中以节省网络开销. 1.查询同一个索引下,通 ...

  4. MySQL专题3 SQL 优化

    这两天去京东面试,面试官问了我一个问题,如何优化SQL 我上网查了一下资料,找到了不少方法,做一下记录 (一). 首先使用慢查询分析  通过Mysql 的Slow Query log 可以找到哪些SQ ...

  5. Unity3D for VR 学习(1): 又一个新玩具 暴风魔镜 4(Android)

    2016年伊始,有了VR虚拟现实硬件设备:  暴风魔镜4–好奇者的新玩具 . 2015年下半年的朋友圈中各种VR.AR的新闻层次不穷,搞的我也心痒痒的:好歹咱也是职业的Unity3D程序员,高大上的O ...

  6. ZJOI 2017 day2 4.27

    明天就要比赛啦,今天早点休息. 既然是随便扯,首先就是yyzx的wifi(宁波的这种wifi系统我第一次见,要打开任意一个浏览器,才能跳出界面,网还是挺快的) 上午是学车的翁伊嘉&猪猪侠讲课, ...

  7. windows主机防护

    Netsh命令-修改网络IP设置 网络管理相关函数 Windows用户相关操作 SID(安全标识符) 策略其他说明 主机防护设置 命令行添加防火墙 防火墙规则 使用SetupDI* API列举系统中的 ...

  8. linux设置开机自动启动

    有很多中方法,这里只取最简单的一种: 把启动命令放到/etc/rc.d/rc.local文件里这样就可以每次启动的时候自动启动服务了, 注意给rc.local执行权限

  9. [POI2011]SEJ-Strongbox

    题目大意: 一个有密码箱,数字是0~n-1,其中有若干个密码,密码的特点:若x是密码,y是密码,(x可以等于y)则(x+y)%n也是密码. 给一个n(<=10^14),一个k(k<=min ...

  10. [POJ1094] Sorting It All Out

    link 题目大意 给出$m$个不等式关系,问可以从第几个开始确定所有之间的大小关系.若无解请输出是无法确定还是与已知矛盾. 试题分析 这题是真的是坑啊,尽然放在$floyd$传到闭包上面,还用二分, ...