zoukankan      html  css  js  c++  java
  • hdu 5067(暴力搜索)

    Harry And Dig Machine

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


    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.(1n,m50).
    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.( 0a[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
     
    题意:n*m的矩阵里面有k个石头(k<=10) 哈利波特从(0,0)点出发,可以沿着x轴或者y轴在矩阵里面行走,他的任务是在最短的时间内将石头全部取完,问至少需要多少时间他才能取完所有的石头然后回到原点??
    题解:构图然后暴搜。。剪枝。。
    #include <iostream>
    #include <stdio.h>
    #include <math.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <string.h>
    using namespace std;
    const int INF = 999999999;
    struct Point
    {
        int x,y;
    } p[15];
    int n,m,res,cnt;
    int graph[15][15];
    bool vis[15];
    void dfs(int x,int dept,int ans)
    {
        vis[x] = true;
        if(ans>res) return ; ///剪枝
        if(dept==cnt-1)
        {
            ans += graph[x][0]; ///走回去
            res = min(res,ans);
            return ;
        }
        for(int i=0; i<cnt; i++)
        {
            if(!vis[i]&&graph[x][i]!=INF&&x!=i)
            {
                dfs(i,dept+1,ans+graph[x][i]);
                vis[i] = false;
            }
        }
    }
    int main()
    {
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            cnt = 0;
            int v;
            for(int i=0; i<n; i++)
            {
                for(int j=0; j<m; j++)
                {
                    scanf("%d",&v);
                    if(i==0&&j==0)
                    {
                        p[cnt].x = i,p[cnt++].y=j;
                    }
                    else if(v)
                    {
                        p[cnt].x = i,p[cnt++].y=j;
                    }
                }
            }
            for(int i=0; i<cnt; i++)
            {
                for(int j=0; j<cnt; j++)
                {
                    if(i==j)graph[i][j] = 0;
                    else graph[i][j] =INF;
                }
            }
            for(int i=0; i<cnt; i++)
            {
                for(int j=i+1; j<cnt; j++)
                {
                    graph[i][j] = graph[j][i] = abs(p[i].x-p[j].x)+abs(p[i].y-p[j].y);
                }
            }
            /*for(int i=0; i<cnt; i++)
            {
                for(int j=0; j<cnt; j++)
                {
                    printf("%d ",graph[i][j]);
                }
                printf("
    ");
            }*/
            memset(vis,false,sizeof(vis));
            res = INF;
            vis[0] = true;
            dfs(0,0,0);
            printf("%d
    ",res);
        }
        return 0;
    }
  • 相关阅读:
    游标
    js问题杂记
    博客园页面设置
    Natas13 Writeup(文件上传,绕过图片签名检测)
    Natas12 Writeup(文件上传漏洞)
    Natas11 Writeup(常见编码、异或逆推、修改cookie)
    Natas10 Writeup(正则表达式、grep命令)
    Natas9 Writeup(命令注入)
    Natas8 Writeup(常见编码、php函数)
    Natas7 Writeup(任意文件读取漏洞)
  • 原文地址:https://www.cnblogs.com/liyinggang/p/5657268.html
Copyright © 2011-2022 走看看