Stealing Harry Potter's Precious
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 278 Accepted Submission(s): 142
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.
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
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
##@
#.#
1
2 2
4 4
#@##
....
####
....
2
2 1
2 4
0 0
Sample Output
-1
5
Source
Recommend
思路：BFS+DFS
代码：
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <algorithm> #include <cmath> #include <queue> using namespace std; const int MAXN = 1000000000; char map[110][110]; int hash[110][110]; int n,m,k; int the_number; int ans,flag; int the_sum; int the_last_flag; int dfs[10]; int gmap[10][10]; int kposi[10][3]; int move[4][2] = {1,0,-1,0,0,1,0,-1}; struct Node { int x,y; int step; }; int BFS(int x1,int y1,int x2,int y2) { queue <Node> q; Node top; top.x = x1;top.y = y1;top.step = 0; hash[x1][y1] = 1; q.push(top); while(!q.empty()) { Node temp = q.front();q.pop(); if(temp.x == x2 && temp.y == y2) { return temp.step; } for(int i = 0;i < 4;i ++) { int x = temp.x + move[i][0];int y = temp.y + move[i][1]; int step = temp.step + 1; if(hash[x][y] == 0 && map[x][y] == '.' && x >= 1 && x <= n && y >= 1 && y <= m) { hash[x][y] = 1; Node xin; xin.x = x;xin.y = y;xin.step = step; q.push(xin); } } } return -1; } void DFS(int f[],int k,int pre,int sum,int mm) { if(mm == k) { if(ans > sum) ans = sum; } for(int i = 1;i <= k;i ++) if(f[i] == 0) { f[i] = 1; DFS(f,k,i,sum + gmap[pre][i],mm + 1); f[i] = 0; } } int main() { while(~scanf("%d%d",&n,&m) && n + m != 0) { for(int i = 1;i <= n;i ++) for(int j = 1;j <= m;j ++) { scanf(" %c",&map[i][j]); if(map[i][j] == '@') { kposi[0][1] = i; kposi[0][2] = j; map[i][j] = '.'; } } scanf("%d",&k); the_number = k; for(int i = 1;i <= the_number;i ++) { scanf("%d%d",&kposi[i][1],&kposi[i][2]); } memset(gmap,-1,sizeof(gmap)); flag = 0; for(int i = 0;i <= the_number;i ++) { gmap[i][i] = 0; for(int j = 0;j <= the_number;j ++) { memset(hash,0,sizeof(hash)); if(gmap[i][j] == -1 && flag == 0) { gmap[i][j] = gmap[j][i] = BFS(kposi[i][1],kposi[i][2],kposi[j][1],kposi[j][2]); if(gmap[i][j] == -1) { flag = 1; break ; } } } } if(flag == 1) { printf("-1 "); continue ; } int f[10]; ans = 100009; memset(f,0,sizeof(f)); DFS(f,the_number,0,0,0); printf("%d ",ans); } return 0; }
代码：
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <algorithm> #include <cmath> #include <queue> using namespace std; const int MAXN = 1000000000; char map[110][110]; int hash[110][110]; int n,m,k; int the_number; int ans,flag; int the_sum; int the_last_min; int the_last_flag; int dfs[10]; int gmap[10][10]; int kposi[10][3]; int move[4][2] = {1,0,-1,0,0,1,0,-1}; struct Node { int x,y; int step; }; int BFS(int x1,int y1,int x2,int y2) { queue <Node> q; Node top; top.x = x1;top.y = y1;top.step = 0; hash[x1][y1] = 1; q.push(top); while(!q.empty()) { Node temp = q.front();q.pop(); if(temp.x == x2 && temp.y == y2) { return temp.step; } for(int i = 0;i < 4;i ++) { int x = temp.x + move[i][0];int y = temp.y + move[i][1]; int step = temp.step + 1; if(hash[x][y] == 0 && map[x][y] == '.' && x >= 1 && x <= n && y >= 1 && y <= m) { hash[x][y] = 1; Node xin; xin.x = x;xin.y = y;xin.step = step; q.push(xin); } } } return -1; } void DFS(int f[],int k,int pre,int sum,int mm) { if(mm == k) { if(ans > sum) ans = sum; } for(int i = 2;i <= k;i ++) if(f[i] == 0) { f[i] = 1; DFS(f,k,i,sum + gmap[pre][i],mm + 1); f[i] = 0; } } int main() { while(~scanf("%d%d",&n,&m),n != 0 && m != 0) { for(int i = 1;i <= n;i ++) for(int j = 1;j <= m;j ++) { scanf(" %c",&map[i][j]); if(map[i][j] == '@') { kposi[1][1] = i; kposi[1][2] = j; map[i][j] = '.'; } } scanf("%d",&k); the_number = k + 1; for(int i = 2;i <= the_number;i ++) { scanf("%d%d",&kposi[i][1],&kposi[i][2]); } for(int i = 1;i <= the_number;i ++) for(int j = 1;j <= the_number;j ++) { if(i == j) gmap[i][j] = 0; else gmap[i][j] = MAXN; } flag = 0; for(int i = 1;i <= the_number;i ++) { for(int j = 1;j <= the_number;j ++) { memset(hash,0,sizeof(hash)); if(i == j) continue ; else { gmap[i][j] = BFS(kposi[i][1],kposi[i][2],kposi[j][1],kposi[j][2]); if(gmap[i][j] == -1) { flag = 1; break ; } } } } if(flag == 1) printf("-1 "); else { int f[10]; ans = 100009; memset(f,0,sizeof(f)); DFS(f,the_number,1,0,1); printf("%d ",ans); } } return 0; }