hdu 4771 搜索+状压
2014-11-05 11:20
204 查看
Stealing Harry Potter's Precious
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1616 Accepted Submission(s): 768
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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
[align=left]Output[/align]
For each test case, print the minimum number of steps Dudely must take. If Dudely can't get all Harry's things, print -1.
[align=left]Sample Input[/align]
2 3 ##@ #.# 1 2 2 4 4 #@## .... #### .... 2 2 1 2 4 0 0
[align=left]Sample Output[/align]
-1 5
[align=left]Source[/align]
2013 Asia Hangzhou Regional Contest
#include<stdio.h> #include<string.h> #include<queue> #define N 200 using namespace std; struct node { int x,y,s,t; }start,cur,next; int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}}; int dis [20],a ,n,m,k; char str ; int bfs(struct node start) { int i,x,y; queue<node>q; cur.x=start.x; cur.y=start.y; cur.t=0; cur.s=a[start.x][start.y]; memset(dis,0,sizeof(dis)); dis[cur.x][cur.y][cur.s]=1; if(cur.s==((1<<k)-1)) return cur.t; q.push(cur); while(!q.empty()) { cur=q.front(); q.pop(); for(i=0;i<4;i++) { next.x=x=cur.x+dir[i][0]; next.y=y=cur.y+dir[i][1]; next.t=cur.t+1; next.s=cur.s|a[x][y]; if(!dis[x][y][next.s]&&x>=1&&x<=n&&y>=1&&y<=m&&str[x][y]!='#') { if(next.s==((1<<k)-1)) return next.t; dis[x][y][next.s]=1; q.push(next); } } } return -1; } int main() { int i,j,x,y,ans; while(scanf("%d%d",&n,&m)!=EOF) { if(n==0&&m==0) break; for(i=1;i<=n;i++) scanf("%s",str[i]+1); for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { if(str[i][j]=='@') { start.x=i; start.y=j; } } } scanf("%d",&k); memset(a,0,sizeof(a)); for(i=1;i<=k;i++) { scanf("%d%d",&x,&y); a[x][y]=1<<(i-1); } ans=bfs(start); printf("%d\n",ans); } return 0; }
相关文章推荐
- Hdu 4771 Stealing Harry Potter's Precious (搜索)
- 【搜索+状压DP】 HDU 3681 Prison Break
- HDU 3681 Prison Break (搜索+状压dp)
- HDU 4771 Stealing Harry Potter's Precious【bfs+状压】
- 【BFS+状压】HDU_4771_Stealing Harry Potter's Precious
- hdu 4771 状态压缩搜索
- hdu 4771 Stealing Harry Potter's Precious(搜索,状压,TSP)
- Stealing Harry Potter's Precious hdu 4771 (搜索)
- hdu 4771 Stealing Harry Potter's Precious (2013亚洲区杭州现场赛)(搜索 bfs + dfs) 带权值的路径
- HDU 5025 Saving Tang Monk 搜索+状压DP
- HDU 2446(搜索题,二分)
- HDU 2141(搜索题,二分)
- HDU 1969(搜索题,二分)
- HDU 1251(搜索题,典型的字典树问题)
- hdu 1015 Safecracker 暴力搜索
- HDU 2899(搜索题,二分)
- hdu 1242 Rescue BFS搜索
- HDU 1399(搜索题,暴力- -!)
- HDU 1551(搜索题,二分)
- HDU 1016(搜索题,DFS)