hdu 4771 状态压缩+bfs Stealing Harry Potter's Precious
来源:互联网 发布:淘宝运动鞋店铺 编辑:程序博客网 时间:2024/05/16 12:40
Problem Description
Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon's home. But he can't bring his precious with him. As you know, uncle Vernon never allows such magic things in his house. So Harry has to deposit his precious in the Gringotts Wizarding Bank which is owned by some goblins. The bank can be considered as a N × M grid consisting of N × M rooms. Each room has a coordinate. The coordinates of the upper-left room is (1,1) , the down-right room is (N,M) and the room below the upper-left room is (2,1)..... A 3×4 bank grid is shown below:
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.
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
There are several test cases.
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
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
For each test case, print the minimum number of steps Dudely must take. If Dudely can't get all Harry's things, print -1.
Sample Input
2 3##@#.#12 24 4#@##....####....22 12 40 0
Sample Output
-15bfs 有个新的遍历,就是用结构体,有几维数据,就结构几个数,同时BFS查找;#include<stdio.h>#include<string.h>#include<queue>#include<algorithm>#include<iostream>using namespace std;int n,m,num;int Map[125][125];int dp[1<<4][125][125];struct ele{ int x; int y; int now;}xin,tou;int dir[4][2]={0,-1,0,1,1,0,-1,0};struct ee{ int x; int y;}a[6];int px,py;bool ok(ele p){ return p.x>=0&&p.y<n&&p.y>=0&&p.y<m&&(!dp[p.now][p.x][p.y])&&Map[p.x][p.y];}int solve(){ queue<ele>Q; memset(dp,0,sizeof(dp)); int i,j; xin.x=px; xin.y=py; xin.now=0; for(i=0;i<num;i++) if(xin.x==a[i].x&&xin.y==a[i].y) break; if(i<num) xin.now=0|(1<<i); Q.push(xin); dp[xin.now][xin.x][xin.y]=1; while(!Q.empty()) { tou=Q.front(); Q.pop(); if(tou.now==(1<<num)-1) return dp[tou.now][tou.x][tou.y]-1; for(i=0;i<4;i++) { xin.x=tou.x+dir[i][0]; xin.y=tou.y+dir[i][1]; xin.now=tou.now; for(j=0;j<num;j++) if(xin.x==a[j].x&&xin.y==a[j].y) break; if(j<num) xin.now=xin.now|(1<<j); if(ok(xin)) { dp[xin.now][xin.x][xin.y]=dp[tou.now][tou.x][tou.y]+1; Q.push(xin); } } } return -1;}int main(){ int i,j; char c; while(scanf("%d%d",&n,&m),(n+m)) { for(i=0;i<n;i++) for(j=0;j<m;j++) { cin>>c; if(c=='@') { px=i; py=j; Map[i][j]=1; } if(c=='.') Map[i][j]=1; if(c=='#') Map[i][j]=0; } scanf("%d",&num); for(i=0;i<num;i++) { scanf("%d%d",&a[i].x,&a[i].y); a[i].x--; a[i].y--; } printf("%d\n",solve()); } return 0;}
0 0
- hdu 4771 状态压缩+bfs Stealing Harry Potter's Precious
- hdu 4771 Stealing Harry Potter's Precious (bfs+状态压缩)
- HDU 4771 Stealing Harry Potter's Precious(bfs+状态压缩)
- HDOJ 4771 Stealing Harry Potter's Precious(bfs + 状态压缩)
- HDU-#4771 Stealing Harry Potter's Precious(bfs+状态压缩)
- hdu 4771 Stealing Harry Potter's Precious(BFS+状态压缩)
- hdu 4771Stealing Harry Potter's Precious(状态压缩bfs)
- hdu4771,Stealing Harry Potter's Precious,bfs,状态压缩
- hdu4771 Stealing Harry Potter’s Precious(状态压缩+bfs)
- hdu 4774 Stealing Harry Potter's Precious 状态压缩+bfs 解题报告
- hdu 4771 Stealing Harry Potter's Precious(bfs预处理&TSP)
- HDU-4771 Stealing Harry Potter's Precious DFS + BFS
- hdu 4771 Stealing Harry Potter's Precious(bfs)
- HDU 4771 Stealing Harry Potter's Precious(BFS + DFS)
- HDU 4771 Stealing Harry Potter's Precious【BFS+DFS】
- HDU-4771 Stealing Harry Potter's Precious 状压DP+BFS
- HDU 4771 Stealing Harry Potter's Precious(bfs+dfs)
- hdu 4771 Stealing Harry Potter's Precious(bfs+枚举)
- 3.1.5、准备卸载你的应用程序
- 我应该如何有效地学习linux?(持续更新)
- 使用lua螺旋打印数组
- Mac OS X下使用launchctl定时启动AppleScript脚本
- flex前端写的bean最好注册一下
- hdu 4771 状态压缩+bfs Stealing Harry Potter's Precious
- 数字语音信号处理的举例
- 算法学习 - Hash Table操作,分离链接法解决哈希冲突
- flex-DataGrid滚动条特别卡的解决方法
- JavaBean理解
- poj 2184 Cow Exhibition(处理负数的01背包)
- 虚拟内存之建置
- NYOJ 20 吝啬的国度
- fle弹出窗口的方法大概有以下两种