【CUGBACM15级BC第14场 B】Harry And Dig Machine

Harry And Dig Machine

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

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 30 0 00 100 00 0 02 21 11 1

 

Sample Output

44

 

题解给的是状压DP，蒟蒻还不会。。因为题意是要让清掉非0的数字且步数最小，我们可以把图中非0的数字的坐标取出来爆搜这些点就可以了，注意用最优性剪一下

/* ***********************************************┆  ┏┓　　　┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃　　　　　　　┃ ┆┆┃　　　━　　　┃ ┆┆┃　┳┛　┗┳　┃ ┆┆┃　　　　　　　┃ ┆┆┃　　　┻　　　┃ ┆┆┗━┓　马　┏━┛ ┆┆　　┃　勒　┃　　┆　　　　　　┆　　┃　戈　┗━━━┓ ┆┆　　┃　壁　　　　　┣┓┆┆　　┃　的草泥马　　┏┛┆┆　　┗┓┓┏━┳┓┏┛ ┆┆　　　┃┫┫　┃┫┫ ┆┆　　　┗┻┛　┗┻┛ ┆************************************************ */#include <iostream>#include <set>#include <map>#include <stack>#include <cmath>#include <queue>#include <cstdio>#include <bitset>#include <string>#include <vector>#include <iomanip>#include <cstring>#include <algorithm>#include <functional>#define PI acos(-1)#define eps 1e-8#define inf 0x3f3f3f3f#define debug(x) cout<<"---"<<x<<"---"<<endltypedef long long ll;using namespace std;const int maxn = 1010;int ans, num, n, m, a[55][55];bool vis[12];int tx[12], ty[12];void dfs(int x, int y, int countt, int step){    //最优性剪枝，这个比较好想    if (step > ans)    {        return ;    }    if (countt == num)    {        ans = min(ans, step + x - 1 + y - 1);        return ;    }    for (int i = 0; i < num; i++)    {        if (!vis[i])        {            vis[i] = 1;            int st = step + abs(x - tx[i]) + abs(y - ty[i]);            dfs(tx[i], ty[i], countt + 1, st);            vis[i] = 0;        }    }}int main(){    while (cin >> n >> m)    {        num = 0;        memset(vis, 0, sizeof(vis));        for (int i = 1; i <= n; i++)        {            for (int j = 1; j <= m; j++)            {                cin >> a[i][j];                if (i == 1 && j == 1)                {                    continue;                }                if (a[i][j])                {                    tx[num] = i;                    ty[num] = j;                    num++;                }            }        }        ans = inf;        dfs(1, 1, 0, 0);        cout << ans << endl;    }    return 0;}/************************************************┆  ┏┓　　　┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃　　　　　　　┃ ┆┆┃　　　━　　　┃ ┆┆┃　┳┛　┗┳　┃ ┆┆┃　　　　　　　┃ ┆┆┃　　　┻　　　┃ ┆┆┗━┓　  　┏━┛ ┆┆　　┃　  　┃　　┆　　　　　　┆　　┃　  　┗━━━┓ ┆┆　　┃　 AC代马 　　┣┓┆┆　　┃　        　　┏┛┆┆　　┗┓┓┏━┳┓┏┛ ┆┆　　　┃┫┫　┃┫┫ ┆┆　　　┗┻┛　┗┻┛ ┆************************************************ */