HDU 5067 Harry And Dig Machine (DFS)

Harry And Dig Machine

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 784    Accepted Submission(s): 302

Problem Description

  As we all know, Harry Porter learns magic at Hogwarts School. However, learning magical knowledge alone is insufficient to become a great magician. Sometimes, Harry also has to gain knowledge from other certain subjects, such as language, mathematics, English, and even algorithm. 
  Dumbledore, the headmaster of Hogwarts, is planning to construct a new teaching building in his school. The area he selects can be considered as an n*m grid, some (but no more than ten) cells of which might contain stones. We should remove the stones there in order to save place for the teaching building. However, the stones might be useful, so we just move them to the top-left cell. Taking it into account that Harry learned how to operate dig machine in Lanxiang School several years ago, Dumbledore decides to let him do this job and wants it done as quickly as possible. Harry needs one unit time to move his dig machine from one cell to the adjacent one. Yet skilled as he is, it takes no time for him to move stones into or out of the dig machine, which is big enough to carry infinite stones. Given Harry and his dig machine at the top-left cell in the beginning, if he wants to optimize his work, what is the minimal time Harry needs to finish it?

 

Input

They are sever test cases, you should process to the end of file.
For each test case, there are two integers n and m. (1≤n,m≤50) .
The next n line, each line contains m integer. The j-th number of  ith  line a[i][j] means there are a[i][j] stones on the  jth  cell of the  ith  line.(  0≤a[i][j]≤100  , and no more than 10 of a[i][j] will be positive integer).

 

Output

For each test case, just output one line that contains an integer indicate the minimal time that Harry can finish his job.

 

Sample Input

  
  

   
   3 3
0 0 0
0 100 0
0 0 0
2 2
1 1
1 1
  
  

 

Sample Output

  
  

   
   4
4
  
  

 

Source

BestCoder Round #14

 

题目大意：在一个n*m的网格里，有些网格里有石头，现在从网格的左上方出发要将网格里的石头全部运送到左上方，问所需要的最短时间。

解题思路：网格的大小在50*50以内，并且有石头的网格不超过10个，那么可以将有石头的网格记录下来，然后用DFS暴力搜索一次即可。

代码如下：

//找出所有有石头的点，DFS暴力搜索
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
#include <limits.h>
#define debug "output for debug\n"
#define pi (acos(-1.0))
#define eps (1e-6)
#define inf (1<<28)
#define sqr(x) (x) * (x)
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef unsigned long long ULL;
#define MAX 1005
int ans,k,a[55][55],vis[15],dx[15],dy[15];
//
void DFS(int x,int y,int z,int step)
{
    int i,temp;
    if(step>ans)
        return ;
    if(z==k)
    {
        ans=min(ans,step+x-1+y-1);
        return ;
    }
    for(i=0;i<k;i++)
    {
        if(!vis[i])
        {
            vis[i]=1;
            temp=step+abs(x-dx[i])+abs(y-dy[i]);
            DFS(dx[i],dy[i],z+1,temp);
            vis[i]=0;
        }
    }
}
int main()
{
    int i,j,n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(vis,0,sizeof(vis));
        k=0;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
                if(i==1&&j==1)
                    continue;
                if(a[i][j])
                {
                    dx[k]=i;
                    dy[k]=j;
                    k++;
                }
            }
        }
        ans=inf;
        DFS(1,1,0,0);
        printf("%d\n",ans);
    }
    return 0;
}